Остановите войну!
for scientists:
default search action
Search dblp for Publications
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.
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 4,006 matches
- 2023
- Mohsen Ghaffari, Christoph Grunau:
Faster Deterministic Distributed MIS and Approximate Matching. STOC 2023: 1777-1790 - Debarati Das, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha:
Weighted Edit Distance Computation: Strings, Trees, and Dyck. STOC 2023: 377-390 - Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC 2023: 1325-1334 - Nikhil Bansal, Haotian Jiang, Raghu Meka:
Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank. STOC 2023: 1814-1819 - George Christodoulou, Elias Koutsoupias, Annamária Kovács:
A Proof of the Nisan-Ronen Conjecture. STOC 2023: 672-685 - Lijie Chen, Roei Tell:
When Arthur Has Neither Random Coins Nor Time to Spare: Superfast Derandomization of Proof Systems. STOC 2023: 60-69 - Srikanth Srinivasan, Utkarsh Tripathi:
Optimal Explicit Small-Depth Formulas for the Coin Problem. STOC 2023: 881-894 - Marco Bressan, Matthias Lanzinger, Marc Roth:
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC 2023: 542-552 - Siqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth Yang:
Local and Global Expansion in Random Geometric Graphs. STOC 2023: 817-825 - Scott Aaronson, Shih-Han Hung:
Certified Randomness from Quantum Supremacy. STOC 2023: 933-944 - Amir Abboud, Karl Bringmann, Nick Fischer:
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. STOC 2023: 391-404 - Divesh Aggarwal, Huck Bennett, Zvika Brakerski, Alexander Golovnev, Rajendra Kumar, Zeyong Li, Spencer Peters, Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
Lattice Problems beyond Polynomial Time. STOC 2023: 1516-1526 - Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, Umesh V. Vazirani:
A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. STOC 2023: 945-957 - Daniel Alabi, Pravesh K. Kothari, Pranay Tankala, Prayaag Venkat, Fred Zhang:
Privately Estimating a Gaussian: Efficient, Robust, and Optimal. STOC 2023: 483-496 - Josh Alman, Kevin Rao:
Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidity. STOC 2023: 455-462 - Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar:
A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. STOC 2023: 1438-1448 - Noga Amit, Guy N. Rothblum:
Constant-Round Arguments from One-Way Functions. STOC 2023: 1537-1544 - Nima Anari, Yizhi Huang, Tianyu Liu, Thuy-Duong Vuong, Brian Xu, Katherine Yu:
Parallel Discrete Sampling via Continuous Walks. STOC 2023: 103-116 - Anurag Anshu, Nikolas P. Breuckmann, Chinmay Nirkhe:
NLTS Hamiltonians from Good Quantum Codes. STOC 2023: 1090-1096 - Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan:
Succinct Computational Secret Sharing. STOC 2023: 1553-1566 - Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. STOC 2023: 1527-1536 - Alexander Armbruster, Lars Rohwedder, Andreas Wiese:
A PTAS for Minimizing Weighted Flow Time on a Single Machine. STOC 2023: 1335-1344 - Atul Singh Arora, Andrea Coladangelo, Matthew Coudron, Alexandru Gheorghiu, Uttam Singh, Hendrik Waldner:
Quantum Depth in the Random Oracle Model. STOC 2023: 1111-1124 - Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC 2023: 131-144 - Sepehr Assadi, Janani Sundaresan:
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. STOC 2023: 183-195 - Albert Atserias, Sam Buss, Moritz Müller:
On the Consistency of Circuit Lower Bounds for Non-deterministic Time. STOC 2023: 1257-1270 - Ainesh Bakshi, Allen Liu, Ankur Moitra, Morris Yau:
A New Approach to Learning Linear Dynamical Systems. STOC 2023: 335-348 - József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao:
Nearly All k-SAT Functions Are Unate. STOC 2023: 958-962 - Étienne Bamas, Lars Rohwedder:
Better Trees for Santa Claus. STOC 2023: 1862-1875 - James Bartusek, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa:
Obfuscation of Pseudo-Deterministic Quantum Circuits. STOC 2023: 1567-1578
skipping 3,976 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-05-02 18:06 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