Table of Contents

• Front Matter [doi]
• Fine-grained Complexity Meets IP = PSPACELijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein. 1-20 [doi]
• An Equivalence Class for Orthogonal VectorsLijie Chen, Ryan Williams. 21-40 [doi]
• SETH-Based Lower Bounds for Subset Sum and Bicriteria PathAmir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay. 41-57 [doi]
• Fast Modular Subset Sum using Linear SketchingKyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu. 58-69 [doi]
• A Subquadratic Approximation Scheme for PartitionMarcin Mucha, Karol Wegrzycki, Michal Wlodarczyk 0001. 70-88 [doi]
• Metrical task systems on trees via mirror descent and unfair gluingSébastien Bubeck, Michael B. Cohen, James R. Lee, Yin Tat Lee. 89-97 [doi]
• k-Servers with a Smile: Online Algorithms via ProjectionsNiv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor. 98-116 [doi]
• A Nearly-Linear Bound for Chasing Nested Convex BodiesC. J. Argue, Sébastien Bubeck, Michael B. Cohen, Anupam Gupta, Yin Tat Lee. 117-122 [doi]
• A ϕ-Competitive Algorithm for Scheduling Packets with DeadlinesPavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall. 123-142 [doi]
• Elastic CachingAnupam Gupta, Ravishankar Krishnaswamy, Amit Kumar 0001, Debmalya Panigrahi. 143-156 [doi]
• Dynamic Double Auctions: Towards First BestSantiago R. Balseiro, Vahab S. Mirrokni, Renato Paes Leme, Song Zuo. 157-172 [doi]
• Multi-unit Supply-monotone Auctions with Bayesian ValuationsYuan Deng, Debmalya Panigrahi. 173-192 [doi]
• Correlation-Robust Analysis of Single Item AuctionXiaohui Bei, Nick Gravin, Pinyan Lu, Zhihao Gavin Tang. 193-208 [doi]
• Tight Revenue Gaps among Simple MechanismsYaonan Jin, Pinyan Lu, Zhihao Gavin Tang, Tao Xiao. 209-228 [doi]
• Assignment Mechanisms under Distributional ConstraintsItai Ashlagi, Amin Saberi, Ali Shameli. 229-240 [doi]
• Deterministic (½ + ε)-Approximation for Submodular Maximization over a MatroidNiv Buchbinder, Moran Feldman, Mohit Garg 0003. 241-254 [doi]
• Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query ComplexityMatthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam. 255-273 [doi]
• Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear TimeAlina Ene, Huy L. Nguyen. 274-282 [doi]
• An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in ApproximationEric Balkanski, Aviad Rubinstein, Yaron Singer. 283-302 [doi]
• Submodular Function Maximization in Parallel via the Multilinear RelaxationChandra Chekuri, Kent Quanrud. 303-322 [doi]
• Stochastic Submodular Cover with Limited AdaptivityArpit Agarwal, Sepehr Assadi, Sanjeev Khanna. 323-342 [doi]
• Stochastic ℓp Load Balancing and Moment Problems via the L-Function MethodMarco Molinaro. 343-354 [doi]
• Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted DistancesAhmed Abdelkader, Sunil Arya, Guilherme Dias da Fonseca, David M. Mount. 355-372 [doi]
• Colored range closest-pair problem under general distance functionsJie Xue. 373-390 [doi]
• Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple PolygonsEunjin Oh 0003. 391-409 [doi]
• New Lower Bounds for the Number of Pseudoline ArrangementsAdrian Dumitrescu, Ritankar Mandal. 410-425 [doi]
• Extremal and probabilistic results for order typesJie Han 0002, Yoshiharu Kohayakawa, Marcelo Tadeu Sales, Henrique Stagni. 426-435 [doi]
• An Algorithmic Blend of LPs and Ring Equations for Promise CSPsJoshua Brakensiek, Venkatesan Guruswami. 436-455 [doi]
• The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean DomainMonaldo Mastrolilli. 456-475 [doi]
• Perfect Matchings, Rank of Connection Tensors and Graph HomomorphismsJin-yi Cai, Artem Govorov. 476-495 [doi]
• Probabilistic Tensors and Opportunistic Boolean Matrix MultiplicationMatti Karppa, Petteri Kaski. 496-515 [doi]
• Fast greedy for linear matroidsHuy L. Nguyen. 516-524 [doi]
• Flow-Cut Gaps and Face Covers in Planar GraphsRobert Krauthgamer, James R. Lee, Havana Rika. 525-534 [doi]
• On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free GraphsArio Salmasi, Anastasios Sidiropoulos, Vijay Sridhar. 535-553 [doi]
• Maximum Integer Flows in Directed Planar Graphs with Vertex Capacities and Multiple Sources and SinksYipu Wang. 554-568 [doi]
• A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free GraphsNathaniel Lahn, Sharath Raghvendra. 569-588 [doi]
• Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear TimeDavid Eppstein, Bruce Reed. 589-605 [doi]
• Reproducibility and Pseudo-Determinism in Log-SpaceOfer Grossman, Yang P. Liu. 606-620 [doi]
• Pseudorandomness for read-k DNF formulasRocco A. Servedio, Li-Yang Tan. 621-638 [doi]
• Near-optimal Bootstrapping of Hitting Sets for Algebraic CircuitsMrinal Kumar 0001, Ramprasad Saptharishi, Anamay Tengse. 639-646 [doi]
• A Deterministic PTAS for the Algebraic Rank of Bounded Degree PolynomialsVishwas Bhargava, Markus Bläser, Gorav Jindal, Anurag Pandey. 647-661 [doi]
• Quantum algorithms and approximating polynomials for composed functions with shared inputsMark Bun, Robin Kothari, Justin Thaler. 662-678 [doi]
• Anaconda: A Non-Adaptive Conditional Sampling Algorithm for Distribution TestingGautam Kamath, Christos Tzamos. 679-693 [doi]
• Testing Halfspaces over Rotation-Invariant DistributionsNathaniel Harms. 694-713 [doi]
• Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite SubpropertyHendrik Fichtenberger, Pan Peng, Christian Sohler. 714-726 [doi]
• Testing Matrix Rank, OptimallyMaria-Florina Balcan, Yi Li, David P. Woodruff, Hongyang Zhang 0001. 727-746 [doi]
• A PTAS for ℓp-Low Rank ApproximationFrank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff. 747-766 [doi]
• Sublinear Algorithms for (Δ + 1) Vertex ColoringSepehr Assadi, Yu Chen, Sanjeev Khanna. 767-786 [doi]
• Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL modelShiri Chechik, Doron Mukhtar. 787-804 [doi]
• Distributed Maximal Independent Set using Small MessagesMohsen Ghaffari. 805-820 [doi]
• Distributed Triangle Detection via Expander DecompositionYi-Jun Chang, Seth Pettie, Hengjie Zhang. 821-840 [doi]
• Oblivious resampling oracles and parallel algorithms for the Lopsided Lovász Local LemmaDavid G. Harris. 841-860 [doi]
• On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)Rohit Gurjar, Nisheeth K. Vishnoi. 861-880 [doi]
• Minimum Cut and Minimum k-Cut in Hypergraphs via Branching ContractionsKyle Fox, Debmalya Panigrahi, Fred Zhang. 881-896 [doi]
• Improving the smoothed complexity of FLIP for max cut problemsAli Bibak, Charles Carlson, Karthekeyan Chandrasekaran. 897-916 [doi]
• Computing all Wardrop Equilibria parametrized by the Flow DemandMax Klimm, Philipp Warode. 917-934 [doi]
• Nash Flows Over Time with SpillbackLeon Sering, Laura Vargas Koch. 935-945 [doi]
• On the rank of a random binary matrixColin Cooper, Alan M. Frieze, Wesley Pegden. 946-955 [doi]
• On coalescence time in graphs: When is coalescing as fast as meeting?: Extended AbstractVarun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald. 956-965 [doi]
• Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree MatricesGeorgios Amanatidis, Pieter Kleer. 966-985 [doi]
• XOR Codes and Sparse Learning Parity with NoiseAndrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan. 986-1004 [doi]
• Seeded Graph Matching via Large Neighborhood StatisticsElchanan Mossel, Jiaming Xu. 1005-1014 [doi]
• Nearly ETH-tight algorithms for Planar Steiner Tree with Terminals on Few FacesSándor Kisfaludi-Bak, Jesper Nederlof, Erik Jan van Leeuwen. 1015-1034 [doi]
• Contraction Decomposition in Unit Disk Graphs and Algorithmic Applications in Parameterized ComplexityFahad Panolan, Saket Saurabh 0001, Meirav Zehavi. 1035-1054 [doi]
• Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free GraphsMohammadHossein Bateni, Alireza Farhadi, MohammadTaghi Hajiaghayi. 1055-1068 [doi]
• Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric ProblemsEli Fox-Epstein, Philip N. Klein, Aaron Schild. 1069-1088 [doi]
• A PTAS for Euclidean TSP with Hyperplane NeighborhoodsAntonios Antoniadis, Krzysztof Fleszar 0001, Ruben Hoeksma, Kevin Schewior. 1089-1105 [doi]
• The streaming k-mismatch problemRaphaël Clifford, Tomasz Kociumaka, Ely Porat. 1106-1125 [doi]
• Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed TextsKarl Bringmann, Philip Wellnitz, Marvin Künnemann. 1126-1145 [doi]
• Lower bounds for text indexing with mismatches and differencesVincent Cohen-Addad, Laurent Feuilloley, Tatiana A. Starikovskaya. 1146-1164 [doi]
• Efficiently Approximating Edit Distance Between Pseudorandom StringsWilliam Kuszmaul. 1165-1180 [doi]
• Approximating LCS in Linear Time: Beating the √n BarrierMohammadTaghi Hajiaghayi, Masoud Seddighin, Saeed Seddighin, Xiaorui Sun. 1181-1200 [doi]
• The Maximum Number of Minimal Dominating Sets in a TreeGünter Rote. 1201-1214 [doi]
• How to guess an n-digit numberZilin Jiang, Nikita Polyanskii. 1215-1220 [doi]
• Vector clique decompositionsRaphael Yuster. 1221-1238 [doi]
• Four-coloring P6-free graphsSophie Spirkl, Maria Chudnovsky, Mingxian Zhong. 1239-1256 [doi]
• Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphsAndrzej Grzesik, Tereza Klimosova, Marcin Pilipczuk, Michal Pilipczuk. 1257-1271 [doi]
• Strategies for Stable Merge SortingSam Buss, Alexander Knop. 1272-1290 [doi]
• A sort of an adversaryHaim Kaplan, Or Zamir, Uri Zwick. 1291-1310 [doi]
• A New Path from Splay to Dynamic OptimalityCaleb C. Levy, Robert E. Tarjan. 1311-1330 [doi]
• A Faster External Memory Priority Queue with DecreaseKeysShunhua Jiang, Kasper Green Larsen. 1331-1343 [doi]
• Optimal Construction of Compressed Indexes for Highly Repetitive TextsDominik Kempa. 1344-1357 [doi]
• Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive HardnessVijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani. 1358-1368 [doi]
• Proportional Volume Sampling and Approximation Algorithms for A-Optimal DesignAleksandar Nikolov, Mohit Singh, Uthaipon Tao Tantipongpipat. 1369-1386 [doi]
• Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other ApplicationsAmirMahdi Ahmadinejad, Arun Jambulapati, Amin Saberi, Aaron Sidford. 1387-1404 [doi]
• Iterative Refinement for ℓp-norm RegressionDeeksha Adil, Rasmus Kyng, Richard Peng, Sushant Sachdeva. 1405-1424 [doi]
• Optimizing quantum optimization algorithms via faster quantum gradient computationAndrás Gilyén, Srinivasan Arunachalam, Nathan Wiebe. 1425-1444 [doi]
• Towards Tight(er) Bounds for the Excluded Grid TheoremJulia Chuzhoy, Zihan Tan. 1445-1464 [doi]
• Polynomial Planar Directed Grid TheoremMeike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer. 1465-1484 [doi]
• A tight Erdős-Pósa function for planar minorsWouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond. 1485-1500 [doi]
• Polynomial bounds for centered colorings on proper minor-closed graph classesMichal Pilipczuk, Sebastian Siebertz. 1501-1520 [doi]
• Every Collinear Set in a Planar Graph Is FreeVida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote. 1521-1538 [doi]
• A 1.5-Approximation for Path TSPRico Zenklusen. 1539-1549 [doi]
• A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and BeyondMartin Nägele, Rico Zenklusen. 1550-1569 [doi]
• Lift and Project Algorithms for Precedence Constrained Scheduling to Minimize Completion TimeShashwat Garg, Janardhan Kulkarni, Shi Li. 1570-1584 [doi]
• A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-timeUriel Feige, Janardhan Kulkarni, Shi Li. 1585-1595 [doi]
• On Approximating (Sparse) Covering Integer ProgramsChandra Chekuri, Kent Quanrud. 1596-1615 [doi]
• Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive GraphsSepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein. 1616-1635 [doi]
• Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local ComputationMohsen Ghaffari, Jara Uitto. 1636-1653 [doi]
• Massively Parallel Approximation Algorithms for Edit Distance and Longest Common SubsequenceMohammadTaghi Hajiaghayi, Saeed Seddighin, Xiaorui Sun. 1654-1672 [doi]
• Low Congestion Cycle Covers and Their ApplicationsMerav Parter, Eylon Yogev. 1673-1692 [doi]
• Distributed Algorithms Made Secure: A Graph Theoretic ApproachMerav Parter, Eylon Yogev. 1693-1710 [doi]
• Interval Vertex Deletion Admits a Polynomial KernelAkanksha Agrawal, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. 1711-1730 [doi]
• Losing Treewidth by Separating SubsetsAnupam Gupta, Euiwoong Lee, Jason Li, Pasin Manurangsi, Michal Wlodarczyk 0001. 1731-1749 [doi]
• On r-Simple k-Path and Related Problems Parameterized by k/rGregory Z. Gutin, Magnus Wahlström, Meirav Zehavi. 1750-1769 [doi]
• A time- and space-optimal algorithm for the many-visits TSPAndré Berger, László Kozma 0002, Matthias Mnich, Roland Vincze. 1770-1782 [doi]
• Quantum Speedups for Exponential-Time Dynamic Programming AlgorithmsAndris Ambainis, Kaspars Balodis, Janis Iraids, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs. 1783-1793 [doi]
• Optimal Las Vegas Approximate Near Neighbors in ℓpAlexander Wei. 1794-1813 [doi]
• The Andoni-Krauthgamer-Razenshteyn characterization of sketchable norms fails for sketchable metricsSubhash Khot, Assaf Naor. 1814-1824 [doi]
• Tight Bounds for ℓp Oblivious Subspace EmbeddingsRuosong Wang, David P. Woodruff. 1825-1843 [doi]
• Optimal Lower Bounds for Distributed and Streaming Spanning Forest ComputationJelani Nelson, Huacheng Yu. 1844-1860 [doi]
• Communication-Rounds Tradeoffs for Common Randomness and Secret Key GenerationMadhu Sudan, Badih Ghazi, Noah Golowich, Mitali Bafna. 1861-1871 [doi]
• Deterministically Maintaining a (2 + ∊)-Approximate Minimum Vertex Cover in O(1/∊2) Amortized Update TimeSayan Bhattacharya, Janardhan Kulkarni. 1872-1885 [doi]
• (1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized TimeFabrizio Grandoni 0001, Stefano Leonardi, Piotr Sankowski, Chris Schwiegelshohn, Shay Solomon. 1886-1898 [doi]
• A Deamortization Approach for Dynamic Spanner and Dynamic Maximal MatchingAaron Bernstein, Sebastian Forster, Monika Henzinger. 1899-1918 [doi]
• Fully Dynamic Maximal Independent Set with Sublinear in n Update TimeSepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon. 1919-1936 [doi]
• Dynamic Edge Coloring with Improved ApproximationRan Duan, Haoqing He, Tianyi Zhang. 1937-1945 [doi]
• Prophet Secretary Through Blind StrategiesJose Correa, Raimundo Saona, Bruno Ziliotto. 1946-1961 [doi]
• Pricing for Online Resource Allocation: Intervals and PathsShuchi Chawla 0001, J. Benjamin Miller, Yifeng Teng. 1962-1981 [doi]
• An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching ProblemRebecca Reiffenhäuser. 1982-1993 [doi]
• Fully Polynomial-Time Approximation Schemes for Fair Rent DivisionEshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi. 1994-2013 [doi]
• Communication Complexity of Discrete Fair DivisionBenjamin Plaut, Tim Roughgarden. 2014-2033 [doi]
• The I/O complexity of Toom-Cook integer multiplicationGianfranco Bilardi, Lorenzo De Stefani. 2034-2052 [doi]
• I/O-Efficient Algorithms for Topological Sort and Related ProblemsNairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang. 2053-2070 [doi]
• On the Structure of Unique Shortest Paths in GraphsGreg Bodwin. 2071-2089 [doi]
• Near Optimal Algorithms For The Single Source Replacement Paths ProblemShiri Chechik, Sarel Cohen. 2090-2109 [doi]
• Exact Distance Oracles for Planar Graphs with Failing VerticesPanagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka. 2110-2123 [doi]
• Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]Irit Dinur, Yuval Filmus, Prahladh Harsha. 2124-2133 [doi]
• List Decoding with Double SamplersIrit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma. 2134-2153 [doi]
• Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy paritiesSivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin. 2154-2170 [doi]
• Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating AlgorithmsYeow Meng Chee, Duc Tu Dao, Han Mao Kiah, San Ling, Hengjia Wei. 2171-2184 [doi]
• Synchronization Strings: Highly Efficient Deterministic Constructions over Small AlphabetsKuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu. 2185-2204 [doi]
• The Complexity of Approximately Counting RetractionsJacob Focke, Leslie Ann Goldberg, Stanislav Zivny. 2205-2215 [doi]
• Improved Bounds for Randomly Sampling Colorings via Linear ProgrammingSitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle. 2216-2234 [doi]
• Algorithms for #BIS-hard problems on expander graphsMatthew Jenssen, Peter Keevash, Will Perkins. 2235-2247 [doi]
• Approximability of the Six-vertex ModelJin-yi Cai, Tianyu Liu, Pinyan Lu. 2248-2261 [doi]
• Zeros of Holant problems: locations and algorithmsHeng Guo 0001, Chao Liao, Pinyan Lu, Chihao Zhang. 2262-2278 [doi]
• On Facility Location with General Lower BoundsShi Li. 2279-2290 [doi]
• Hierarchical Clustering better than Average-LinkageMoses Charikar, Vaggos Chatziafratis, Rad Niazadeh. 2291-2304 [doi]
• The threshold for SDP-refutation of random regular NAE-3SATYash Deshpande, Andrea Montanari, Ryan O'Donnell, Tselil Schramm, Subhabrata Sen. 2305-2321 [doi]
• Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity ConesPrasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz. 2322-2332 [doi]
• Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity gamesWojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys. 2333-2349 [doi]
• Theorems of Carathéodory, Helly, and Tverberg without dimensionKarim A. Adiprasito, Imre Bárány, Nabil H. Mustafa. 2350-2360 [doi]
• On the Spanning and Routing Ratio of Theta-FourProsenjit Bose, Jean-Lou De Carufel, Darryl Hill, Michiel H. M. Smid. 2361-2370 [doi]
• Greedy spanners are optimal in doubling metricsGlencora Borradaile, Hung Le, Christian Wulff-Nilsen. 2371-2379 [doi]
• Viewing the Rings of a Tree: Minimum Distortion Embeddings into TreesAmir Nayyeri, Benjamin Raichel. 2380-2399 [doi]
• Minimizing Interference Potential Among Moving EntitiesDaniel Busto, William S. Evans, David G. Kirkpatrick. 2400-2418 [doi]
• Can We Overcome the n log n Barrier for Oblivious Sorting?Wei-Kai Lin, Elaine Shi, Tiancheng Xie. 2419-2438 [doi]
• Lower Bounds for Oblivious Data StructuresRiko Jacob, Kasper Green Larsen, Jesper Buus Nielsen. 2439-2447 [doi]
• Foundations of Differentially Oblivious AlgorithmsT.-H. Hubert Chan, Kai-Min Chung, Bruce M. Maggs, Elaine Shi. 2448-2467 [doi]
• Amplification by Shuffling: From Local to Central Differential Privacy via AnonymityÚlfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Kunal Talwar, Abhradeep Thakurta. 2468-2479 [doi]
• Towards Instance-Optimal Private Query ReleaseJaroslaw Blasiok, Mark Bun, Aleksandar Nikolov, Thomas Steinke. 2480-2497 [doi]
• Non-empty Bins with Simple Tabulation HashingAnders Aamand, Mikkel Thorup. 2498-2512 [doi]
• Derandomized Balanced AllocationXue Chen. 2513-2526 [doi]
• Optimal Ball RecyclingMichael A. Bender, Jake Christensen, Alex Conway, Martin Farach-Colton, Rob Johnson, Meng-Tsung Tsai. 2527-2546 [doi]
• A Fourier-Analytic Approach for the Discrepancy of Random Set SystemsRebecca Hoberg, Thomas Rothvoss. 2547-2556 [doi]
• On the discrepancy of random low degree set systemsNikhil Bansal, Raghu Meka. 2557-2564 [doi]
• Optimal Lower Bounds for Sketching Graph CutsCharles Carlson, Alexandra Kolla, Nikhil Srivastava, Luca Trevisan. 2565-2569 [doi]
• Spectral Sparsification of HypergraphsTasuku Soma, Yuichi Yoshida. 2570-2581 [doi]
• Cheeger Inequalities for Submodular TransformationsYuichi Yoshida. 2582-2601 [doi]
• Short Cycles via Low-Diameter DecompositionsYang P. Liu, Sushant Sachdeva, Zejun Yu. 2602-2615 [doi]
• Expander Decomposition and Pruning: Faster, Stronger, and SimplerThatchaphol Saranurak, Di Wang. 2616-2635 [doi]
• 3 with ApplicationsBoris Aronov, Esther Ezra, Joshua Zahl. 2636-2648 [doi]
• 3 EfficientlyTamal K. Dey. 2649-2662 [doi]
• Hardness of Approximation for Morse MatchingUlrich Bauer, Abhishek Rathod. 2663-2674 [doi]
• Improved Topological Approximations by DigitizationAruni Choudhary, Michael Kerber, Sharath Raghvendra. 2675-2688 [doi]
• Full Tilt: Universal Constructors for General Shapes with Uniform External ForcesJose Balanza-Martinez, Austin Luchsinger, David Caballero, Rene Reyes, Angel A. Cantu, Robert T. Schweller, Luis Angel Garcia, Tim Wylie. 2689-2708 [doi]
• Dimension-independent Sparse Fourier TransformMichael Kapralov, Ameya Velingker, Amir Zandieh. 2709-2728 [doi]
• Adaptive Sparse Recovery with Limited AdaptivityAkshay Kamath, Eric Price. 2729-2744 [doi]
• Efficient Algorithms and Lower Bounds for Robust Linear RegressionIlias Diakonikolas, Weihao Kong, Alistair Stewart. 2745-2754 [doi]
• High-Dimensional Robust Mean Estimation in Nearly-Linear TimeYu Cheng 0002, Ilias Diakonikolas, Rong Ge 0001. 2755-2771 [doi]
• Relative Error Tensor Low Rank ApproximationZhao Song, David P. Woodruff, Peilin Zhong. 2772-2789 [doi]
• Popular Matchings and Limits to TractabilityYuri Faenza, Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang. 2790-2809 [doi]
• Popular Matching in Roommates Setting is NP-hardSushmita Gupta, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. 2810-2822 [doi]
• A (1 + 1/e)-Approximation Algorithm for Maximum Stable Matching with One-Sided Ties and Incomplete ListsChi-Kit Lam, C. Gregory Plaxton. 2823-2840 [doi]
• Beating Greedy for Stochastic Bipartite MatchingBuddhima Gamlath, Sagar Kale, Ola Svensson. 2841-2854 [doi]
• Stochastic Matching with Few Queries: New Algorithms and ToolsSoheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani. 2855-2874 [doi]
• Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online ModelZhiyi Huang 0002, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, Yuhao Zhang. 2875-2886 [doi]
• SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One DimensionKevin Buchin, Tim Ophelders, Bettina Speckmann. 2887-2901 [doi]
• Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid ReachabilityKarl Bringmann, Marvin Künnemann, André Nusser. 2902-2921 [doi]
• Approximating (k, ℓ)-center clustering for curvesKevin Buchin, Anne Driemel, Joachim Gudmundsson, Michael Horton, Irina Kostitsyna, Maarten Löffler, Martijn Struijs. 2922-2938 [doi]
• Analysis of Ward's MethodAnna Großwendt, Heiko Röglin, Melanie Schmidt 0001. 2939-2957 [doi]
• Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANSZachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour. 2958-2972 [doi]