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 213 matches
- 2018
- Krishnamoorthy Dinesh, Samir Otiv, Jayalal Sarma:
New Bounds for Energy Complexity of Boolean Functions. Electron. Colloquium Comput. Complex. TR18 (2018) - Krishnamoorthy Dinesh, Jayalal Sarma:
Sensitivity, Affine Transforms and Quantum Communication Complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - Akash Kumar, C. Seshadhri, Andrew Stolman:
Finding forbidden minors in sublinear time: a n1/2+o(1)-query one-sided tester for minor closed properties on bounded degree graphs. Electron. Colloquium Comput. Complex. TR18 (2018) - Scott Aaronson:
PDQP/qpoly = ALL. Electron. Colloquium Comput. Complex. TR18 (2018) - Scott Aaronson:
Quantum Lower Bound for Approximate Counting Via Laurent Polynomials. Electron. Colloquium Comput. Complex. TR18 (2018) - Jayadev Acharya, Clément L. Canonne, Himanshu Tyagi:
Distributed Simulation and Distributed Inference. Electron. Colloquium Comput. Complex. TR18 (2018) - Manindra Agrawal, Sumanta Ghosh, Nitin Saxena:
Bootstrapping variables in algebraic circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - Eric Allender, Rahul Ilango, Neekon Vafa:
The Non-Hardness of Approximating Circuit Size. Electron. Colloquium Comput. Complex. TR18 (2018) - Anurag Anshu, Naresh Goud Boddu, Dave Touchette:
Quantum Log-Approximate-Rank Conjecture is also False. Electron. Colloquium Comput. Complex. TR18 (2018) - Benny Applebaum, Thomas Holenstein, Manoj Mishra, Ofer Shayevitz:
The Communication Complexity of Private Simultaneous Messages, Revisited. Electron. Colloquium Comput. Complex. TR18 (2018) - Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. Electron. Colloquium Comput. Complex. TR18 (2018) - Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf:
Improved bounds on Fourier entropy and Min-entropy. Electron. Colloquium Comput. Complex. TR18 (2018) - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - Saikrishna Badrinarayanan, Yael Kalai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Non-Interactive Delegation for Low-Space Non-Deterministic Computation. Electron. Colloquium Comput. Complex. TR18 (2018) - Mitali Bafna, Badih Ghazi, Noah Golowich, Madhu Sudan:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. Electron. Colloquium Comput. Complex. TR18 (2018) - Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Electron. Colloquium Comput. Complex. TR18 (2018) - Marshall Ball, Dana Dachman-Soled, Siyao Guo, Tal Malkin, Li-Yang Tan:
Non-Malleable Codes for Small-Depth Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - Boaz Barak, Pravesh Kothari, David Steurer:
Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. Electron. Colloquium Comput. Complex. TR18 (2018) - Paul Beame, Shayan Oveis Gharan, Xin Yang:
Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials. Electron. Colloquium Comput. Complex. TR18 (2018) - Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma:
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. Electron. Colloquium Comput. Complex. TR18 (2018) - Avraham Ben-Aroya, Dean Doron, Amnon Ta-Shma:
Near-Optimal Strong Dispersers, Erasure List-Decodable Codes and Friends. Electron. Colloquium Comput. Complex. TR18 (2018) - Omri Ben-Eliezer:
Testing local properties of arrays. Electron. Colloquium Comput. Complex. TR18 (2018) - Omri Ben-Eliezer, Eldar Fischer:
Earthmover Resilience and Testing in Ordered Structures. Electron. Colloquium Comput. Complex. TR18 (2018) - Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. TR18 (2018) - Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - Olaf Beyersdorff, Judith Clymo:
More on Size and Width in QBF Resolution. Electron. Colloquium Comput. Complex. TR18 (2018) - Olaf Beyersdorff, Leroy Chew, Judith Clymo, Meena Mahajan:
Short Proofs in QBF Expansion. Electron. Colloquium Comput. Complex. TR18 (2018) - Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin:
The Riis Complexity Gap for QBF Resolution. Electron. Colloquium Comput. Complex. TR18 (2018) - Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. TR18 (2018) - Amey Bhangale:
NP-hardness of coloring 2-colorable hypergraph with poly-logarithmically many colors. Electron. Colloquium Comput. Complex. TR18 (2018)
skipping 183 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-21 01:30 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