Остановите войну!
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 57 matches
- 2022
- Haiyan Wu, Zhiming Li:
Ergodic theorems for capacity preserving Z+d-actions. Int. J. Approx. Reason. 146: 1-20 (2022) - 2021
- Gareth Boreland, Ivan G. Todorov, Andreas J. Winter:
Sandwich theorems and capacity bounds for non-commutative graphs. J. Comb. Theory, Ser. A 177: 105302 (2021) - Gauthier Gidel, David Balduzzi, Wojciech Czarnecki, Marta Garnelo, Yoram Bachrach:
A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets. AISTATS 2021: 2548-2556 - 2020
- Yucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim:
Capacity Theorems for Distributed Index Coding. IEEE Trans. Inf. Theory 66(8): 4653-4680 (2020) - Hiroki Koga:
Coding Theorems on the Simple Capacity for Digital Fingerprinting Codes. ISITA 2020: 61-65 - Michael S. Bullock, Christos N. Gagatsos, Boulat A. Bash:
Capacity Theorems for Covert Bosonic Channels. ITW 2020: 1-5 - 2018
- Christopher Leet, Xin Wang, Yang Richard Yang, James Aspnes:
Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths. INFOCOM 2018: 711-719 - Shachar Shayovitz, Meir Feder:
Redundancy Capacity Theorem for On-Line Learning Under a Certain Form of Hypotheses Class. ITW 2018: 1-5 - Yucheng Liu, Parastoo Sadeghi, Fatemeh Arbabjolfaei, Young-Han Kim:
Capacity Theorems for Distributed Index Coding. CoRR abs/1801.09063 (2018) - 2016
- Hyeji Kim, Abbas El Gamal:
Capacity Theorems for Broadcast Channels With Two Channel State Components Known at the Receivers. IEEE Trans. Inf. Theory 62(12): 6917-6930 (2016) - 2015
- Ruchen Duan, Yingbin Liang:
Bounds and Capacity Theorems for Cognitive Interference Channels With State. IEEE Trans. Inf. Theory 61(1): 280-304 (2015) - Nima S. Anzabi-Nezhad, Ghosheh Abed Hodtani, Mohammad Molavi Kakhki:
A New and More General Capacity Theorem for the Gaussian Channel with Two-sided Input-Noise Dependent State Information. CoRR abs/1507.04924 (2015) - Mohammed S. Elmusrati:
Towards Green and Infinite Capacity in Wireless Communication Networks: Beyond The Shannon Theorem. CoRR abs/1507.03838 (2015) - Hyeji Kim, Abbas El Gamal:
Capacity Theorems for Broadcast Channels with Two Channel State Components Known at the Receivers. CoRR abs/1509.04335 (2015) - 2014
- Reza Khosravi-Farsani, Reza Ebrahimpour:
Capacity theorems for the Cognitive Radio Channel with confidential messages. ISIT 2014: 1416-1420 - Yu Zhao, Biao Chen:
Capacity theorems for multi-functioning radios. ISIT 2014: 2406-2410 - 2013
- Assadallah Sahebalam, Ghosheh Abed Hodtani:
General and new inner bound for multiple-access relay channel and two certain capacity theorems. IET Commun. 7(13): 1348-1359 (2013) - Veniamin I. Morgenshtern, Erwin Riegler, Wei Yang, Giuseppe Durisi, Shaowei Lin, Bernd Sturmfels, Helmut Bölcskei:
Capacity Pre-Log of Noncoherent SIMO Channels Via Hironaka's Theorem. IEEE Trans. Inf. Theory 59(7): 4213-4229 (2013) - 2012
- Daniel Zahavi, Ron Dabora:
Capacity Theorems for the Fading Interference Channel With a Relay and Feedback Links. IEEE Trans. Inf. Theory 58(8): 5185-5213 (2012) - Liang Chen:
Capacity theorems for three-user cooperative relay broadcast channels. CISS 2012: 1-6 - Veniamin I. Morgenshtern, Erwin Riegler, Wei Yang, Giuseppe Durisi, Shaowei Lin, Bernd Sturmfels, Helmut Bölcskei:
Capacity Pre-Log of Noncoherent SIMO Channels via Hironaka's Theorem. CoRR abs/1204.2775 (2012) - Naresh Sharma, Naqueeb Ahmad Warsi:
On the strong converses for the quantum channel capacity theorems. CoRR abs/1205.1712 (2012) - Ruchen Duan, Yingbin Liang:
Bounds and Capacity Theorems for Cognitive Interference Channels with State. CoRR abs/1207.0016 (2012) - Edwin Hammerich:
A Note on Gallager's Capacity Theorem for Waveform Channels. CoRR abs/1207.4707 (2012) - Reza Khosravi-Farsani, Farokh Marvasti:
Capacity Theorems for the Cognitive Radio Channel with Confidential Messages. CoRR abs/1207.5040 (2012) - 2011
- Tzu-Han Chou, Vincent Y. F. Tan, Stark C. Draper:
The sender-excited secret key agreement model: Capacity theorems. Allerton 2011: 928-935 - Junhua Liang, Xinbing Wang, Wenjun Zhang:
Capacity Theorem and Optimal Power Allocation for Frequency Division Multiple-Access Relay Channels. GLOBECOM 2011: 1-5 - Daniel Zahavi, Ron Dabora:
Capacity theorems for the fading interference channel with a relay and feedback links. ISIT 2011: 2120-2124 - Georg Tauböck:
A maximum entropy theorem for complex-valued random vectors, with implications on capacity. ITW 2011: 375-379 - Daniel Zahavi, Ron Dabora:
Capacity Theorems for the Fading Interference Channel with a Relay and Feedback Links. CoRR abs/1104.4308 (2011)
skipping 27 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-04-25 02:05 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