Abstract is missing.
- Front Matter [doi]
- Locality-sensitive Hashing without False NegativesRasmus Pagh. 1-9 [doi]
- New directions in nearest neighbor searching with applications to lattice sievingAnja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven. 10-24 [doi]
- n) PebblesYann Disser, Jan Hackfeld, Max Klimm. 25-39 [doi]
- Phase Transitions in Group TestingJonathan Scarlett, Volkan Cevher. 40-53 [doi]
- Tight Bounds for the Distribution-Free Testing of Monotone ConjunctionsXi Chen, Jinyu Xie. 54-71 [doi]
- Designing Networks with Good Equilibria under UncertaintyGeorge Christodoulou 0001, Alkmini Sgouritsa. 72-89 [doi]
- An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu MarketRan Duan, Jugal Garg, Kurt Mehlhorn. 90-106 [doi]
- Characterisation of Strongly Stable MatchingsAdam Kunysz, Katarzyna E. Paluch, Pratik Ghosal. 107-119 [doi]
- Learning and Efficiency in Games with Dynamic PopulationThodoris Lykouris, Vasilis Syrgkanis, Éva Tardos. 120-129 [doi]
- The Complexity of All-switches Strategy ImprovementJohn Fearnley, Rahul Savani. 130-139 [doi]
- Make-to-Order Integrated Scheduling and DistributionYossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi. 140-154 [doi]
- m)-Competitive Algorithm for Online Machine MinimizationLin Chen, Nicole Megow, Kevin Schewior. 155-163 [doi]
- Online Degree-Bounded Steiner Network DesignSina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat. 164-175 [doi]
- Scheduling Parallel DAG Jobs Online to Minimize Average Flow TimeKunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley. 176-189 [doi]
- Online Pricing with Impatient BiddersMarek Cygan, Marcin Mucha, Piotr Sankowski, Qiang Zhang. 190-201 [doi]
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-CutMohsen Ghaffari, Bernhard Haeupler. 202-219 [doi]
- Local-on-Average Distributed TasksMerav Parter, David Peleg, Shay Solomon. 220-239 [doi]
- The Adversarial Noise Threshold for Distributed ProtocolsWilliam M. Hoza, Leonard J. Schulman. 240-258 [doi]
- Expanders via Local Edge FlipsZeyuan Allen Zhu, Aditya Bhaskara, Silvio Lattanzi, Vahab S. Mirrokni, Lorenzo Orecchia. 259-269 [doi]
- An Improved Distributed Algorithm for Maximal Independent SetMohsen Ghaffari. 270-277 [doi]
- Nearly Tight Oblivious Subspace Embeddings by Trace InequalitiesMichael B. Cohen. 278-287 [doi]
- The Restricted Isometry Property of Subsampled Fourier MatricesIshay Haviv, Oded Regev. 288-297 [doi]
- Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard TransformMahdi Cheraghchi, Piotr Indyk. 298-317 [doi]
- k-median sketchingArturs Backurs, Piotr Indyk, Ilya Razenshteyn, David P. Woodruff. 318-337 [doi]
- Simpler, faster and shorter labels for distances in graphsStephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen. 338-350 [doi]
- Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space TradeoffChristian Wulff-Nilsen. 351-362 [doi]
- New Bounds for Approximating Extremal Distances in Undirected GraphsMassimo Cairo, Roberto Grossi, Romeo Rizzi. 363-376 [doi]
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse GraphsAmir Abboud, Virginia Vassilevska Williams, Joshua R. Wang. 377-391 [doi]
- Deterministic Algorithms for Submodular Maximization ProblemsNiv Buchbinder, Moran Feldman. 392-403 [doi]
- k-Submodular Function MaximizationSatoru Iwata, Shin-ichi Tanigawa, Yuichi Yoshida. 404-413 [doi]
- Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular FunctionsAshwinkumar Badanidiyuru, Christos H. Papadimitriou, Aviad Rubinstein, Lior Seeman, Yaron Singer. 414-429 [doi]
- Exact and Approximation Algorithms for Weighted Matroid IntersectionChien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama. 430-444 [doi]
- A Fast Approximation for Maximum Weight Matroid IntersectionChandra Chekuri, Kent Quanrud. 445-457 [doi]
- k-uniform bounded-degree hypergraphsAndreas Galanis, Leslie Ann Goldberg. 458-468 [doi]
- Bounds for Random Constraint Satisfaction Problems via Spatial CouplingDimitris Achlioptas, Seyed Hamed Hassani, Nicolas Macris, Rüdiger L. Urbanke. 469-479 [doi]
- Evolutionary Dynamics in Finite Populations Mix RapidlyIoannis Panageas, Piyush Srivastava, Nisheeth K. Vishnoi. 480-497 [doi]
- 2Antonio Blanca, Alistair Sinclair. 498-513 [doi]
- Canonical Paths for MCMC: from Art to ScienceLingxiao Huang, Pinyan Lu, Chihao Zhang. 514-527 [doi]
- Towards Optimal Algorithms for Prediction with Expert AdviceNick Gravin, Yuval Peres, Balasubramanian Sivan. 528-547 [doi]
- Sparse Approximation via Generating Point SetsAvrim Blum, Sariel Har-Peled, Benjamin Raichel. 548-557 [doi]
- p Regression with Randomized PreconditioningJiyan Yang, Yinlam Chow, Christopher Ré, Michael W. Mahoney. 558-569 [doi]
- Non-convex Compressed Sensing with the Sum-of-Squares MethodTasuku Soma, Yuichi Yoshida. 570-579 [doi]
- Jointly Private Convex ProgrammingJustin Hsu, Zhiyi Huang 0002, Aaron Roth, Zhiwei Steven Wu. 580-599 [doi]
- Time vs. Information Tradeoffs for Leader Election in Anonymous TreesChristian Glacet, Avery Miller, Andrzej Pelc. 600-609 [doi]
- Markovian Hitters and the Complexity of Blind RendezvousSixia Chen, Matthew Dippel, Alexander Russell, Abhishek Samanta, Ravi Sundaram. 610-619 [doi]
- Stabilizing Consensus with Many OpinionsLuca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan. 620-635 [doi]
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and RobustnessMichael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young. 636-654 [doi]
- Balanced Allocation: Patience is not a VirtueJohn Augustine, William K. Moses Jr., Amanda Redlich, Eli Upfal. 655-671 [doi]
- Weighted dynamic finger in binary search treesJohn Iacono, Stefan Langerman. 672-691 [doi]
- Faster Fully Dynamic Matchings with Small Approximation RatiosAaron Bernstein, Cliff Stein. 692-711 [doi]
- Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive ApproachDavid Peleg, Shay Solomon. 712-729 [doi]
- m) barrierSurender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, Shahbaz Khan 0004. 730-739 [doi]
- On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case CostsIttai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck. 740-753 [doi]
- Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling MetricsT.-H. Hubert Chan, Shaofeng H.-C. Jiang. 754-765 [doi]
- Clustering time series under the Fréchet distanceAnne Driemel, Amer Krivosija, Christian Sohler. 766-785 [doi]
- k open facilitiesShi Li. 786-796 [doi]
- Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway CutChandra Chekuri, Vivek Madan. 797-807 [doi]
- Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxationChandra Chekuri, Vivek Madan. 808-820 [doi]
- Approximating Low-Stretch SpannersMichael Dinitz, Zeyu Zhang. 821-840 [doi]
- Error Amplification for Pairwise Spanner Lower BoundsAmir Abboud, Greg Bodwin. 841-854 [doi]
- Better Distance Preservers and Additive SpannersGreg Bodwin, Virginia Vassilevska Williams. 855-872 [doi]
- On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average DistortionYair Bartal, Arnold Filtser, Ofer Neiman. 873-882 [doi]
- Near-Optimal Light SpannersShiri Chechik, Christian Wulff-Nilsen. 883-892 [doi]
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fieldsJean-François Biasse, Fang Song. 893-902 [doi]
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta TestingAndris Ambainis, Aleksandrs Belovs, Oded Regev, Ronald de Wolf. 903-922 [doi]
- Permutation patterns are hard to countScott Garrabrant, Igor Pak. 923-936 [doi]
- Computing in continuous space with self-assembling polygonal tiles (extended abstract)Oscar Gilbert, Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers. 937-956 [doi]
- Beyond the Richter-Thomassen ConjectureJános Pach, Natan Rubin, Gábor Tardos. 957-968 [doi]
- Treetopes and their GraphsDavid Eppstein. 969-984 [doi]
- Windrose Planarity: Embedding Graphs with Direction-Constrained EdgesPatrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Valentino Di Donato, Philipp Kindermann, Günter Rote, Ignaz Rutter. 985-996 [doi]
- Multiscale Mapper: Topological Summarization via Codomain CoversTamal K. Dey, Facundo Mémoli, Yusu Wang. 997-1013 [doi]
- Online Contention Resolution SchemesMoran Feldman, Ola Svensson, Rico Zenklusen. 1014-1033 [doi]
- Finding a Stable Allocation in Polymatroid IntersectionSatoru Iwata, Yu Yokoi. 1034-1047 [doi]
- An Improved Approximation Guarantee for the Maximum Budgeted Allocation ProblemChristos Kalaitzis. 1048-1066 [doi]
- The matching problem has no small symmetric SDPGábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink. 1067-1078 [doi]
- On the Integrality Gap of Degree-4 Sum of Squares for Planted CliqueSamuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm. 1079-1095 [doi]
- Linear Recognition of Almost Interval GraphsYixin Cao. 1096-1115 [doi]
- Subexponential parameterized algorithm for Interval CompletionIvan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk. 1116-1131 [doi]
- Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problemsIvan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach, Michal Pilipczuk. 1132-1151 [doi]
- Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher GuaranteeShivam Garg, Geevarghese Philip. 1152-1166 [doi]
- W[1]-hard, even for four terminal pairsMarcin Pilipczuk, Magnus Wahlström. 1167-1178 [doi]
- An Efficient Algorithm for Computing High-Quality Paths amid Polygonal ObstaclesPankaj K. Agarwal, Kyle Fox, Oren Salzman. 1179-1192 [doi]
- k-Level in Three-Dimensional Plane ArrangementsSariel Har-Peled, Haim Kaplan, Micha Sharir. 1193-1212 [doi]
- Improved Deterministic Algorithms for Linear Programming in Low DimensionsTimothy M. Chan. 1213-1219 [doi]
- A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning TreesSunil Arya, David M. Mount. 1220-1233 [doi]
- Persistent Homology and Nested DissectionMichael Kerber, Donald R. Sheehy, Primoz Skraba. 1234-1245 [doi]
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-SmolenskyTimothy M. Chan, Ryan Williams. 1246-1255 [doi]
- Subtree Isomorphism RevisitedAmir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir. 1256-1271 [doi]
- Higher Lower Bounds from the 3SUM ConjectureTsvi Kopelowitz, Seth Pettie, Ely Porat. 1272-1287 [doi]
- A Faster Subquadratic Algorithm for Finding Outlier CorrelationsMatti Karppa, Petteri Kaski, Jukka Kohonen. 1288-1305 [doi]
- Algorithmic Complexity of Power Law NetworksPawel Brach, Marek Cygan, Jakub Lacki, Piotr Sankowski. 1306-1325 [doi]
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph StreamsRajesh Chitnis, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Andrew McGregor, Morteza Monemizadeh, Sofya Vorotnikova. 1326-1344 [doi]
- Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication ModelSepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev. 1345-1364 [doi]
- Incidence Geometries and the Pass Complexity of Semi-Streaming Set CoverAmit Chakrabarti, Anthony Wirth. 1365-1373 [doi]
- Clustering Problems on Sliding WindowsVladimir Braverman, Harry Lang, Keith Levin, Morteza Monemizadeh. 1374-1390 [doi]
- Gowers Norm, Function Limits, and Parameter EstimationYuichi Yoshida. 1391-1406 [doi]
- On the Economic Efficiency of the Combinatorial Clock AuctionNicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta. 1407-1423 [doi]
- Approximately Efficient Double Auctions with Strong Budget BalanceRiccardo Colini-Baldeschi, Bart de Keijzer, Stefano Leonardi, Stefano Turchetta. 1424-1443 [doi]
- Interpolating Between Truthful and non-Truthful Mechanisms for Combinatorial AuctionsMark Braverman, Jieming Mao, S. Matthew Weinberg. 1444-1457 [doi]
- On the Complexity of Dynamic Mechanism DesignChristos H. Papadimitriou, George Pierrakos, Christos-Alexandros Psomas, Aviad Rubinstein. 1458-1475 [doi]
- Simple Pricing Schemes For Consumers With Evolving ValuesShuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, Balasubramanian Sivan. 1476-1490 [doi]
- On approximating strip packing with a better ratio than 3/2Giorgi Nadiradze, Andreas Wiese. 1491-1510 [doi]
- Packing Small VectorsYossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman. 1511-1525 [doi]
- Approximation schemes for machine scheduling with resource (in-)dependent processing timesKlaus Jansen, Marten Maack, Malin Rau. 1526-1542 [doi]
- Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite ExpandersXue Chen. 1543-1560 [doi]
- Improved Approximation for Vector Bin PackingNikhil Bansal, Marek Eliás, Arindam Khan 0001. 1561-1579 [doi]
- Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjectureGuillaume Chapuy, Guillem Perarnau. 1580-1588 [doi]
- Recovery and Rigidity in a Regular Stochastic Block ModelGerandy Brito, Ioana Dumitriu, Shirshendu Ganguly, Christopher Hoffman, Linh V. Tran. 1589-1601 [doi]
- Distance in the Forest Fire Model How far are you from Eve?Varun Kanade, Reut Levi, Zvi Lotker, Frederik Mallmann-Trenn, Claire Mathieu. 1602-1620 [doi]
- Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract)Constantinos Daskalakis, Sebastien Roch. 1621-1630 [doi]
- The Power of Two Choices with Simple TabulationSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, Mikkel Thorup. 1631-1642 [doi]
- Tight Bounds for Graph Homomorphism and Subgraph IsomorphismMarek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala. 1643-1649 [doi]
- Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genusRadu Curticapean, Dániel Marx. 1650-1669 [doi]
- Discovering Archipelagos of Tractability for Constraint Satisfaction and CountingRobert Ganian, M. S. Ramanujan, Stefan Szeider. 1670-1681 [doi]
- k-ArborescencesAttila Bernáth, Tamás Király. 1682-1694 [doi]
- Constructive algorithm for path-width of matroidsJisu Jeong, Eun Jung Kim 0002, Sang-il Oum. 1695-1704 [doi]
- Approximation of non-boolean 2CSPGuy Kindler, Alexandra Kolla, Luca Trevisan. 1705-1714 [doi]
- An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in PolyhedraRobert Hildebrand, Robert Weismantel, Kevin Zemmer. 1715-1723 [doi]
- Nearly Optimal NP-Hardness of Unique CoverageVenkatesan Guruswami, Euiwoong Lee. 1724-1730 [doi]
- Algorithms and Adaptivity Gaps for Stochastic ProbingAnupam Gupta, Viswanath Nagarajan, Sahil Singla. 1731-1747 [doi]
- Discrete Gaussian Sampling Reduces to CVP and SVPNoah Stephens-Davidowitz. 1748-1764 [doi]
- An Algorithmic Hypergraph Regularity LemmaBrendan Nagle, Vojtech Rödl, Mathias Schacht. 1765-1773 [doi]
- Obstructions for three-coloring graphs with one forbidden induced subgraphMaria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong. 1774-1783 [doi]
- 6-free GraphsDaniel Lokshtanov, Marcin Pilipczuk, Erik Jan van Leeuwen. 1784-1803 [doi]
- Sparsity and dimensionGwenaël Joret, Piotr Micek, Veit Wiechert. 1804-1813 [doi]
- Finding Perfect Matchings in Bipartite HypergraphsChidambaram Annamalai. 1814-1823 [doi]
- Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP SolverZeyuan Allen Zhu, Yin Tat Lee, Lorenzo Orecchia. 1824-1831 [doi]
- How to Round Subspaces: A New Spectral Clustering AlgorithmAli Kemal Sinop. 1832-1847 [doi]
- Improved Cheeger's Inequality and Analysis of Local Graph Partitioning using Vertex Expansion and Expansion ProfileTsz Chiu Kwok, Lap Chi Lau, Yin Tat Lee. 1848-1861 [doi]
- n)) TimeRichard Peng. 1862-1867 [doi]
- Natural Algorithms for Flow ProblemsDamian Straszak, Nisheeth K. Vishnoi. 1868-1883 [doi]
- Efficient Low-Redundancy Codes for Correcting Multiple DeletionsJoshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky. 1884-1892 [doi]
- An improved bound on the fraction of correctable deletionsBoris Bukh, Venkatesan Guruswami. 1893-1901 [doi]
- Communication Complexity of Permutation-Invariant FunctionsBadih Ghazi, Pritish Kamath, Madhu Sudan. 1902-1921 [doi]
- Towards Optimal Deterministic Coding for Interactive CommunicationRan Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson. 1922-1936 [doi]
- Robust positioning patternsRoss Berkowitz, Swastik Kopparty. 1937-1951 [doi]
- Sampling on Lattices with Free Boundary Conditions Using Randomized ExtensionsSarah Cannon, Dana Randall. 1952-1971 [doi]
- On the switch Markov chain for perfect matchingsMartin E. Dyer, Mark Jerrum, Haiko Müller. 1972-1983 [doi]
- Partial Resampling to Approximate Covering Integer ProgramsAntares Chen, David G. Harris, Aravind Srinivasan. 1984-2003 [doi]
- Algorithmic and Enumerative Aspects of the Moser-Tardos DistributionDavid G. Harris, Aravind Srinivasan. 2004-2023 [doi]
- Focused Stochastic Local Search and the Lovász Local LemmaDimitris Achlioptas, Fotis Iliopoulos. 2024-2038 [doi]
- k-mismatch problem revisitedRaphaël Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana A. Starikovskaya. 2039-2052 [doi]
- Range Predecessor and Lempel-Ziv ParsingDjamal Belazzougui, Simon J. Puglisi. 2053-2071 [doi]
- Communication with Contextual UncertaintyBadih Ghazi, Ilan Komargodski, Pravesh Kothari, Madhu Sudan. 2072-2085 [doi]
- u, v)-trailsRoss Churchley, Bojan Mohar, Hehui Wu. 2086-2094 [doi]
- On the maximum quartet distance between phylogenetic treesNoga Alon, Humberto Naves, Benny Sudakov. 2095-2106 [doi]