![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 324 matches
- 2022
- Xin Li, Shachar Lovett, Jiapeng Zhang:
Sunflowers and Robust Sunflowers from Randomness Extractors. Theory Comput. 18: 1-18 (2022) - Per Austrin, Petteri Kaski, Kaie Kubjas:
Tensor Network Complexity of Multilinear Maps. Theory Comput. 18: 1-54 (2022) - Amey Bhangale, Subhash Khot:
UG-hardness to NP-hardness by Losing Half. Theory Comput. 18: 1-28 (2022) - Vladimir Braverman, Robert Krauthgamer, Lin F. Yang:
Universal Streaming of Subset Norms. Theory Comput. 18: 1-32 (2022) - Chandra Chekuri, Tanmay Inamdar:
Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory Comput. 18: 1-19 (2022) - Zongchen Chen, Santosh S. Vempala:
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. Theory Comput. 18: 1-18 (2022) - Kuan Cheng, William M. Hoza:
Hitting Sets Give Two-Sided Derandomization of Small Space. Theory Comput. 18: 1-32 (2022) - Christian Coester, James R. Lee:
Pure Entropic Regularization for Metrical Task Systems. Theory Comput. 18: 1-24 (2022) - Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi:
From Local to Robust Testing via Agreement Testing. Theory Comput. 18: 1-25 (2022) - Andrew Drucker:
Guest Editor's Foreword to the RANDOM 2018 Special Issue. Theory Comput. 18: 1-3 (2022) - Zeev Dvir, Avishay Tal:
Guest Editors' Foreword to the CCC 2020 Special Issue. Theory Comput. 18: 1-4 (2022) - Alon Eden, Uriel Feige, Michal Feldman:
Max-Min Greedy Matching. Theory Comput. 18: 1-33 (2022) - Lukas Fleischer:
The Cayley Semigroup Membership Problem. Theory Comput. 18: 1-18 (2022) - Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. Theory Comput. 18: 1-22 (2022) - Kaave Hosseini, Hamed Hatami, Shachar Lovett:
Sign-Rank vs. Discrepancy. Theory Comput. 18: 1-22 (2022) - Stacey Jeffery:
Span Programs and Quantum Space Complexity. Theory Comput. 18: 1-49 (2022) - Alexander Kozachinskiy, Vladimir V. Podolskii:
Multiparty Karchmer-Wigderson Games and Threshold Circuits. Theory Comput. 18: 1-33 (2022) - Maya Leshkowitz:
Round Complexity Versus Randomness Complexity in Interactive Proofs. Theory Comput. 18: 1-65 (2022) - Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan:
Near-Optimal NP-Hardness of Approximating Max k-CSPR. Theory Comput. 18: 1-29 (2022) - Kent Quanrud:
Fast and Deterministic Approximations for k-Cut. Theory Comput. 18: 1-24 (2022) - Rocco A. Servedio, Li-Yang Tan:
Improved Pseudorandom Generators from Pseudorandom Multi-switching Lemmas. Theory Comput. 18: 1-46 (2022) - Emanuele Viola:
Pseudorandom Bits and Lower Bounds for Randomized Turing Machines. Theory Comput. 18: 1-12 (2022) - Xinyu Wu:
A Stochastic Calculus Approach to the Oracle Separation of BQP and PH. Theory Comput. 18: 1-11 (2022) - 2021
- Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. Theory Comput. 17: 1-27 (2021) - Josh Alman:
Limits on the Universal Method for Matrix Multiplication. Theory Comput. 17: 1-30 (2021) - Mark Bun, Justin Thaler:
The Large-Error Approximate Degree of AC0. Theory Comput. 17: 1-46 (2021) - Matthias Christandl, Péter Vrana, Jeroen Zuiddam:
Barriers for Fast Matrix Multiplication from Irreversibility. Theory Comput. 17: 1-32 (2021) - Julia Chuzhoy, David Hong Kyun Kim, Rachit Nimavat:
Almost Polynomial Hardness of Node-Disjoint Paths in Grids. Theory Comput. 17: 1-57 (2021) - Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory Comput. 17: 1-88 (2021) - Dmitry Gavinsky:
The Layer Complexity of Arthur-Merlin-like Communication. Theory Comput. 17: 1-28 (2021)
skipping 294 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-04 12:04 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