Остановите войну!
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 125 matches
- 2017
- Afshin Abdi, Arash Einolghozati, Faramarz Fekri:
Computing framework in biological cells via stochastic methods. ITW 2017: 339-343 - Vitaly Abdrashitov, N. Prakash, Muriel Médard:
The storage vs repair bandwidth trade-off for multiple failures in clustered storage networks. ITW 2017: 46-50 - Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Multilayer codes for synchronization from deletions. ITW 2017: 449-453 - Mine Alsan, Vincent Y. F. Tan:
Robust decoding schemes for polar coding over compound channels. ITW 2017: 106-110 - Selma Belhadj Amor, Vincent Y. F. Tan:
On the Gaussian MAC with degraded message sets and long-term power constraints. ITW 2017: 399-403 - Anurag Anshu, Rahul Jain, Naqueeb Ahmad Warsi:
Achievability bounds on quantum state redistribution using convex split and position based decoding. ITW 2017: 474-478 - Anurag Anshu:
An upper bound on quantum capacity of unital quantum channels. ITW 2017: 214-218 - Keerthi Suria Kumar Arumugam, Matthieu R. Bloch:
Covert communication over broadcast channels. ITW 2017: 299-303 - Harout K. Aydinian, Holger Boche:
Fractional repetition codes based on partially ordered sets. ITW 2017: 51-55 - Luca Barletta, Flaminio Borgonovo:
The stability of exponential backoff protocols for Slotted-Aloha with saturated queues. ITW 2017: 549-553 - Luca Barletta, Stefano Rini:
Capacity outer bound and degrees of freedom of Wiener phase noise channels with oversampling. ITW 2017: 614-618 - Meryem Benammar, Valerio Bioglio, Frederic Gabry, Ingmar Land:
Multi-kernel polar codes: Proof of polarization and error exponents. ITW 2017: 101-105 - Francesco Buscemi:
Comparison of noisy channels and reverse data-processing theorems. ITW 2017: 489-493 - Sarit Buzaglo, Paul H. Siegel:
Weakly constrained codes via row-by-row coding. ITW 2017: 151-155 - Hari Hara Suthan C, Ishani Chugh, Prasad Krishnan:
An improved secretive coded caching scheme exploiting common demands. ITW 2017: 66-70 - Michael X. Cao, Pascal O. Vontobel:
Double-edge factor graphs: Definition, properties, and examples. ITW 2017: 136-140 - Chun Lam Chan, Nicolas Macris:
Stability threshold and phase transition of generalized censored block models. ITW 2017: 384-388 - Ling-Hua Chang, Carol Wang, Po-Ning Chen, Yunghsiang S. Han, Vincent Y. F. Tan:
Distance spectrum formula for the largest minimum hamming distance of finite-length binary block codes. ITW 2017: 419-423 - Yeow Meng Chee, Han Mao Kiah, Alexander Vardy, Van Khu Vu, Eitan Yaakobi:
Codes correcting position errors in racetrack memories. ITW 2017: 161-165 - Yanling Chen, Onur Ozan Koyluoglu, A. J. Han Vinck:
Joint secrecy over the K-transmitter multiple access channel. ITW 2017: 394-398 - Hao-Chung Cheng, Min-Hsiu Hsieh, Marco Tomamichel:
Sphere-packing bound for classical-quantum channels. ITW 2017: 479-483 - Martin Damrath, H. Birkan Yilmaz, Chan-Byoung Chae, Peter Adam Hoeher:
Spatial coding techniques for molecular MIMO. ITW 2017: 324-328 - Deepesh Data, Vinod M. Prabhakaran:
Secure computation of randomized functions: Further results. ITW 2017: 264-268 - Elad Domanovitz, Uri Erez:
Explicit lower bounds on the outage probability of integer forcing over Nr × 2 channels. ITW 2017: 569-573 - Elad Domanovitz, Uri Erez:
Outage probability bounds for integer-forcing source coding. ITW 2017: 574-578 - Yahya H. Ezzeldin, Mohammed Karmoose, Christina Fragouli:
Communication vs distributed computation: An alternative trade-off curve. ITW 2017: 279-283 - Yuting Fang, Adam Noel, Yiran Wang, Nan Yang:
Simplified cooperative detection for multi-receiver molecular communication. ITW 2017: 329-333 - Marco Ferrari, Alessandro Tomasoni, Sandro Bellini:
Analysis of practical LDPC decoders in tanner graphs with absorbing sets. ITW 2017: 141-145 - Silas L. Fong, Vincent Y. F. Tan:
A tight upper bound on the second-order coding rate of parallel Gaussian channels with feedback. ITW 2017: 76-80 - Shai Ginzach, Neri Merhav, Igal Sason:
Random-coding error exponent of variable-length codes with a single-bit noiseless feedback. ITW 2017: 584-588
skipping 95 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-25 06:50 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