|
|
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 | Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse |
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Anupam Gupta 0001, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan |
The Price of Explainability for Clustering.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Soh Kumabe, Yuichi Yoshida |
Lipschitz Continuous Algorithms for Graph Problems.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ioana O. Bercea, Lorenzo Beretta 0001, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup |
Locally Uniform Hashing.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | AmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan |
Singular Value Approximation and Sparsifying Random Walks on Directed Graphs.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer |
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Binghui Peng, Aviad Rubinstein |
Near Optimal Memory-Regret Tradeoff for Online Learning.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mohsen Ghaffari 0001, Christoph Grunau, Václav Rozhon |
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michael Elkin, Idan Shabat |
Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n).  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tal Herman, Guy N. Rothblum |
Doubley-Efficient Interactive Proofs for Distribution Properties.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Amir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak |
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Shachar Lovett, Jiapeng Zhang |
Streaming Lower Bounds and Asymmetric Set-Disjointness.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan van den Brand, Daniel J. Zhang |
Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Dor Minzer, Kai Zhe Zheng |
Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ohad Klein |
Slicing all Edges of an n-cube Requires n2/3 Hyperplanes.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gal Arnon, Alessandro Chiesa, Eylon Yogev |
IOPs with Inverse Polynomial Soundness Error.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vaggos Chatziafratis, Konstantin Makarychev |
Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Greg Bodwin, Gary Hoppenworth |
Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Louis Golowich |
From Grassmannian to Simplicial High-Dimensional Expanders.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood |
Proof of the Clustered Hadwiger Conjecture.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tony Metger, Henry Yuen |
stateQIP = statePSPACE.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Bingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang |
Improved Hardness of Approximating k-Clique under ETH.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hung Le 0001, Shay Solomon, Cuong Than |
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rainie Bozzai, Victor Reis, Thomas Rothvoss |
The Vector Balancing Constant for Zonotopes.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan 0001, Santhoshini Velusamy |
Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Silas Richelson, Sourya Roy |
Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Guy Bresler, Chenghao Guo, Yury Polyanskiy |
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Cohen-Addad, Hung Le 0001, Marcin Pilipczuk, Michal Pilipczuk |
Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic Treewidth with Expected Multiplicative Distortion Arbitrarily Close to 1.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sepehr Assadi, Janani Sundaresan |
Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford |
Sparsifying Sums of Norms.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick |
Separating MAX 2-AND, MAX DI-CUT and MAX CUT.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alexandr Andoni, Hengjie Zhang |
Sub-quadratic (1+ϵ)-approximate Euclidean Spanners, with Applications.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eric Blais, Cameron Seth |
Testing Graph Properties with the Container Method.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Merav Parter |
Secure Computation Meets Distributed Universal Optimality.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase |
Parameterized Approximation Schemes for Clustering with General Norm Objectives.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vishesh Jain, Marcus Michelen, Huy Tuan Pham, Thuy-Duong Vuong |
Optimal mixing of the down-up walk on independent sets of a given size.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Benny Applebaum, Oded Nir |
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Edward Pyne, Ran Raz, Wei Zhan |
Certified Hardness vs. Randomness for Log-Space.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Szymon Torunczyk |
Flip-width: Cops and Robber on dense graphs.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tuukka Korhonen, Konrad Majewski, Wojciech Nadara, Michal Pilipczuk, Marek Sokolowski 0001 |
Dynamic treewidth.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan van den Brand, Li Chen 0028, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford |
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass |
Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Caleb Koch, Carmen Strassle, Li-Yang Tan |
Properly learning decision trees with queries is NP-hard.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Reza Gheissari |
Sampling from the Potts model at low temperatures via Swendsen-Wang dynamics.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Clément L. Canonne, Samuel B. Hopkins, Jerry Li 0001, Allen Liu, Shyam Narayanan |
The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contamination.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tomasz Kociumaka, Anish Mukherjee 0001, Barna Saha |
Approximating Edit Distance in the Fully Dynamic Model.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nick Gravin, Enze Sun, Zhihao Gavin Tang |
Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal Complexity.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak |
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lijie Chen 0001, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam |
Polynomial-Time Pseudodeterministic Construction of Primes.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Neil Olver, Leon Sering, Laura Vargas Koch |
Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over Time.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Timothy M. Chan, Ce Jin 0001, Virginia Vassilevska Williams, Yinzhan Xu |
Faster Algorithms for Text-to-Pattern Hamming Distances.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mark Braverman, Subhash Khot, Dor Minzer |
Parallel Repetition for the GHZ Game: Exponential Decay.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Guy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan |
A strong composition theorem for junta complexity and the boosting of property testers.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Zeyu Guo 0001, Zihan Zhang |
Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar 0001, Ramprasad Saptharishi |
Fast Numerical Multivariate Multipoint Evaluation.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Xiao Liang 0014, Omkant Pandey, Takashi Yamakawa |
A New Approach to Post-Quantum Non-Malleability.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arturo I. Merino, Torsten Mütze |
Traversing combinatorial 0/1-polytopes via optimization.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Vincent Cohen-Addad, David P. Woodruff, Samson Zhou |
Streaming Euclidean k-median and k-means with o(log n) Space.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Susanna F. de Rezende, Aaron Potechin, Kilian Risse |
Clique Is Hard on Average for Unary Sherali-Adams.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sinho Chewi, Jaume de Dios Pont, Jerry Li 0001, Chen Lu 0002, Shyam Narayanan |
Query lower bounds for log-concave sampling.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Victor Reis, Thomas Rothvoss |
The Subspace Flatness Conjecture and Faster Integer Programming.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Weiming Feng 0001, Heng Guo 0001, Chunyang Wang, Jiaheng Wang 0002, Yitong Yin |
Towards derandomising Markov chain Monte Carlo.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lijie Chen 0001, Roei Tell, Ryan Williams 0001 |
Derandomization vs Refutation: A Unified Framework for Characterizing Derandomization.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Johan Håstad |
On small-depth Frege proofs for PHP.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
Dynamic "Succincter".  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hiroshi Hirai 0001, Harold Nieuwboer, Michael Walter 0005 |
Interior-point methods on manifolds: theory and applications.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Arturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter 0005, Freek Witteveen |
The minimal canonical form of a tensor network.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Johannes Carmesin, Jan Kurkofka |
Canonical decompositions of 3-connected graphs.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Ran Duan, Jiayi Mao, Xinkai Shu, Longhui Yin |
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Chase 0001, Shay Moran, Amir Yehudayoff |
Stability and Replicability in Learning.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Yao-Ching Hsieh, Huijia Lin, Ji Luo 0002 |
Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alejandro Cassis, Tomasz Kociumaka, Philip Wellnitz |
Optimal Algorithms for Bounded Weighted Edit Distance.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Lijie Chen 0001, William M. Hoza, Xin Lyu 0002, Avishay Tal, Hongxun Wu |
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Valerio Cini, Hoeteck Wee |
ABE for Circuits with poly (λ) -sized Keys from LWE.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan van den Brand, Adam Karczmarz |
Deterministic Fully Dynamic SSSP and More.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | William Kuszmaul |
Strongly History-Independent Storage Allocation: New Upper and Lower Bounds.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Emmanuel Abbe, Colin Sandon |
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Xiaoyu Chen, Jingcheng Liu 0005, Yitong Yin |
Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract).  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra |
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou |
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak |
Chasing Positive Bodies.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Ilango |
SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Reilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk |
Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple Polygon.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Divesh Aggarwal, Rajendra Kumar 0002 |
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Karl Bringmann, Alejandro Cassis, Nick Fischer |
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Andrei Graur, Haotian Jiang, Aaron Sidford |
Sparse Submodular Function Minimization.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani |
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Michal Wlodarczyk 0001, Meirav Zehavi |
Planar Disjoint Paths, Treewidth, and Kernels.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | |
64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hadley Black, Deeparnab Chakrabarty, C. Seshadhri 0001 |
A d1/2+o(1) Monotonicity Tester for Boolean Functions on d-Dimensional Hypergrids.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein |
Local Computation Algorithms for Maximum Matching: New Lower Bounds.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu 0001 |
Fourier Growth of Communication Protocols for XOR Functions.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Praneeth Kacham, Rasmus Pagh, Mikkel Thorup, David P. Woodruff |
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jason M. Altschuler, Sinho Chewi |
Faster high-accuracy log-concave sampling via algorithmic warm starts.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alexandros Hollender, Aviad Rubinstein |
Envy-Free Cake-Cutting for Four Agents.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Emily Fox, Jiashuai Lu |
A deterministic near-linear time approximation scheme for geometric transportation.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Xin Li 0006 |
Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan |
Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan |
Constant Approximation for Private Interdependent Valuations.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov 0001 |
Top-Down Lower Bounds for Depth-Four Circuits.  |
FOCS  |
2023 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 3592 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|