default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 134 matches
- 2021
- Kirill V. Andreev, Pavel S. Rybin, Alexey A. Frolov:
Unsourced Random Access Based on List Recoverable Codes Correcting t Errors. ITW 2021: 1-6 - Arda Atalik, Alper Köse, Michael Gastpar:
Differential Entropy of the Conditional Expectation under Gaussian Noise. ITW 2021: 1-6 - Minwoo Bae, Walter O. Krawec:
Semi-Source Independent Quantum Walk Random Number Generation. ITW 2021: 1-6 - Daniella Bar-Lev, Omer Sabary, Yotam Gershon, Eitan Yaakobi:
The Intersection of Insertion and Deletion Balls. ITW 2021: 1-6 - Luca Barletta, Alex Dytso:
Scalar Gaussian Wiretap Channel: Bounds on the Support Size of the Secrecy-Capacity-Achieving Distribution. ITW 2021: 1-6 - Shobhit Bhatnagar, Biswadip Chakraborti, P. Vijay Kumar:
Streaming Codes for Handling a Combination of Burst and Random Erasures. ITW 2021: 1-6 - M. Bilkis, Matteo Rosati, John Calsamiglia:
Reinforcement-learning calibration of coherent-state receivers on variable-loss optical channels. ITW 2021: 1-6 - Irina E. Bocharova, Boris D. Kudryashov, Evgenii P. Ovsyannikov, Vitaly Skachek:
A Random Coding Bound on the ML Decoding Error Probability for NB LDPC Coded QAM Signals. ITW 2021: 1-6 - Holger Boche, Christian Deppe:
Computability of the Zero-Error Capacity of Noisy Channels. ITW 2021: 1-6 - Amitalok J. Budkuley, Pranav Joshi, Manideep Mamindlapally, Anuj Kumar Yadav:
On the Commitment Capacity of Reverse Elastic Channels. ITW 2021: 1-6 - Giulia Cervia, Tobias J. Oechtering, Mikael Skoglund:
(ϵ, n) Fixed-Length Strong Coordination Capacity. ITW 2021: 1-6 - Sayantan Chakraborty, Aditya Nema, Pranab Sen:
One-shot inner bounds for sending private classical information over a quantum MAC. ITW 2021: 1-6 - Meng-Che Chang, Matthieu R. Bloch:
Covert Sequential Hypothesis Testing. ITW 2021: 1-6 - Charalambos D. Charalambous, Christos K. Kourtellaris, Stelios Louka:
Sequential Characterizations of Cover and Pombra Gaussian Feedback Capacity: Generalizations to MIMO Channels via Sufficient Statistic. ITW 2021: 1-6 - Hao-Chung Cheng, Baris Nakiboglu:
On the Existence of the Augustin Mean. ITW 2021: 1-6 - Eli Chien, Pan Li, Olgica Milenkovic:
Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs. ITW 2021: 1-6 - Chak Fung Choi, Cheuk Ting Li:
Multiple-Output Channel Simulation and Lossy Compression of Probability Distributions. ITW 2021: 1-6 - Vidyalaxmi Dani, Venkatesh Ramaiyan, Devendra Jalihal:
Covert Communication over Asynchronous Channels with Timing Advantage. ITW 2021: 1-6 - Anindya Bijoy Das, Aditya Ramamoorthy:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. ITW 2021: 1-6 - M. Bora Dogan, Michael Gastpar:
Lower Bounds on the Expected Excess Risk Using Mutual Information. ITW 2021: 1-6 - Elad Domanovitz, Gustavo Kasper Facenda, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Guaranteed Rate of Streaming Erasure Codes over Multi-Link Multi-hop Network. ITW 2021: 1-6 - Ilya Dumer, Navid Gharavi:
Combined polar-LDPC design for channels with high noise. ITW 2021: 1-6 - Elsa Dupraz, Lav R. Varshney, François Leduc-Primeau:
Power-Efficient Deep Neural Networks with Noisy Memristor Implementation. ITW 2021: 1-5 - Alex Dytso, Luca Barletta, Shlomo Shamai Shitz:
Amplitude Constrained Poisson Noise Channel: Properties of the Capacity-Achieving Input Distribution. ITW 2021: 1-6 - Alex Dytso, Martina Cardone:
A General Derivative Identity for the Conditional Expectation with Focus on the Exponential Family. ITW 2021: 1-6 - Mehrangiz Ensan, Hamdi Joudeh, Alex Alvarado, Ulf Gustavsson, Frans M. J. Willems:
On Cloud Radio Access Networks With Cascade Oblivious Relaying. ITW 2021: 1-6 - Rami Ezzine, Moritz Wiese, Christian Deppe, Holger Boche:
Outage Common Randomness Capacity Characterization of Multiple-Antenna Slow Fading Channels. ITW 2021: 1-6 - Borja Rodríguez Gálvez, Ragnar Thobaben, Mikael Skoglund:
A Variational Approach to Privacy and Fairness. ITW 2021: 1-6 - Abbas El Gamal, Amin Gohari, Chandra Nair:
Achievable Rates for the Relay Channel with Orthogonal Receiver Components. ITW 2021: 1-6 - Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund:
Secure Source Coding with Side-information at Decoder and Shared Key at Encoder and Decoder. ITW 2021: 1-6
skipping 104 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-09 08:52 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint