FOCS - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 4010

2023

Interior-point methods on manifolds: theory and applicationsHiroshi Hirai 0001, Harold Nieuwboer, Michael Walter 0005. focs 2023: 2021-2030 [doi]

Derandomization vs Refutation: A Unified Framework for Characterizing DerandomizationLijie Chen 0001, Roei Tell, Ryan Williams 0001. focs 2023: 1008-1047 [doi]

Polynomial-Time Pseudodeterministic Construction of PrimesLijie Chen 0001, Zhenjian Lu, Igor C. Oliveira, Hanlin Ren, Rahul Santhanam. focs 2023: 1261-1270 [doi]

Planar Disjoint Paths, Treewidth, and KernelsMichal Wlodarczyk 0001, Meirav Zehavi. focs 2023: 649-662 [doi]

Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise IndependenceMohsen Ghaffari 0001, Christoph Grunau, Václav Rozhon. focs 2023: 1551-1562 [doi]

The Price of Explainability for ClusteringAnupam Gupta 0001, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan. focs 2023: 1131-1148 [doi]

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and ShortcuttingLijie Chen 0001, William M. Hoza, Xin Lyu 0002, Avishay Tal, Hongxun Wu. focs 2023: 1224-1239 [doi]

Tight Time-Space Lower Bounds for Constant-Pass LearningXin Lyu 0002, Avishay Tal, Hongxun Wu, Junzhao Yang. focs 2023: 1195-1202 [doi]

HDX CondensersItay Cohen 0003, Roy Roth, Amnon Ta-Shma. focs 2023: 1649-1664 [doi]

64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023IEEE, 2023. [doi]

Parameterized Approximation Schemes for Clustering with General Norm ObjectivesFateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase. focs 2023: 1377-1399 [doi]

A proof that Reed-Muller codes achieve Shannon capacity on symmetric channelsEmmanuel Abbe, Colin Sandon. focs 2023: 177-193 [doi]

All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear TimeAmir Abboud, Jason Li 0006, Debmalya Panigrahi, Thatchaphol Saranurak. focs 2023: 2204-2212 [doi]

The minimal canonical form of a tensor networkArturo Acuaviva, Visu Makam, Harold Nieuwboer, David Pérez-García, Friedrich Sittner, Michael Walter 0005, Freek Witteveen. focs 2023: 328-362 [doi]

Optimal PAC Bounds without Uniform ConvergenceIshaq Aden-Ali, Yeshwanth Cherapanamjeri, Abhishek Shetty, Nikita Zhivotovskiy. focs 2023: 1203-1223 [doi]

Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!Divesh Aggarwal, Rajendra Kumar 0002. focs 2023: 2213-2230 [doi]

Singular Value Approximation and Sparsifying Random Walks on Directed GraphsAmirMahdi Ahmadinejad, John Peebles, Edward Pyne, Aaron Sidford, Salil P. Vadhan. focs 2023: 846-854 [doi]

Generalizations of Matrix Multiplication can solve the Light Bulb ProblemJosh Alman, Hengjie Zhang. focs 2023: 1471-1495 [doi]

Faster high-accuracy log-concave sampling via algorithmic warm startsJason M. Altschuler, Sinho Chewi. focs 2023: 2169-2176 [doi]

Sub-quadratic (1+ϵ)-approximate Euclidean Spanners, with ApplicationsAlexandr Andoni, Hengjie Zhang. focs 2023: 98-112 [doi]

Advisor-Verifier-Prover Games and the Hardness of Information Theoretic CryptographyBenny Applebaum, Oded Nir. focs 2023: 539-555 [doi]

Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate MatchingsSepehr Assadi, Janani Sundaresan. focs 2023: 909-932 [doi]

*Ryan Babbush, Dominic W. Berry, Robin Kothari, Rolando D. Somma, Nathan Wiebe. focs 2023: 405-414 [doi]

Krylov Methods are (nearly) Optimal for Low-Rank ApproximationAinesh Bakshi, Shyam Narayanan. focs 2023: 2093-2101 [doi]

