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 28 matches
- 2019
- Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Split Contraction: The Untold Story. ACM Trans. Comput. Theory 11(3): 18:1-18:22 (2019) - Eric Allender, Shuichi Hirahara:
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. ACM Trans. Comput. Theory 11(4): 27:1-27:27 (2019) - Nir Aviv, Amnon Ta-Shma:
On the Entropy Loss and Gap of Condensers. ACM Trans. Comput. Theory 11(3): 15:1-15:14 (2019) - Baris Aydinlioglu, Eric Bach:
Corrigendum to Affine Relativization: Unifying the Algebrization and Relativization Barriers. ACM Trans. Comput. Theory 11(3): 16:1 (2019) - Olaf Beyersdorff, Leroy Chew, Mikolás Janota:
New Resolution-Based QBF Calculi and Their Proof Complexity. ACM Trans. Comput. Theory 11(4): 26:1-26:42 (2019) - Timothy Black:
Monotone Properties of k-Uniform Hypergraphs Are Weakly Evasive. ACM Trans. Comput. Theory 11(3): 14:1-14:14 (2019) - Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. ACM Trans. Comput. Theory 11(4): 24:1-24:33 (2019) - Eric Blais, Clément L. Canonne, Tom Gur:
Distribution Testing Lower Bounds via Reductions from Communication Complexity. ACM Trans. Comput. Theory 11(2): 6:1-6:37 (2019) - Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11(3): 13:1-13:19 (2019) - Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola:
Bounded Independence versus Symmetric Tests. ACM Trans. Comput. Theory 11(4): 21:1-21:27 (2019) - Jin-Yi Cai, Michael Kowalczyk, Tyson Williams:
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy. ACM Trans. Comput. Theory 11(2): 7:1-7:26 (2019) - Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. ACM Trans. Comput. Theory 11(2): 8:1-8:22 (2019) - Peter Fulla, Hannes Uppman, Stanislav Zivný:
The Complexity of Boolean Surjective General-Valued CSPs. ACM Trans. Comput. Theory 11(1): 4:1-4:31 (2019) - Moses Ganardi, Markus Lohrey:
A Universal Tree Balancing Theorem. ACM Trans. Comput. Theory 11(1): 1:1-1:25 (2019) - Leslie Ann Goldberg, Mark Jerrum:
Approximating Pairwise Correlations in the Ising Model. ACM Trans. Comput. Theory 11(4): 23:1-23:20 (2019) - Oded Goldreich, Tom Gur, Ilan Komargodski:
Strong Locally Testable Codes with Relaxed Local Decoders. ACM Trans. Comput. Theory 11(3): 17:1-17:38 (2019) - Ishay Haviv:
On Minrank and Forbidden Subgraphs. ACM Trans. Comput. Theory 11(4): 20:1-20:13 (2019) - Kazuo Iwama, Atsuki Nagao:
Read-Once Branching Programs for Tree Evaluation Problems. ACM Trans. Comput. Theory 11(1): 5:1-5:12 (2019) - Bart M. P. Jansen, Astrid Pieterse:
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. ACM Trans. Comput. Theory 11(4): 28:1-28:26 (2019) - Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas:
Reconstruction of Full Rank Algebraic Branching Programs. ACM Trans. Comput. Theory 11(1): 2:1-2:56 (2019) - Iordanis Kerenidis, Adi Rosén, Florent Urrutia:
Multi-Party Protocols, Information Complexity and Privacy. ACM Trans. Comput. Theory 11(2): 9:1-9:29 (2019) - Sudeshna Kolay, Fahad Panolan, Saket Saurabh:
Communication Complexity and Graph Families. ACM Trans. Comput. Theory 11(2): 11:1-11:28 (2019) - Benoît Larose, Barnaby Martin, Daniël Paulusma:
Surjective H-Colouring over Reflexive Digraphs. ACM Trans. Comput. Theory 11(1): 3:1-3:21 (2019) - Mateus de Oliveira Oliveira, Pavel Pudlák:
Representations of Monotone Boolean Functions by Linear Programs. ACM Trans. Comput. Theory 11(4): 22:1-22:31 (2019) - C. Ramya, B. V. Raghavendra Rao:
Lower bounds for Sum and Sum of Products of Read-once Formulas. ACM Trans. Comput. Theory 11(2): 10:1-10:27 (2019) - Dominik Scheder:
PPSZ for k ≥ 5: More Is Better. ACM Trans. Comput. Theory 11(4): 25:1-25:22 (2019) - Grant Schoenebeck, Biaoshuai Tao:
Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization. ACM Trans. Comput. Theory 11(3): 12:1-12:56 (2019) - Emanuele Viola:
Constant-Error Pseudorandomness Proofs from Hardness Require Majority. ACM Trans. Comput. Theory 11(4): 19:1-19:11 (2019)
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-24 02:47 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