Остановите войну!
for scientists:
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 525 matches
- 2019
- Ali Dehghan, Amir H. Banihashemi:
Asymptotic Average Multiplicity of Structures Within Different Categories of Trapping Sets, Absorbing Sets, and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles. IEEE Trans. Inf. Theory 65(10): 6022-6043 (2019) - Yanjun Li, Yoram Bresler:
Multichannel Sparse Blind Deconvolution on the Sphere. IEEE Trans. Inf. Theory 65(11): 7415-7436 (2019) - Farhad Shirani, S. Sandeep Pradhan:
On the Sub-Optimality of Single-Letter Coding Over Networks. IEEE Trans. Inf. Theory 65(10): 6115-6135 (2019) - Stefano Maranò, Ali H. Sayed:
Detection Under One-Bit Messaging Over Adaptive Networks. IEEE Trans. Inf. Theory 65(10): 6519-6538 (2019) - Lin Zhou, Mehul Motani:
Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems. IEEE Trans. Inf. Theory 65(10): 6414-6440 (2019) - Fan Li, Jinyuan Chen, Zhiying Wang:
Wireless MapReduce Distributed Computing. IEEE Trans. Inf. Theory 65(10): 6101-6114 (2019) - Emmanuel Abbe, Tamir Bendory, William E. Leeb, João M. Pereira, Nir Sharon, Amit Singer:
Multireference Alignment Is Easier With an Aperiodic Translation Distribution. IEEE Trans. Inf. Theory 65(6): 3565-3584 (2019) - Felix Abramovich, Vadim Grinshtein:
High-Dimensional Classification by Sparse Logistic Regression. IEEE Trans. Inf. Theory 65(5): 3068-3079 (2019) - Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Linear Programming Approximations for Index Coding. IEEE Trans. Inf. Theory 65(9): 5547-5564 (2019) - Inaki Estella Aguerri, Abdellatif Zaidi, Giuseppe Caire, Shlomo Shamai Shitz:
On the Capacity of Cloud Radio Access Networks With Oblivious Relaying. IEEE Trans. Inf. Theory 65(7): 4575-4596 (2019) - Patrick Ah-Fat, Michael Huth:
Optimal Accuracy-Privacy Trade-Off for Secure Computations. IEEE Trans. Inf. Theory 65(5): 3165-3182 (2019) - Kwangjun Ahn, Kangwook Lee, Changho Suh:
Community Recovery in Hypergraphs. IEEE Trans. Inf. Theory 65(10): 6561-6579 (2019) - Ahmad AlAmmouri, Jeffrey G. Andrews, François Baccelli:
A Unified Asymptotic Analysis of Area Spectral Efficiency in Ultradense Cellular Networks. IEEE Trans. Inf. Theory 65(2): 1236-1248 (2019) - Ahmed El Alaoui, Aaditya Ramdas, Florent Krzakala, Lenka Zdeborová, Michael I. Jordan:
Decoding From Pooled Data: Phase Transitions of Message Passing. IEEE Trans. Inf. Theory 65(1): 572-585 (2019) - Giovanni Alberti, Helmut Bölcskei, Camillo De Lellis, Günther Koliander, Erwin Riegler:
Lossless Analog Compression. IEEE Trans. Inf. Theory 65(11): 7480-7513 (2019) - Matthew Aldridge:
Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime. IEEE Trans. Inf. Theory 65(4): 2058-2061 (2019) - Noga Alon, Boris Bukh, Yury Polyanskiy:
List-Decodable Zero-Rate Codes. IEEE Trans. Inf. Theory 65(3): 1657-1667 (2019) - Matthew Amy, Michele Mosca:
T-Count Optimization and Reed-Muller Codes. IEEE Trans. Inf. Theory 65(8): 4771-4784 (2019) - Venkat Anantharam, François Baccelli:
Error Exponents for Dimension-Matched Vector Multiple Access Channels With Additive Noise. IEEE Trans. Inf. Theory 65(5): 2808-2823 (2019) - Venkat Anantharam, Amin Aminzadeh Gohari, Chandra Nair:
On the Evaluation of Marton's Inner Bound for Two-Receiver Broadcast Channels. IEEE Trans. Inf. Theory 65(3): 1361-1371 (2019) - Aamir Anis, Aly El Gamal, Amir Salman Avestimehr, Antonio Ortega:
A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning. IEEE Trans. Inf. Theory 65(4): 2322-2342 (2019) - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Building Blocks for Communication Over Noisy Quantum Networks. IEEE Trans. Inf. Theory 65(2): 1287-1306 (2019) - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel. IEEE Trans. Inf. Theory 65(4): 2623-2636 (2019) - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Convex-Split and Hypothesis Testing Approach to One-Shot Quantum Measurement Compression and Randomness Extraction. IEEE Trans. Inf. Theory 65(9): 5905-5924 (2019) - Jared Antrobus, Heide Gluesing-Luerssen:
Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations. IEEE Trans. Inf. Theory 65(10): 6204-6223 (2019) - Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Gilles Zémor:
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography. IEEE Trans. Inf. Theory 65(12): 7697-7717 (2019) - Fabien Arlery, UyHour Tan, Olivier Rabaste:
Generalization and Improvement of the Levenshtein Lower Bound for Aperiodic Correlation. IEEE Trans. Inf. Theory 65(2): 1258-1266 (2019) - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch:
Covert Communication Over a K-User Multiple-Access Channel. IEEE Trans. Inf. Theory 65(11): 7020-7044 (2019) - Majid Asadi, Nader Ebrahimi, Omid Kharazmi, Ehsan S. Soofi:
Mixture Models, Bayes Fisher Information, and Divergence Measures. IEEE Trans. Inf. Theory 65(4): 2316-2321 (2019) - Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang:
Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor. IEEE Trans. Inf. Theory 65(9): 5380-5400 (2019)
skipping 495 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-05-28 02:28 CEST 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