Extracting Randomness from Samplable Distributions, RevisitedMarshall Ball, Eli Goldin, Dana Dachman-Soled, Saachi Mutreja. focs 2023: 1505-1514 [doi]

Local Computation Algorithms for Maximum Matching: New Lower BoundsSoheil Behnezhad, Mohammad Roghani, Aviad Rubinstein. focs 2023: 2322-2335 [doi]

Locally Uniform HashingIoana O. Bercea, Lorenzo Beretta 0001, Jonas Klausen, Jakob Bæk Tejs Houen, Mikkel Thorup. focs 2023: 1440-1470 [doi]

Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update TimeSayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak. focs 2023: 1563-1588 [doi]

Chasing Positive BodiesSayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak. focs 2023: 1694-1714 [doi]

Testing Graph Properties with the Container MethodEric Blais, Cameron Seth. focs 2023: 1787-1795 [doi]

A strong composition theorem for junta complexity and the boosting of property testersGuy Blanc, Caleb Koch, Carmen Strassle, Li-Yang Tan. focs 2023: 1757-1777 [doi]

Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n BarrierGreg Bodwin, Gary Hoppenworth. focs 2023: 701-720 [doi]

Bridge Girth: A Unifying Notion in Network DesignGreg Bodwin, Gary Hoppenworth, Ohad Trabelsi. focs 2023: 600-648 [doi]

The Vector Balancing Constant for ZonotopesRainie Bozzai, Victor Reis, Thomas Rothvoss. focs 2023: 1292-1300 [doi]

Separating MAX 2-AND, MAX DI-CUT and MAX CUTJoshua Brakensiek, Neng Huang, Aaron Potechin, Uri Zwick. focs 2023: 234-252 [doi]

Parallel Repetition for the GHZ Game: Exponential DecayMark Braverman, Subhash Khot, Dor Minzer. focs 2023: 1337-1341 [doi]

Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra TrianglesGuy Bresler, Chenghao Guo, Yury Polyanskiy. focs 2023: 2149-2158 [doi]

Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!Karl Bringmann, Alejandro Cassis, Nick Fischer. focs 2023: 515-538 [doi]

Constant-Factor Approximation Algorithms for Convex Cover and Hidden Set in a Simple PolygonReilly Browne, Prahlad Narasimhan Kasthurirangan, Joseph S. B. Mitchell, Valentin Polishchuk. focs 2023: 1357-1365 [doi]

One Tree to Rule Them All: Poly-Logarithmic Universal Steiner TreeCostas Busch, Da Qi Chen, Arnold Filtser, Daniel Hathcock, D. Ellis Hershkowitz, Rajmohan Rajaraman. focs 2023: 60-76 [doi]

Canonical decompositions of 3-connected graphsJohannes Carmesin, Jan Kurkofka. focs 2023: 1887-1920 [doi]

Optimal Algorithms for Bounded Weighted Edit DistanceAlejandro Cassis, Tomasz Kociumaka, Philip Wellnitz. focs 2023: 2177-2187 [doi]

Faster Algorithms for Text-to-Pattern Hamming DistancesTimothy M. Chan, Ce Jin 0001, Virginia Vassilevska Williams, Yinzhan Xu. focs 2023: 2188-2203 [doi]

Covering Planar Metrics (and Beyond): O(1) Trees SufficeHsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, Cuong Than. focs 2023: 2231-2261 [doi]

Triplet Reconstruction and all other Phylogenetic CSPs are Approximation ResistantVaggos Chatziafratis, Konstantin Makarychev. focs 2023: 253-284 [doi]

Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended abstract)Xiaoyu Chen, Jingcheng Liu 0005, Yitong Yin. focs 2023: 1991-2005 [doi]

Query lower bounds for log-concave samplingSinho Chewi, Jaume de Dios Pont, Jerry Li 0001, Chen Lu 0002, Shyam Narayanan. focs 2023: 2139-2148 [doi]

Graph Colouring Is Hard on Average for Polynomial Calculus and NullstellensatzJonas Conneryd, Susanna F. de Rezende, Jakob Nordström, Shuo Pang, Kilian Risse. focs 2023: 1-11 [doi]

