![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 46 matches
- 2015
- Abhishek Jain
, Yael Tauman Kalai, Allison Bishop Lewko:
Interactive Coding for Multiparty Protocols. ITCS 2015: 1-10 - Benny Applebaum, Jonathan Avron, Christina Brzuska:
Arithmetic Cryptography: Extended Abstract. ITCS 2015: 143-151 - Benny Applebaum, Liron David, Guy Even:
Deterministic Rateless Codes for BSC. ITCS 2015: 31-40 - Chen Avin
, Barbara Keller, Zvi Lotker, Claire Mathieu, David Peleg, Yvonne-Anne Pignolet:
Homophily and the Glass Ceiling Effect in Social Networks. ITCS 2015: 41-50 - Pranjal Awasthi, Afonso S. Bandeira, Moses Charikar
, Ravishankar Krishnaswamy, Soledad Villar, Rachel A. Ward
:
Relax, No Need to Round: Integrality of Clustering Formulations. ITCS 2015: 191-200 - Moshe Babaioff, Moran Feldman
, Moshe Tennenholtz:
Mechanism Design with Strategic Mediators. ITCS 2015: 307-316 - Mohammad Bavarian, Peter W. Shor:
Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH. ITCS 2015: 123-132 - Abhishek Bhowmick, Ariel Gabizon, Thái Hoàng Lê, David Zuckerman:
Deterministic Extractors for Additive Sources: Extended Abstract. ITCS 2015: 277-286 - Timothy Black:
Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive. ITCS 2015: 383-391 - Avrim Blum, Jamie Morgenstern, Ankit Sharma, Adam D. Smith:
Privacy-Preserving Public Information for Sequential Games. ITCS 2015: 173-180 - Gregory Bodwin, Virginia Vassilevska Williams:
Very Sparse Additive Spanners and Emulators. ITCS 2015: 377-382 - Simina Brânzei, Ariel D. Procaccia:
Verifiably Truthful Mechanisms. ITCS 2015: 297-306 - Mark Braverman, Jieming Mao:
Simulating Noisy Channel Interaction. ITCS 2015: 21-30 - Clément Louis Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan:
Communication with Imperfectly Shared Randomness. ITCS 2015: 257-262 - Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, Vassilis Zikas:
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults. ITCS 2015: 153-162 - Brynmor Chapman, Ryan Williams
:
The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data. ITCS 2015: 263-270 - Chandra Chekuri, T. S. Jayram, Jan Vondrák:
On Multiplicative Weight Updates for Concave and Submodular Function Maximization. ITCS 2015: 201-210 - Jing Chen, Silvio Micali, Rafael Pass:
Better Outcomes from More Rationality. ITCS 2015: 325 - Flavio Chierichetti, Anirban Dasgupta
, Ravi Kumar, Silvio Lattanzi:
On Learning Mixture Models for Permutations. ITCS 2015: 85-92 - Michael B. Cohen
, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, Aaron Sidford:
Uniform Sampling for Matrix Approximation. ITCS 2015: 181-190 - Rachel Cummings, Katrina Ligett
, Aaron Roth
, Zhiwei Steven Wu, Juba Ziani:
Accuracy for Sale: Aggregating Data with a Variance Constraint. ITCS 2015: 317-324 - Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar:
Direct Sum Testing. ITCS 2015: 327-336 - Irit Dinur
, Shafi Goldwasser, Huijia Lin:
The Computational Benefit of Correlated Instances. ITCS 2015: 219-228 - Roozbeh Ebrahimi, Jie Gao, Golnaz Ghasemiesfeh, Grant Schoenebeck:
Complex Contagions in Kleinberg's Small World Model. ITCS 2015: 63-72 - Klim Efremenko
, Ran Gelles, Bernhard Haeupler
:
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. ITCS 2015: 11-20 - Uriel Feige:
Why are Images Smooth? ITCS 2015: 229-236 - Uriel Feige, Shlomo Jozeph:
Separation between Estimation and Approximation. ITCS 2015: 271-276 - Joseph F. Fitzsimons, Thomas Vidick
:
A Multiprover Interactive Proof System for the Local Hamiltonian Problem. ITCS 2015: 103-112 - Justin Gilmer, Michal Koucký
, Michael E. Saks:
A New Approach to the Sensitivity Conjecture. ITCS 2015: 247-254 - Oded Goldreich
, Dana Ron
:
On Sample-Based Testers. ITCS 2015: 337-345
skipping 16 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-02 09:56 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