|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4036 occurrences of 1595 keywords
|
|
|
|
|
Results
Found 3592 publication records. Showing 3592 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai |
Nearly Optimal Communication and Query Complexity of Bipartite Matching.  |
FOCS  |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuansi Chen, Ronen Eldan |
Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains (extended abstract). |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | William Kuszmaul |
A Hash Table Without Hash Functions, and How to Get the Most Out of Your Random Bits. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Saugata Basu, Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen |
Geometry of Secure Two-party Computation. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoyu Chen, Weiming Feng 0001, Yitong Yin, Xinyuan Zhang |
Optimal mixing for two-state anti-ferromagnetic spin systems. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Andrews 0003 |
On Matrix Multiplication and Polynomial Identity Testing. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Sitan Chen, Jerry Li 0001, Brice Huang, Allen Liu |
Tight Bounds for Quantum State Certification with Incoherent Measurements. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
Pure-Circuit: Strong Inapproximability for PPAD. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Václav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler |
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Huacheng Yu |
Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract). |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronen Shaltiel, Jad Silbak |
Error Correcting Codes that Achieve BSC Capacity Against Channels that are Poly-Size Circuits. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi 0001, Julian Shun, Shangdi Yu |
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Leverrier, Gilles Zémor |
Quantum Tanner codes. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Simon Apers, Yuval Efron, Pawel Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, Danupon Nanongkai |
Cut Query Algorithms with Star Contraction. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Qingyun Chen, Bundit Laekhanukit, Chao Liao, Yuhao Zhang 0001 |
Survivable Network Design Revisited: Group-Connectivity. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Allen Liu, Ankur Moitra |
Minimax Rates for Robust Community Detection. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Jonathan Mosheiff |
Punctured Low-Bias Codes Behave Like Random Linear Codes. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Brice Huang, Mark Sellke |
Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shafi Goldwasser, Michael P. Kim, Vinod Vaikuntanathan, Or Zamir |
Planting Undetectable Backdoors in Machine Learning Models : [Extended Abstract]. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludovic Stephan, Yizhe Zhu |
Sparse random hypergraphs: Non-backtracking spectra and community detection. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafael Oliveira 0006, Akash Kumar Sengupta |
Radical Sylvester-Gallai Theorem for Cubics. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Bodwin, Gary Hoppenworth |
New Additive Spanner Lower Bounds by an Unlayered Obstacle Product. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022 |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Ghaffari 0001 |
Local Computation of Maximal Independent Set. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Xavier Allamigeon, Daniel Dadush, Georg Loho, Bento Natura, László A. Végh |
Interior point methods are not worse than Simplex. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mina Dalirrooyfard, Ce Jin 0001, Virginia Vassilevska Williams, Nicole Wein |
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Vincent Cohen-Addad, Shaofeng H.-C. Jiang, Robert Krauthgamer, Chris Schwiegelshohn, Mads Bech Toftrup, Xuan Wu 0002 |
The Power of Uniform Sampling for Coresets. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Anastos |
Solving the Hamilton cycle problem fast on average. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaonan Jin, Pinyan Lu |
First Price Auction is 1 - 1 /e2 Efficient. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Deanna Needell, William Swartworth, David P. Woodruff |
Testing Positive Semidefiniteness Using Linear Measurements. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaowei Long, Thatchaphol Saranurak |
Near-Optimal Deterministic Vertex-Failure Connectivity Oracles. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad, Moses Charikar, Weiyun Ma, Li-Yang Tan |
Almost 3-Approximate Correlation Clustering in Constant Rounds. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre |
Randomised Composition and Small-Bias Minimax. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara, Nobutaka Shimizu |
Hardness Self-Amplification from Feasible Hard-Core Sets. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Håstad, Kilian Risse |
On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | |
63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022 |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cohen-Addad, Chenglin Fan, Euiwoong Lee, Arnaud de Mesmay |
Fitting Metrics and Ultrametrics with Minimum Disagreements. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Kumar 0001 |
An Approximate Generalization of the Okamura-Seymour Theorem. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | John Kallaugher, Ojas Parekh |
The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff |
A Characterization of Multiclass Learnability. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Göös, Alexandros Hollender, Siddhartha Jain 0002, Gilbert Maystre, William Pires, Robert Robere, Ran Tao |
Separations in Proof Complexity and TFNP. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Peng, Zhihao Gavin Tang |
Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Giuseppe Antonio Di Luna, Giovanni Viglietta |
Computing in Anonymous Dynamic Networks Is Linear. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai |
Deterministic Small Vertex Connectivity in Almost Linear Time. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Robert Krauthgamer, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi |
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Anna R. Karlin, Nathan Klein, Shayan Oveis Gharan |
A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aparna Gupte, Neekon Vafa, Vinod Vaikuntanathan |
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Debarati Das 0001, Jacob Gilbert, MohammadTaghi Hajiaghayi, Tomasz Kociumaka, Barna Saha, Hamed Saleh |
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Namiko Matsumoto, Arya Mazumdar |
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal 0001, William Kuszmaul |
Balanced Allocations: The Heavily Loaded Case with Deletions. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhishek Jain 0002, Zhengzhong Jin |
Indistinguishability Obfuscation via Mathematical Proofs of Equivalence. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, Tianyi Zhang 0008 |
Constant Approximation of Min-Distances in Near-Linear Time. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Max Hopkins, Ting-Chun Lin |
Explicit Lower Bounds Against Ω(n)-Rounds of Sum-of-Squares. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Alex Lombardi, Fermi Ma, Nicholas Spooner |
Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang 0007 |
Binary Codes with Resilience Beyond 1/4 via Interaction. |
FOCS |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanzhi Li, Ruosong Wang, Lin F. Yang |
Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yeshwanth Cherapanamjeri, Jelani Nelson |
Terminal Embeddings in Sublinear Time. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan A. Kelner, Frederic Koehler, Raghu Meka, Dhruv Rohatgi |
On the Power of Preconditioning in Sparse Linear Regression. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Abbe, Shuangping Li, Allan Sly |
Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptron. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Li Chen 0028, Richard Peng, Di Wang 0005 |
2-norm Flow Diffusion in Near-Linear Time. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | John Kallaugher |
A Quantum Advantage for a Natural Streaming Problem. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Siqi Liu 0005, Sidhanth Mohanty, Prasad Raghavendra |
On statistical inference when fixed points of belief propagation are unstable. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena |
Tight Bounds for General Computation in Noisy Broadcast Networks. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Wesolowski |
The supersingular isogeny path and endomorphism ring problems are equivalent. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Dütting, Tomer Ezra, Michal Feldman, Thomas Kesselheim |
Combinatorial Contracts. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Jones, Aaron Potechin, Goutham Rajendran, Madhur Tulsiani, Jeff Xu |
Sum-of-Squares Lower Bounds for Sparse Independent Set. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sai Sandeep |
Almost Optimal Inapproximability of Multidimensional Packing Problems. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Saugata Basu, Nathanael Cox |
Harmonic Persistent Homology (extended abstract). |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sitan Chen, Adam R. Klivans, Raghu Meka |
Learning Deep ReLU Networks Is Fixed-Parameter Tractable. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Roei Tell |
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Cory Palmer, Dömötör Pálvölgyi |
At most 3.55n stable matchings. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Bressan 0002, Marc Roth |
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Olver, Leon Sering, Laura Vargas Koch |
Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Bresler, Brice Huang |
The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Leroux |
The Reachability Problem for Petri Nets is Not Primitive Recursive. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranjal Dutta, Prateek Dwivedi 0001, Nitin Saxena 0001 |
Demystifying the border of depth-3 algebraic circuits. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nisheeth K. Vishnoi |
FOCS 2021 Preface. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya |
Small-space and streaming pattern matching with $k$ edits. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Becker, Alexander Lubotzky, Jonathan Mosheiff |
Testability of relations between permutations. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Czerwinski, Lukasz Orlikowski |
Reachability in Vector Addition Systems is Ackermann-complete. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | David P. Woodruff, Samson Zhou |
Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sitan Chen, Frederic Koehler, Ankur Moitra, Morris Yau |
Online and Distribution-Free Robustness: Regression and Contextual Bandits with Huber Contamination. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Shuichi Hirahara, Mikito Nanashima |
On Worst-Case Learning in Relativized Heuristica. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Lijie Chen 0001, Ce Jin 0001, Rahul Santhanam, R. Ryan Williams |
Constructive Separations and Their Consequences. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki |
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Bukh, Karthik C. S., Bhargav Narayanan |
Applications of Random Algebraic Constructions to Hardness of Approximation. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky |
Integer programs with bounded subdeterminants and two nonzeros per row. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyle W. Burke, Matthew T. Ferland, Shang-Hua Teng |
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominik Scheder |
PPSZ is better than you think. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Filtser |
Hop-Constrained Metric Embeddings and their Applications. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas |
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Srinivasan Arunachalam, Alex B. Grilo, Tom Gur, Igor C. Oliveira, Aarthi Sundaram |
Quantum learning algorithms imply circuit lower bounds. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li 0006, Yu Zheng 0014, Minshen Zhu |
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, Jerry Li 0001 |
Exponential Separations Between Learning With and Without Quantum Memory. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Pooya Hatami, William M. Hoza, Avishay Tal, Roei Tell |
Fooling Constant-Depth Threshold Circuits (Extended Abstract). |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Soheil Behnezhad |
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arka Rai Choudhuri, Abhishek Jain 0002, Zhengzhong Jin |
SNARGs for $\mathcal{P}$ from LWE. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jasper C. H. Lee, Paul Valiant |
Optimal Sub-Gaussian Mean Estimation in $\mathbb{R}$. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender |
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. |
FOCS |
2021 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #300 of 3592 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license