Clique Is Hard on Average for Unary Sherali-AdamsSusanna F. de Rezende, Aaron Potechin, Kilian Risse. focs 2023: 12-25 [doi]

A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted GraphsRan Duan, Jiayi Mao, Xinkai Shu, Longhui Yin. focs 2023: 484-492 [doi]

Constant Approximation for Private Interdependent ValuationsAlon Eden, Michal Feldman, Kira Goldner, Simon Mauras, Divyarthi Mohan. focs 2023: 148-163 [doi]

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n)Michael Elkin, Idan Shabat. focs 2023: 2278-2311 [doi]

A deterministic near-linear time approximation scheme for geometric transportationEmily Fox, Jiashuai Lu. focs 2023: 1301-1315 [doi]

On Symmetric Factorizations of Hankel MatricesMehrdad Ghadiri. focs 2023: 2081-2092 [doi]

Fast Numerical Multivariate Multipoint EvaluationSumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar 0001, Ramprasad Saptharishi. focs 2023: 1426-1439 [doi]

On Lifting Integrality Gaps to SSEH Hardness for Globally Constrained CSPsSuprovat Ghoshal, Euiwoong Lee. focs 2023: 26-36 [doi]

From Grassmannian to Simplicial High-Dimensional ExpandersLouis Golowich. focs 2023: 1639-1648 [doi]

Sparse Submodular Function MinimizationAndrei Graur, Haotian Jiang, Aaron Sidford. focs 2023: 2071-2080 [doi]

Online Ordinal Problems: Optimality of Comparison-based Algorithms and their Cardinal ComplexityNick Gravin, Enze Sun, Zhihao Gavin Tang. focs 2023: 1863-1876 [doi]

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman RefinementsMartin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer. focs 2023: 798-809 [doi]

Efficient Algorithms for Semirandom Planted CSPs at the Refutation ThresholdVenkatesan Guruswami, Jun-Ting Hsieh, Pravesh K. Kothari, Peter Manohar. focs 2023: 307-327 [doi]

Top-Down Lower Bounds for Depth-Four CircuitsMika Göös, Artur Riazanov, Anastasia Sofronova, Dmitry Sokolov 0001. focs 2023: 1048-1055 [doi]

Query-optimal estimation of unitary channels in diamond distanceJeongwan Haah, Robin Kothari, Ryan O'Donnell, Ewin Tang. focs 2023: 363-390 [doi]

Doubley-Efficient Interactive Proofs for Distribution PropertiesTal Herman, Guy N. Rothblum. focs 2023: 743-751 [doi]

Learning in Pessiland via Inductive InferenceShuichi Hirahara, Mikito Nanashima. focs 2023: 447-457 [doi]

Envy-Free Cake-Cutting for Four AgentsAlexandros Hollender, Aviad Rubinstein. focs 2023: 113-122 [doi]

On small-depth Frege proofs for PHPJohan Håstad. focs 2023: 37-49 [doi]

SAT Reduces to the Minimum Circuit Size Problem with a Random OracleRahul Ilango. focs 2023: 733-742 [doi]

Sparsifying Sums of NormsArun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford. focs 2023: 1953-1962 [doi]

List Decoding of Tanner and Expander Amplified Codes from Distance CertificatesFernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani. focs 2023: 1682-1693 [doi]

Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyondNathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan. focs 2023: 1316-1336 [doi]

Sensitivity and Dynamic Distance Oracles via Generic Matrices and Frobenius FormAdam Karczmarz, Piotr Sankowski. focs 2023: 1745-1756 [doi]

Strong Bounds for 3-ProgressionsZander Kelley, Raghu Meka. focs 2023: 933-973 [doi]

Matrix Completion in Almost-Verification TimeJonathan A. Kelner, Jerry Li 0001, Allen Liu, Aaron Sidford, Kevin Tian. focs 2023: 2102-2128 [doi]

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed SpaceDominik Kempa, Tomasz Kociumaka. focs 2023: 1877-1886 [doi]

