Остановите войну!
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 119 matches
- 2022
- 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. IEEE 2022, ISBN 978-1-6654-2055-6 [contents]
- 2021
- Anupam Gupta, Amit Kumar, Debmalya Panigrahi:
A Hitting Set Relaxation for $k$-Server and an Extension to Time-Windows. FOCS 2021: 504-515 - Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. FOCS 2021: 646-657 - Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. FOCS 2021: 1285-1295 - George Christodoulou, Elias Koutsoupias, Annamária Kovács:
On the Nisan-Ronen conjecture. FOCS 2021: 839-850 - Anupam Gupta, Gregory Kehne, Roie Levin:
Random Order Online Set Cover is as Easy as Offline. FOCS 2021: 1253-1264 - Wenyu Jin, Xiaorui Sun:
Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended Abstract). FOCS 2021: 861-872 - Lijie Chen, Roei Tell:
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. FOCS 2021: 125-136 - Oded Goldreich, Avi Wigderson:
Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model. FOCS 2021: 269-275 - Marco Bressan, Marc Roth:
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. FOCS 2021: 276-285 - Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: $\text{poly}\left(d\varepsilon {-1}\right)$-time partition oracles for minor-free graph classes. FOCS 2021: 257-268 - Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak:
A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. FOCS 2021: 1124-1134 - Emmanuel Abbe, Shuangping Li, Allan Sly:
Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. FOCS 2021: 327-338 - Amir Abboud, Robert Krauthgamer, Ohad Trabelsi:
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. FOCS 2021: 1135-1146 - Dorna Abdolazimi, Kuikui Liu, Shayan Oveis Gharan:
A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications to Sampling Colorings. FOCS 2021: 161-172 - Mikkel Abrahamsen:
Covering Polygons is Even Harder. FOCS 2021: 375-386 - Shyan Akmal, Ryan Williams:
MAJORITY-3SAT (and Related Problems) in Polynomial Time. FOCS 2021: 1033-1043 - Zeyuan Allen-Zhu, Yuanzhi Li:
Feature Purification: How Adversarial Training Performs Robust Deep Learning. FOCS 2021: 977-988 - Noga Alon, Steve Hanneke, Ron Holzman, Shay Moran:
A Theory of PAC Learnability of Partial Concept Classes. FOCS 2021: 658-671 - Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram:
Quantum learning algorithms imply circuit lower bounds. FOCS 2021: 562-573 - Kyriakos Axiotis, Aleksander Madry, Adrian Vladu:
Faster Sparse Minimum Cost Flow by Electrical Flow Localization. FOCS 2021: 528-539 - Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs and Alon-Saks-Seymour. FOCS 2021: 116-124 - Saugata Basu, Nathanael Cox:
Harmonic Persistent Homology (extended abstract). FOCS 2021: 1112-1123 - Oren Becker, Alexander Lubotzky, Jonathan Mosheiff:
Testability of relations between permutations. FOCS 2021: 286-297 - Soheil Behnezhad:
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. FOCS 2021: 873-884 - Michael A. Bender, Bradley C. Kuszmaul, William Kuszmaul:
Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering. FOCS 2021: 1171-1182 - Aaron Bernstein, Maximilian Probst Gutenberg, Thatchaphol Saranurak:
Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time. FOCS 2021: 1000-1008 - Guy Blanc, Moses Charikar:
Multiway Online Correlated Selection. FOCS 2021: 1277-1284 - Guy Blanc, Jane Lange, Mingda Qiao, Li-Yang Tan:
Properly learning decision trees in almost polynomial time. FOCS 2021: 920-929 - Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu:
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS 2021: 739-750
skipping 89 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-18 11:14 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