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 137 matches
- 2020
- Rohit Agrawal:
Coin Theorems and the Fourier Expansion. Chic. J. Theor. Comput. Sci. 2020 (2020) - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. Chic. J. Theor. Comput. Sci. 2020 (2020) - Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower bounds for linear decision lists. Chic. J. Theor. Comput. Sci. 2020 (2020) - Dmitry Gavinsky:
The communication complexity of the inevitable intersection problem. Chic. J. Theor. Comput. Sci. 2020 (2020) - 2019
- Ilias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price:
Collision-Based Testers are Optimal for Uniformity and Closeness. Chic. J. Theor. Comput. Sci. 2019 (2019) - Ishay Haviv, Michael Langberg:
H-wise Independence. Chic. J. Theor. Comput. Sci. 2019 (2019) - Guillaume Lagarde, Guillaume Malod, Sylvain Perifel:
Non-commutative computations: lower bounds and polynomial identity testing. Chic. J. Theor. Comput. Sci. 2019 (2019) - 2018
- Markus Bläser, Matthias Christandl, Jeroen Zuiddam:
The border support rank of two-by-two matrix multiplication is seven. Chic. J. Theor. Comput. Sci. 2018 (2018) - Steven D. Galbraith, Joel Laity, Barak Shani:
Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations. Chic. J. Theor. Comput. Sci. 2018 (2018) - Oded Goldreich, Tom Gur:
Universal Locally Testable Codes. Chic. J. Theor. Comput. Sci. 2018 (2018) - Matthew B. Hastings:
Local Maxima and Improved Exact Algorithm for MAX-2-SAT. Chic. J. Theor. Comput. Sci. 2018 (2018) - Jan Krajícek, Igor C. Oliveira:
On monotone circuits with local oracles and clique lower bounds. Chic. J. Theor. Comput. Sci. 2018 (2018) - Vincent Russo, John Watrous:
Extended Nonlocal Games from Quantum-Classical Games. Chic. J. Theor. Comput. Sci. 2018 (2018) - 2017
- François Le Gall, Harumichi Nishimura:
Quantum Algorithms for Matrix Products over Semirings. Chic. J. Theor. Comput. Sci. 2017 (2017) - Rajko Nenadov, Pascal Pfister, Angelika Steger:
Unique reconstruction threshold for random jigsaw puzzles. Chic. J. Theor. Comput. Sci. 2017 (2017) - 2016
- Divesh Aggarwal, Oded Regev:
A Note on Discrete Gaussian Combinations of Lattice Vectors. Chic. J. Theor. Comput. Sci. 2016 (2016) - Vikraman Arvind, S. Raja:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Chic. J. Theor. Comput. Sci. 2016 (2016) - André Chailloux, Gus Gutoski, Jamie Sikora:
Optimal bounds for semi-honest quantum oblivious transfer. Chic. J. Theor. Comput. Sci. 2016 (2016) - Arkadev Chattopadhyay, Frederic Green, Howard Straubing:
Circuit Complexity of Powering in Fields of Odd Characteristic. Chic. J. Theor. Comput. Sci. 2016 (2016) - Christopher T. Chubb, Steven T. Flammia:
Computing the Degenerate Ground Space of Gapped Spin Chains in Polynomial Time. Chic. J. Theor. Comput. Sci. 2016 (2016) - Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood:
Layouts of Expander Graphs. Chic. J. Theor. Comput. Sci. 2016 (2016) - Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, Nitin Saurabh:
Homomorphism Polynomials Complete for VP. Chic. J. Theor. Comput. Sci. 2016 (2016) - Yuval Filmus:
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube. Chic. J. Theor. Comput. Sci. 2016 (2016) - Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora:
QMA with Subset State Witnesses. Chic. J. Theor. Comput. Sci. 2016 (2016) - Raghav Kulkarni, Avishay Tal:
On Fractional Block Sensitivity. Chic. J. Theor. Comput. Sci. 2016 (2016) - Cécilia Lancien, Andreas J. Winter:
Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction. Chic. J. Theor. Comput. Sci. 2016 (2016) - Laura Mancinska, David E. Roberson, Antonios Varvitsiotis:
On deciding the existence of perfect entangled strategies for nonlocal games. Chic. J. Theor. Comput. Sci. 2016 (2016) - Thomas Watson:
Nonnegative Rank vs. Binary Rank. Chic. J. Theor. Comput. Sci. 2016 (2016) - Penghui Yao:
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent. Chic. J. Theor. Comput. Sci. 2016 (2016) - 2015
- Naman Agarwal, Guy Kindler, Alexandra Kolla, Luca Trevisan:
Unique Games on the Hypercube. Chic. J. Theor. Comput. Sci. 2015 (2015)
skipping 107 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-11-04 18:59 CET 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