Остановите войну!
for scientists:
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 43 matches
- 2021
- Rahul Jain, Srijita Kundu:
A Direct Product Theorem for One-Way Quantum Communication. CCC 2021: 27:1-27:28 - Mrinal Kumar, Ben Lee Volk:
A Lower Bound on Determinantal Complexity. CCC 2021: 4:1-4:12 - Oded Goldreich, Avi Wigderson:
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing. CCC 2021: 12:1-12:74 - Isolde Adler, Noleen Köhler, Pan Peng:
GSF-Locality Is Not Sufficient For Proximity-Oblivious Testing. CCC 2021: 34:1-34:27 - Yaroslav Alekseev:
A Lower Bound for Polynomial Calculus with Extension Rule. CCC 2021: 21:1-21:18 - Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-To-Communication Lifting for Adversary Bounds. CCC 2021: 30:1-30:39 - Simon Apers, Troy Lee:
Quantum Complexity of Minimum Cut. CCC 2021: 28:1-28:33 - László Babai, Bohdan Kivva:
Matrix Rigidity Depends on the Target Field. CCC 2021: 41:1-41:26 - Marshall Ball, Oded Goldreich, Tal Malkin:
Communication Complexity with Defective Randomness. CCC 2021: 14:1-14:10 - Markus Bläser, Julian Dörfler, Christian Ikenmeyer:
On the Complexity of Evaluating Highest Weight Vectors. CCC 2021: 29:1-29:36 - Mark Braverman, Dor Minzer:
Optimal Tiling of the Euclidean Space Using Permutation-Symmetric Bodies. CCC 2021: 5:1-5:48 - Peter Bürgisser, M. Levent Dogan, Visu Makam, Michael Walter, Avi Wigderson:
Polynomial Time Algorithms in Invariant Theory for Torus Actions. CCC 2021: 32:1-32:30 - Prerona Chatterjee:
Separating ABPs and Some Structured Formulas in the Non-Commutative Setting. CCC 2021: 7:1-7:24 - Eshan Chattopadhyay, Jason Gaitonde, Chin Ho Lee, Shachar Lovett, Abhishek Shetty:
Fractional Pseudorandom Generators from Any Fourier Level. CCC 2021: 10:1-10:24 - Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction for Weighted PRGs Against Read Once Branching Programs. CCC 2021: 22:1-22:17 - Gil Cohen, Tal Yankovitz:
Rate Amplification and Query-Efficient Distance Amplification for Linear LCC and LDC. CCC 2021: 1:1-1:57 - Pranjal Dutta, Prateek Dwivedi, Nitin Saxena:
Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits. CCC 2021: 11:1-11:27 - Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. CCC 2021: 25:1-25:36 - Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. CCC 2021: 6:1-6:30 - William Cole Franks, Philipp Reichenbach:
Barriers for Recent Methods in Geodesic Optimization. CCC 2021: 13:1-13:54 - Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. CCC 2021: 39:1-39:36 - Shafi Goldwasser, Russell Impagliazzo, Toniann Pitassi, Rahul Santhanam:
On the Pseudo-Deterministic Query Complexity of NP Search Problems. CCC 2021: 36:1-36:22 - Alexander Golovnev, Ishay Haviv:
The (Generalized) Orthogonality Dimension of (Generalized) Kneser Graphs: Bounds and Applications. CCC 2021: 8:1-8:15 - Mika Göös, Gilbert Maystre:
A Majority Lemma for Randomised Query Complexity. CCC 2021: 18:1-18:15 - Joshua A. Grochow, Youming Qiao:
On p-Group Isomorphism: Search-To-Decision, Counting-To-Decision, and Nilpotency Class Reductions via Tensors. CCC 2021: 16:1-16:38 - Zeyu Guo:
Variety Evasive Subspace Families. CCC 2021: 20:1-20:33 - Shuichi Hirahara, Rahul Ilango, Bruno Loff:
Hardness of Constant-Round Communication Complexity. CCC 2021: 31:1-31:30 - Pavel Hrubes, Amir Yehudayoff:
Shadows of Newton Polytopes. CCC 2021: 9:1-9:23 - Dmitry Itsykson, Artur Riazanov:
Proof Complexity of Natural Formulas via Communication Arguments. CCC 2021: 3:1-3:34 - Vishnu Iyer, Avishay Tal, Michael Whitmeyer:
Junta Distance Approximation with Sub-Exponential Queries. CCC 2021: 24:1-24:38
skipping 13 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-06-11 18:10 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