Остановите войну!
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 650 matches
- 2017
- Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski:
Information set decoding with soft information and some cryptographic applications. ISIT 2017: 1793-1797 - Asaf Cohen, Alejandro Cohen, Muriel Médard, Omer Gurewitz:
Individually-secure multi-source multicast. ISIT 2017: 3105-3109 - Wei Yang, Yingbin Liang, Shlomo Shamai Shitz, H. Vincent Poor:
Outer bounds for Gaussian multiple access channels with state known at one encoder. ISIT 2017: 869-873 - Wei Yang, Rafael F. Schaefer, H. Vincent Poor:
Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite Blocklength. ISIT 2017: 2133-2137 - Mladen Kovacevic, Vincent Y. F. Tan:
Coding for the permutation channel with insertions, deletions, substitutions, and erasures. ISIT 2017: 1933-1937 - Anyu Wang, Zhifang Zhang, Dongdai Lin:
Bounds and constructions for linear locally repairable codes over binary fields. ISIT 2017: 2033-2037 - Amin Jalali, James Saunderson, Maryam Fazel, Babak Hassibi:
Error bounds for Bregman denoising and structured natural parameter estimation. ISIT 2017: 2273-2277 - Fariba Abbasi, Mayank Bakshi:
Coding for networks of compound channels. ISIT 2017: 2388-2392 - Emmanuel Abbe, João M. Pereira, Amit Singer:
Sample complexity of the boolean multireference alignment problem. ISIT 2017: 1316-1320 - Khaled A. S. Abdel-Ghaffar, Jos H. Weber:
Bounds for cooperative locality using generalized hamming weights. ISIT 2017: 699-703 - Amr Abdelaziz, Can Emre Koksal, Hesham El Gamal, Ashraf D. Elbayoumy:
On the compound MIMO wiretap channel with mean feedback. ISIT 2017: 734-738 - Afshin Abdi, Faramarz Fekri:
Optimal sensor selection in the presence of noise and interference. ISIT 2017: 2378-2382 - Mahed Abroshan, Ramji Venkataramanan, Albert Guillen i Fabregas:
Codes for channels with segmented edits. ISIT 2017: 1768-1772 - Jayadev Acharya, Arnab Bhattacharyya, Pritish Kamath:
Improved bounds for universal one-bit compressive sensing. ISIT 2017: 2353-2357 - Dimitris Achlioptas, S. Hamed Hassani, Wei Liu, Rüdiger L. Urbanke:
Time-invariant LDPC convolutional codes. ISIT 2017: 366-370 - Valentin B. Afanassiev, Alexander A. Davydov:
Weight spectrum of quasi-perfect binary codes with distance 4. ISIT 2017: 2193-2197 - Abhishek Agarwal, Larkin Flodin, Arya Mazumdar:
Estimation of sparsity via simple measurements. ISIT 2017: 456-460 - Inaki Estella Aguerri, Abdellatif Zaidi, Giuseppe Caire, Shlomo Shamai Shitz:
On the capacity of cloud radio access networks with oblivious relaying. ISIT 2017: 2068-2072 - Kwangjun Ahn, Kangwook Lee, Changho Suh:
Information-theoretic limits of subspace clustering. ISIT 2017: 2473-2477 - Yazan H. Al-Badarneh, Costas N. Georghiades, Carlos E. Mejía:
On the effective rate of MISO/TAS systems in Rayleigh fading. ISIT 2017: 2328-2332 - Ahmed El Alaoui, Aaditya Ramdas, Florent Krzakala, Lenka Zdeborová, Michael I. Jordan:
Decoding from pooled data: Phase transitions of message passing. ISIT 2017: 2780-2784 - Matthew Aldridge:
On the optimality of some group testing algorithms. ISIT 2017: 3085-3089 - Kazuyuki Amano:
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. ISIT 2017: 251-255 - Mohammad Mohammadi Amiri, Deniz Gündüz:
Decentralized caching and coded delivery over Gaussian broadcast channels. ISIT 2017: 2785-2789 - Venkat Anantharam:
A variational characterization of Rényi divergences. ISIT 2017: 893-897 - Achilleas Anastasopoulos, Jui Wu:
Variable-length codes for channels with memory and feedback: Error-exponent lower bounds. ISIT 2017: 1495-1499 - Ahmed Arafa, Abdulrahman Baknina, Sennur Ulukus:
Energy harvesting networks with general utility functions: Near optimal online policies. ISIT 2017: 809-813 - Ahmed Arafa, Sennur Ulukus:
Near optimal online distortion minimization for energy harvesting nodes. ISIT 2017: 1117-1121 - Castor Aranda, Marcel Fernandez:
Improved existence bounds on IPP codes using the Clique Lovász Local Lemma. ISIT 2017: 3160-3164 - Amir-Reza Asadi, Emmanuel Abbe, Sergio Verdú:
Compressing data on graphs with clusters. ISIT 2017: 1583-1587
skipping 620 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-24 00:10 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