default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Schrammar
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c10]Kiichi Tateishi, Daisuke Kurita, Atsushi Harada, Yoshihisa Kishiyama, Shoji Itoh, Hideshi Murai, Nicolas Schrammar, Arne Simonsson, Peter Ökvist:
Experimental evaluation of advanced beam tracking with CSI acquisition for 5G radio access. ICC 2017: 1-6- 2016
- [c9]Rafia Inam, Nicolas Schrammar, Keven Wang, Athanasios Karapantelakis, Leonid Mokrushin, Aneta Vulgarakis Feljan, Elena Fersman:
Feasibility assessment to realise vehicle teleoperation using cellular networks. ITSC 2016: 2254-2260 - 2015
- [j4]Nicolas Schrammar, Mikael Skoglund:
Approximate Secrecy Capacity of Gaussian Parallel Relay Networks. IEEE Trans. Inf. Theory 61(10): 5525-5534 (2015) - 2014
- [j3]Frederic Gabry, Nan Li, Nicolas Schrammar, Maksym A. Girnyk
, Lars K. Rasmussen, Mikael Skoglund:
On the Optimization of the Secondary Transmitter's Strategy in Cognitive Radio Channels with Secrecy. IEEE J. Sel. Areas Commun. 32(3): 451-463 (2014) - [j2]Nicolas Schrammar, Mikael Skoglund, Chao Wang, Lars Kildehoj Rasmussen:
New Achievable Rates for Gaussian Partially Cognitive Interference Channels With Multiple Cognitive Pairs. IEEE Trans. Commun. 62(6): 2051-2060 (2014) - 2013
- [b1]Nicolas Schrammar:
On Deterministic Models for Gaussian Networks. Royal Institute of Technology, Stockholm, Sweden, 2013 - 2012
- [j1]Nicolas Schrammar, Mikael Skoglund:
Transmission Strategies for Wireless Relay Networks Obtained from Linear Finite-Field Deterministic Models. IEEE Trans. Commun. 60(8): 2167-2176 (2012) - [c8]Nicolas Schrammar, Chao Wang, Lars K. Rasmussen, Mikael Skoglund:
On the discrete superposition model of partially cognitive interference channels. ACSCC 2012: 1813-1817 - [c7]Nicolas Schrammar, Mikael Skoglund:
Approximating the capacity of wireless multiple unicast networks by discrete superposition model. ACSCC 2012: 1913-1917 - [c6]Nicolas Schrammar, Hamed Farhadi, Lars K. Rasmussen, Mikael Skoglund:
Average throughput in AWGN cognitive fading interference channel with multiple secondary pairs. CrownCom 2012: 158-162 - [c5]Frederic Gabry, Nan Li, Nicolas Schrammar, Maksym A. Girnyk, Eleftherios Karipidis, Ragnar Thobaben, Lars K. Rasmussen, Erik G. Larsson, Mikael Skoglund:
Secure broadcasting in cooperative cognitive radio networks. Future Network & Mobile Summit 2012: 1-8 - [c4]Frederic Gabry, Nicolas Schrammar, Maksym A. Girnyk, Nan Li, Ragnar Thobaben, Lars K. Rasmussen:
Cooperation for secure broadcasting in cognitive radio networks. ICC 2012: 5613-5618 - 2011
- [c3]Nicolas Schrammar, Mattias Andersson, Mikael Skoglund:
Approximate capacity of the general gaussian parallel relay network. ISIT 2011: 89-93 - [c2]Nicolas Schrammar, Mikael Skoglund:
Capacity bounds for the discrete superposition model of the Gaussian multiple-access channel. WCNC 2011: 1590-1595 - 2010
- [c1]Nicolas Schrammar, Mikael Skoglund:
Transmission Strategies for Gaussian Relay Networks Obtained from Deterministic Models. GLOBECOM 2010: 1-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
