![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 185 matches
- 2022
- Madhu Sudan:
Streaming and Sketching Complexity of CSPs: A survey. Electron. Colloquium Comput. Complex. TR22 (2022) - Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen:
Testing of Index-Invariant Properties in the Huge Object Model. Electron. Colloquium Comput. Complex. TR22 (2022) - Sourav Chakraborty, Anna Gál, Sophie Laplante, Rajat Mittal, Anupa Sunny:
Certificate games. Electron. Colloquium Comput. Complex. TR22 (2022) - Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. Electron. Colloquium Comput. Complex. TR22 (2022) - Lijie Chen, Jiatu Li, Tianqi Yang:
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. Electron. Colloquium Comput. Complex. TR22 (2022) - Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should decisions in QCDCL follow prefix order? Electron. Colloquium Comput. Complex. TR22 (2022) - Oded Goldreich, Guy N. Rothblum, Tal Skverer:
On Interactive Proofs of Proximity with Proof-Oblivious Queries. Electron. Colloquium Comput. Complex. TR22 (2022) - Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. Electron. Colloquium Comput. Complex. TR22 (2022) - Lijie Chen, Roei Tell:
When Arthur has Neither Random Coins nor Time to Spare: Superfast Derandomization of Proof Systems. Electron. Colloquium Comput. Complex. TR22 (2022) - Oded Goldreich, Laliv Tauber:
Testing in the bounded-degree graph model with degree bound two. Electron. Colloquium Comput. Complex. TR22 (2022) - Robert Andrews:
On Matrix Multiplication and Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR22 (2022) - Nikhil Gupta, Chandan Saha, Bhargav Thankey:
Equivalence Test for Read-Once Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR22 (2022) - Yaroslav Alekseev, Edward A. Hirsch:
The power of the Binary Value Principle. Electron. Colloquium Comput. Complex. TR22 (2022) - Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap:
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - Eric Allender, Jacob Gray, Saachi Mutreja, Harsha Tirumala, Pengxiang Wang:
Robustness for Space-Bounded Statistical Zero Knowledge. Electron. Colloquium Comput. Complex. TR22 (2022) - Eric Allender, Shuichi Hirahara, Harsha Tirumala:
Kolmogorov Complexity Characterizes Statistical Zero Knowledge. Electron. Colloquium Comput. Complex. TR22 (2022) - Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. TR22 (2022) - Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, Peter Manohar:
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Electron. Colloquium Comput. Complex. TR22 (2022) - Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey:
Low-depth arithmetic circuit lower bounds via shifted partials. Electron. Colloquium Comput. Complex. TR22 (2022) - Prashanth Amireddy, Sai Jayasurya, Jayalal Sarma:
Power of Decision Trees with Monotone Queries. Electron. Colloquium Comput. Complex. TR22 (2022) - Benny Applebaum, Amos Beimel, Oded Nir, Naty Peter, Toniann Pitassi:
Secret Sharing, Slice Formulas, and Monotone Real Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - Vipul Arora, Arnab Bhattacharyya, Noah Fleming, Esty Kelman, Yuichi Yoshida:
Low Degree Testing over the Reals. Electron. Colloquium Comput. Complex. TR22 (2022) - Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. Electron. Colloquium Comput. Complex. TR22 (2022) - Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. TR22 (2022) - Vikraman Arvind, Pushkar S. Joglekar:
Matrix Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. TR22 (2022) - Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar:
Worst-Case to Average-Case Reductions via Additive Combinatorics. Electron. Colloquium Comput. Complex. TR22 (2022) - Vahid R. Asadi, Alexander Golovnev, Tom Gur, Igor Shinkar, Sathyawageeswar Subramanian:
Quantum Worst-Case to Average-Case Reductions for All Linear Problems. Electron. Colloquium Comput. Complex. TR22 (2022) - Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. Electron. Colloquium Comput. Complex. TR22 (2022) - Daniel Avraham, Amir Yehudayoff:
On blocky ranks of matrices. Electron. Colloquium Comput. Complex. TR22 (2022) - Marshall Ball
, Dana Dachman-Soled, Julian Loss:
(Nondeterministic) Hardness vs. Non-Malleability. Electron. Colloquium Comput. Complex. TR22 (2022)
skipping 155 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-19 12:59 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