Остановите войну!
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 50 matches
- 2013
- Per Austrin, Johan Håstad, Rafael Pass:
On the power of many one-bit provers. ITCS 2013: 215-220 - Per Austrin, Subhash Khot:
A characterization of approximation resistance for even k-partite CSPs. ITCS 2013: 187-196 - Pablo Daniel Azar, Silvio Micali:
Parametric digital auctions. ITCS 2013: 231-232 - Boaz Barak, Guy Kindler, David Steurer:
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. ITCS 2013: 197-214 - Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the sample complexity of private learners. ITCS 2013: 97-110 - Aleksandrs Belovs, Robert Spalek:
Adversary lower bound for the k-sum problem. ITCS 2013: 323-328 - Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. ITCS 2013: 401-414 - Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the convergence of the Hegselmann-Krause system. ITCS 2013: 61-66 - Jeremiah Blocki, Avrim Blum, Anupam Datta, Or Sheffet:
Differentially private data analysis of social networks via restricted sensitivity. ITCS 2013: 87-96 - Andrej Bogdanov, Siyao Guo:
Sparse extractor families for all the entropy. ITCS 2013: 553-560 - Ilario Bonacina, Nicola Galesi:
Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems. ITCS 2013: 455-472 - Joshua Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, Xiaoming Sun:
Space-bounded communication complexity. ITCS 2013: 159-172 - Joachim M. Buhmann, Matús Mihalák, Rastislav Srámek, Peter Widmayer:
Robust optimization in the presence of uncertainty. ITCS 2013: 505-514 - Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman:
The garden-hose model. ITCS 2013: 145-158 - Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah:
On the power of conditional samples in distribution testing. ITCS 2013: 561-580 - Erick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani:
Multiplicative updates in coordination games and the theory of evolution. ITCS 2013: 57-58 - Hui Han Chin, Aleksander Madry, Gary L. Miller, Richard Peng:
Runtime guarantees for regression problems. ITCS 2013: 269-282 - Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass:
On the power of nonuniformity in proofs of security. ITCS 2013: 389-400 - Kai-Min Chung, Edward Lui, Rafael Pass:
Can theories be tested?: a cryptographic treatment of forecast testing. ITCS 2013: 47-56 - Marek Cygan, Matthias Englert, Anupam Gupta, Marcin Mucha, Piotr Sankowski:
Catch them if you can: how to serve impatient users. ITCS 2013: 485-494 - Uriel Feige, Rani Izsak:
Welfare maximization and the supermodular degree. ITCS 2013: 247-256 - Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali:
Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230 - Juan A. Garay, David S. Johnson, Aggelos Kiayias, Moti Yung:
Resource-based corruptions and the combinatorics of hidden diversity. ITCS 2013: 415-428 - Arpita Ghosh, Patrick Hummel:
Learning and incentives in user-generated content: multi-armed bandits with endogenous arms. ITCS 2013: 233-246 - Oded Goldreich, Shafi Goldwasser, Dana Ron:
On the possibilities and limitations of pseudodeterministic algorithms. ITCS 2013: 127-138 - Alan Guo, Swastik Kopparty, Madhu Sudan:
New affine-invariant codes from lifting. ITCS 2013: 529-540 - Ishay Haviv, Michael Langberg:
H-wise independence. ITCS 2013: 541-552 - Daniel J. Hsu, Sham M. Kakade:
Learning mixtures of spherical gaussians: moment methods and spectral decompositions. ITCS 2013: 11-20 - Brendan Juba, Ryan Williams:
Massive online teaching to bounded learners. ITCS 2013: 1-10 - Subhash Khot, Muli Safra, Madhur Tulsiani:
Towards an optimal query efficient PCP? ITCS 2013: 173-186
skipping 20 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 09:46 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