Thin Trees for Laminar FamiliesNathan Klein, Neil Olver. focs 2023: 50-59 [doi]

2/3 HyperplanesOhad Klein. focs 2023: 1931-1936 [doi]

Properly learning decision trees with queries is NP-hardCaleb Koch, Carmen Strassle, Li-Yang Tan. focs 2023: 2383-2407 [doi]

Approximating Edit Distance in the Fully Dynamic ModelTomasz Kociumaka, Anish Mukherjee 0001, Barna Saha. focs 2023: 1628-1638 [doi]

Improved Approximations for Vector Bin Packing via Iterative Randomized RoundingAriel Kulik, Matthias Mnich, Hadas Shachnai. focs 2023: 1366-1376 [doi]

Lipschitz Continuous Algorithms for Graph ProblemsSoh Kumabe, Yuichi Yoshida. focs 2023: 762-797 [doi]

Strongly History-Independent Storage Allocation: New Upper and Lower BoundsWilliam Kuszmaul. focs 2023: 1822-1841 [doi]

Agnostic proper learning of monotone functions: beyond the black-box correction barrierJane Lange, Arsen Vasilyan. focs 2023: 1149-1170 [doi]

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness BarrierHung Le, Shay Solomon, Cuong Than. focs 2023: 77-97 [doi]

Improved Hardness of Approximating k-Clique under ETHBingkai Lin, Xuandi Ren, Yican Sun, Xiuhan Wang. focs 2023: 285-306 [doi]

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong CompositionOr Meir. focs 2023: 1056-1081 [doi]

Traversing combinatorial 0/1-polytopes via optimizationArturo I. Merino, Torsten Mütze. focs 2023: 1282-1291 [doi]

stateQIP = statePSPACETony Metger, Henry Yuen. focs 2023: 1349-1356 [doi]

Optimal Testing of Generalized Reed-Muller Codes in Fewer QueriesDor Minzer, Kai Zhe Zheng. focs 2023: 206-233 [doi]

Bounding the Quantum Value of Compiled Nonlocal Games: From CHSH to BQP VerificationAnand Natarajan, Tina Zhang. focs 2023: 1342-1348 [doi]

Explicit orthogonal and unitary designsRyan O'Donnell, Rocco A. Servedio, Pedro Paredes 0002. focs 2023: 1240-1260 [doi]

Convergence of Approximate and Packet Routing Equilibria to Nash Flows Over TimeNeil Olver, Leon Sering, Laura Vargas Koch. focs 2023: 123-133 [doi]

Secure Computation Meets Distributed Universal OptimalityMerav Parter. focs 2023: 2336-2368 [doi]

The Subspace Flatness Conjecture and Faster Integer ProgrammingVictor Reis, Thomas Rothvoss. focs 2023: 974-988 [doi]

Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary CodesSilas Richelson, Sourya Roy. focs 2023: 194-205 [doi]

Distribution of the threshold for the symmetric perceptronAshwin Sah, Mehtaab Sawhney. focs 2023: 2369-2382 [doi]

Flip-width: Cops and Robber on dense graphsSzymon Torunczyk. focs 2023: 663-700 [doi]

Deterministic Fully Dynamic SSSP and MoreJan van den Brand, Adam Karczmarz. focs 2023: 2312-2321 [doi]

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost FlowJan van den Brand, Li Chen 0028, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford. focs 2023: 503-514 [doi]

Faster High Accuracy Multi-Commodity Flow from Single-Commodity TechniquesJan van den Brand, Daniel J. Zhang. focs 2023: 493-502 [doi]

Links

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1

FOCS (focs)

Viewing Publication 1 - 100 from 4010

2023

Links

Filter by Year [-]OR AND NOT 1

Filter by Tag [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top terms [+]OR AND NOT 1

FOCS (focs)

Viewing Publication 1 - 100 from 4010

2023

Filter by Year

[-]
OR AND NOT 1

Filter by Tag

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top terms

[+]
OR AND NOT 1