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 39 matches
- 2011
- Scott Aaronson, Andris Ambainis:
The Need for Structure in Quantum Speedups. ICS 2011: 338-352 - Noga Alon, Yuval Emek, Michal Feldman, Moshe Tennenholtz:
Economical Graph Discovery. ICS 2011: 476-486 - Benny Applebaum, Danny Harnik, Yuval Ishai:
Semantic Security under Related-Key Attacks and Applications. ICS 2011: 45-60 - Moshe Babaioff, Liad Blumrosen, Shaddin Dughmi, Yaron Singer:
Posting Prices with Unknown Distributions. ICS 2011: 166-178 - Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. ICS 2011: 401-416 - Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, Paul Valiant:
Testing monotonicity of distributions over general partial orders. ICS 2011: 239-252 - Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie:
The Complexity of Linear Dependence Problems in Vector Spaces. ICS 2011: 496-508 - Christian Borgs, Jennifer T. Chayes, Jian Ding, Brendan Lucier:
The Hitchhiker's Guide to Affiliation Networks: A Game-Theoretic Approach. ICS 2011: 389-400 - Mark Braverman, Avinatan Hassidim, Yael Tauman Kalai:
Leaky Pseudo-Entropy Functions. ICS 2011: 353-366 - Sourav Chakraborty, Eldar Fischer, Arie Matsliah:
Query Complexity Lower Bounds for Reconstruction of Codes. ICS 2011: 264-274 - Sourav Chakraborty, David García-Soriano, Arie Matsliah:
Cycle Detection, Order Finding and Discrete Log with Jumps. ICS 2011: 284-297 - Victor Chen, Madhu Sudan, Ning Xie:
Property Testing via Set-Theoretic Operations. ICS 2011: 211-222 - Xi Chen, Shang-Hua Teng:
A Complexity View of Markets with Social Influence. ICS 2011: 141-154 - Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. ICS 2011: 298-308 - Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
Computationally Limited Randomness. ICS 2011: 522-536 - Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir Kolesnikov:
Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. ICS 2011: 32-44 - Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. ICS 2011: 460-475 - Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou:
Finding Almost-Perfect Graph Bisections. ICS 2011: 321-337 - Thomas Dueholm Hansen, Peter Bro Miltersen, Uri Zwick:
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. ICS 2011: 253-263 - Aaron D. Jaggard, Michael Schapira, Rebecca N. Wright:
Distributed Computing with Adaptive Heuristics. ICS 2011: 417-443 - Maurice J. Jansen:
Extracting Roots of Arithmetic Circuits by Adapting Numerical Methods. ICS 2011: 87-100 - Brendan Juba, Adam Tauman Kalai, Sanjeev Khanna, Madhu Sudan:
Compression without a common prior: an information-theoretic justification for ambiguity in language. ICS 2011: 79-86 - Brendan Juba, Madhu Sudan:
Efficient Semantic Communication via Compatible Beliefs. ICS 2011: 22-31 - Satyen Kale, Ravi Kumar, Sergei Vassilvitskii:
Cross-Validation and Mean-Square Stability. ICS 2011: 487-495 - Satyen Kale, C. Seshadhri:
Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS 2011: 367-388 - Robert D. Kleinberg, Katrina Ligett, Georgios Piliouras, Éva Tardos:
Beyond the Nash Equilibrium Barrier. ICS 2011: 125-140 - Pascal Koiran:
Shallow circuits with high-powered inputs. ICS 2011: 309-320 - Reut Levi, Dana Ron, Ronitt Rubinfeld:
Testing Properties of Collections of Distributions. ICS 2011: 179-194 - Konstantin Makarychev, Alantha Newman:
Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS 2011: 444-459 - Ueli Maurer, Renato Renner:
Abstract Cryptography. ICS 2011: 1-21
skipping 9 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-09-29 23:36 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