Остановите войну!
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 572 matches
- 2021
- Min Qiu, Xiaowei Wu, Jinhong Yuan, Alexandre Graell i Amat:
Generalized Spatially Coupled Parallel Concatenated Convolutional Codes With Partial Repetition. ISIT 2021: 581-586 - Xiangxiang Xu, Shao-Lun Huang:
An Information Theoretic Framework for Distributed Learning Algorithms. ISIT 2021: 314-319 - Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
On the Sample Complexity of solving LWE using BKW-Style Algorithms. ISIT 2021: 2405-2410 - Yihong Wu, Jiaming Xu, Sophie H. Yu:
Settling the Sharp Reconstruction Thresholds of Random Graph Matching. ISIT 2021: 2714-2719 - Dawei Ding, Sumeet Khatri, Yihui Quek, Peter W. Shor, Xin Wang, Mark M. Wilde:
Upper bound on the classical capacity of a quantum channel assisted by classical feedback. ISIT 2021: 906-911 - Sayantan Chakraborty, Aditya Nema, Pranab Sen:
A multi-sender decoupling theorem and simultaneous decoding for the quantum MAC. ISIT 2021: 623-627 - Sayantan Chakraborty, Aditya Nema, Pranab Sen:
Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting. ISIT 2021: 628-633 - Zhou Li, Hua Sun:
On the Linear Capacity of Conditional Disclosure of Secrets. ISIT 2021: 3202-3207 - Chao Zhang, Aymen Askri, Ghaya Rekaya-Ben Othman:
Distributed DNN based Processing for Uplink Could-RAN. ISIT 2021: 3092-3096 - Fan Zhou, Arini Fitri, Khoirul Anwar, Brian M. Kurkoski:
Encoding and Decoding Construction D' Lattices for Power-Constrained Communications. ISIT 2021: 1005-1010 - Fan Li, Jinyuan Chen:
Communication-Efficient Signature-Free Asynchronous Byzantine Agreement. ISIT 2021: 2864-2869 - Hao Wang, Hsiang Hsu, Mario Díaz, Flávio P. Calmon:
The Impact of Split Classifiers on Group Fairness. ISIT 2021: 3179-3184 - Fariba Abbasi, Hessam Mahdavifar, Emanuele Viterbo:
Hybrid Non-Binary Repeated Polar Codes For Low-SNR Regime. ISIT 2021: 1742-1747 - Mojtaba Abolfazli, Anders Høst-Madsen, June Zhang, Andras Bratincsak:
Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models. ISIT 2021: 2708-2713 - Jayadev Acharya, Clément L. Canonne, Yuhan Liu, Ziteng Sun, Himanshu Tyagi:
Interactive Inference under Information Constraints. ISIT 2021: 326-331 - Donald Q. Adams, Adarsh Barik, Jean Honorio:
Information-Theoretic Bounds for Integral Estimation. ISIT 2021: 742-747 - Donald Q. Adams, Hemanta K. Maji, Hai H. Nguyen, Minh L. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang:
Lower Bounds for Leakage-Resilient Secret-Sharing Schemes against Probing Attacks. ISIT 2021: 976-981 - Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Quantization of Random Distributions under KL Divergence. ISIT 2021: 2762-2767 - Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby:
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. ISIT 2021: 2625-2630 - Surin Ahn, Wei-Ning Chen, Ayfer Özgür:
Adaptive Group Testing on Networks with Community Structure. ISIT 2021: 1242-1247 - Abdulrahman Alabdulkareem, Jean Honorio:
Information-theoretic lower bounds for zero-order stochastic gradient estimation. ISIT 2021: 2316-2321 - Wael Alghamdi, Flávio P. Calmon:
Polynomial Approximations of Conditional Expectations in Scalar Gaussian Channels. ISIT 2021: 420-425 - Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti:
High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes. ISIT 2021: 1046-1051 - Vamsi K. Amalladinne, Allen Hao, Stefano Rini, Jean-François Chamberland:
Multi-Class Unsourced Random Access via Coded Demixing. ISIT 2021: 3080-3085 - Sanae Amani, Mahnoosh Alizadeh, Christos Thrampoulidis:
Regret Bounds for Safe Gaussian Process Bandit Optimization. ISIT 2021: 527-532 - Omer Amar, Kobi Cohen:
Online Learning for Shortest Path and Backpressure Routing in Wireless Networks. ISIT 2021: 2702-2707 - Gholamali Aminian, Laura Toni, Miguel R. D. Rodrigues:
Information-Theoretic Bounds on the Moments of the Generalization Error of Learning Algorithms. ISIT 2021: 682-687 - Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes With Girth 6 and Shortest Length. ISIT 2021: 368-373 - Dadja Anade, Jean-Marie Gorce, Philippe Mary, Samir M. Perlaza:
Saddlepoint Approximations of Cumulative Distribution Functions of Sums of Random Vectors. ISIT 2021: 778-783 - Evan J. D. Anderson, Saikat Guha, Boulat A. Bash:
Fundamental Limits of Bosonic Broadcast Channels. ISIT 2021: 766-771
skipping 542 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-11 23:51 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