Abstract is missing.
- Practical and Provably Secure Onion RoutingMegumi Ando, Anna Lysyanskaya, Eli Upfal. [doi]
- Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random ArrivalsZhiyi Huang 0002, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang. [doi]
- The Isomorphism Problem for Finite Extensions of Free Groups Is In PSPACEGéraud Sénizergues, Armin Weiß. [doi]
- Topological Sorting with Regular ConstraintsAntoine Amarilli, Charles Paperman. [doi]
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple StreamsShay Golan, Tsvi Kopelowitz, Ely Porat. [doi]
- An Operational Characterization of Mutual Information in Algorithmic Information TheoryAndrei E. Romashchenko, Marius Zimand. [doi]
- (Delta+1) Coloring in the Congested Clique ModelMerav Parter. [doi]
- Brief Announcement: Approximation Schemes for Geometric Coverage ProblemsSteven Chaplick, Minati De, Alexander Ravsky, Joachim Spoerhase. [doi]
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász PartitionL. Sunil Chandran, Yun Kuen Cheung, Davis Issac. [doi]
- Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-MedianDeeparnab Chakrabarty, Chaitanya Swamy. [doi]
- Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPCNavneet Agarwal, Sanat Anand, Manoj Prabhakaran. [doi]
- Rollercoasters and CaterpillarsTherese C. Biedl, Ahmad Biniaz, Robert Cummings, Anna Lubiw, Florin Manea, Dirk Nowotka, Jeffrey Shallit. [doi]
- Efficient Black-Box Reductions for Separable Cost SharingTobias Harks, Martin Hoefer, Anja Huber, Manuel Surek. [doi]
- A Polynomial Time Algorithm to Compute Geodesics in CAT(0) Cubical ComplexesKoyo Hayashi. [doi]
- Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded ChannelsJeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou. [doi]
- The Beta-Bernoulli process and algebraic effectsSam Staton, Dario Stein, Hongseok Yang, Nathanael Leedom Ackerman, Cameron E. Freer, Daniel M. Roy 0001. [doi]
- Algorithms for Noisy Broadcast with ErasuresOfer Grossman, Bernhard Haeupler, Sidhanth Mohanty. [doi]
- Fully-Dynamic Bin Packing with Little RepackingBjörn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar, Sören Riechers, David Wajc. [doi]
- Brief Announcement: Zero-Knowledge Protocols for Search ProblemsBen Berger, Zvika Brakerski. [doi]
- New algorithms for Steiner tree reoptimizationDavide Bilò. [doi]
- Lovász Meets Weisfeiler and LemanHolger Dell, Martin Grohe, Gaurav Rattan. [doi]
- Brief Announcement: Give Me Some Slack: Efficient Network MeasurementsRan Ben-Basat, Gil Einziger, Roy Friedman. [doi]
- 2-subshiftsAnaël Grandjean, Benjamin Hellouin de Menibus, Pascal Vanier. [doi]
- Quasi-PTAS for Scheduling with Precedences using LP HierarchiesShashwat Garg. [doi]
- Finding Branch-Decompositions of Matroids, Hypergraphs, and MoreJisu Jeong, Eun Jung Kim 0002, Sang-il Oum. [doi]
- Ring Packing and Amortized FHEW BootstrappingDaniele Micciancio, Jessica Sorrell. [doi]
- Geodesic Obstacle Representation of GraphsProsenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi 0001, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira. [doi]
- The Unfortunate-Flow ProblemOrna Kupferman, Gal Vardi. [doi]
- Parameterized Low-Rank Binary Matrix ApproximationFedor V. Fomin, Petr A. Golovach, Fahad Panolan. [doi]
- Power of d Choices with Simple TabulationAnders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup. [doi]
- Optimally Sorting Evolving DataJuan José Besa Vial, William E. Devanny, David Eppstein, Michael T. Goodrich, Timothy Johnson. [doi]
- Greedy Algorithms for Online Survivable Network DesignSina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin. [doi]
- Spectrally Robust Graph IsomorphismAlexandra Kolla, Ioannis Koutis, Vivek Madan, Ali Kemal Sinop. [doi]
- Improved Time Bounds for All Pairs Non-decreasing Paths in General DigraphsRan Duan, Yong Gu, Le Zhang. [doi]
- Finding Cliques in Social Networks: A New Distribution-Free ModelJacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein. [doi]
- Uniform Mixed Equilibria in Network Congestion Games with Link FailuresVittorio Bilò, Luca Moscardelli, Cosimo Vinci. [doi]
- Price of Anarchy for Mechanisms with Risk-Averse AgentsThomas Kesselheim, Bojana Kodric. [doi]
- Demand-Independent Optimal TollsRiccardo Colini-Baldeschi, Max Klimm, Marco Scarsini. [doi]
- Optimal Hashing in External MemoryAlexander Conway, Martin Farach-Colton, Philip Shilane. [doi]
- Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner NetworkAmy Babay, Michael Dinitz, Zeyu Zhang. [doi]
- Unboundedness Problems for Languages of Vector Addition SystemsWojciech Czerwinski, Piotr Hofman, Georg Zetzsche. [doi]
- Noise-Tolerant Testing of High Entanglement of FormationRotem Arnon Friedman, Henry Yuen. [doi]
- Non-Preemptive Flow-Time Minimization via RejectionsAnupam Gupta, Amit Kumar, Jason Li. [doi]
- Semi-Supervised Algorithms for Approximately Optimal and Accurate ClusteringBuddhima Gamlath, Sangxia Huang, Ola Svensson. [doi]
- CacheShuffle: A Family of Oblivious ShufflesSarvar Patel, Giuseppe Persiano, Kevin Yeo. [doi]
- Fine-Grained Derandomization: From Problem-Centric to Resource-Centric ComplexityMarco L. Carmosino, Russell Impagliazzo, Manuel Sabin. [doi]
- Ranking with Fairness ConstraintsL. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi. [doi]
- Additive Non-Approximability of Chromatic Number in Proper Minor-Closed ClassesZdenek Dvorák, Ken-ichi Kawarabayashi. [doi]
- ARRIVAL: Next Stop in CLSBernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král 0002, Hagar Mosaad, Veronika Slívová. [doi]
- Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional AlgorithmsMoab Arar, Shiri Chechik, Sarel Cohen, Cliff Stein, David Wajc. [doi]
- Brief Announcement: Energy Constrained Depth First SearchShantanu Das 0001, Dariusz Dereniowski, Przemyslaw Uznanski. [doi]
- A Polynomial-Time Approximation Algorithm for All-Terminal Network ReliabilityHeng Guo 0001, Mark Jerrum. [doi]
- Stable-Matching Voronoi Diagrams: Combinatorial Complexity and AlgorithmsGill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano. [doi]
- Semicomputable GeometryMathieu Hoyrup, Diego Nava Saucedo, Don M. Stull. [doi]
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular FacesRohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi. [doi]
- Separating Without Any AmbiguityThomas Place, Marc Zeitoun. [doi]
- NC Algorithms for Weighted Planar Perfect Matching and Related ProblemsPiotr Sankowski. [doi]
- Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETHArnab Bhattacharyya, Suprovat Ghoshal, Karthik C. S., Pasin Manurangsi. [doi]
- Union of Hypercubes and 3D Minkowski Sums with Random SizesPankaj K. Agarwal, Haim Kaplan, Micha Sharir. [doi]
- Proportional Approval Voting, Harmonic k-median, and Negative AssociationJaroslaw Byrka, Piotr Skowron, Krzysztof Sornat. [doi]
- Gaifman Normal Forms for Counting Extensions of First-Order LogicDietrich Kuske, Nicole Schweikardt. [doi]
- Privacy Preserving Clustering with ConstraintsClemens Rösner, Melanie Schmidt 0001. [doi]
- A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear FormulasSuryajith Chillara, Nutan Limaye, Srikanth Srinivasan 0001. [doi]
- Approximate Low-Weight Check Codes and Circuit Lower Bounds for Noisy Ground StatesChinmay Nirkhe, Umesh Vazirani, Henry Yuen. [doi]
- Gray Codes and Symmetric ChainsPetr Gregor, Sven Jäger, Torsten Mütze, Joe Sawada, Kaja Wille. [doi]
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and DeletionsBernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik. [doi]
- Sparsity - an Algorithmic Perspective (Invited Paper)Jaroslav Nesetril. [doi]
- Brief Announcement: Treewidth Modulator: Emergency Exit for DFVSDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. [doi]
- Improved Algorithms for Adaptive Compressed SensingVasileios Nakos, Xiaofei Shi, David P. Woodruff, Hongyang Zhang 0001. [doi]
- Lower Bounds by Algorithm Design: A Progress Report (Invited Paper)Richard Ryan Williams. [doi]
- Brief Announcement: MapReduce Algorithms for Massive TreesMohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni. [doi]
- Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic GeometryThomas Bläsius, Cedric Freiberger, Tobias Friedrich 0001, Maximilian Katzmann, Felix Montenegro-Retana, Marianne Thieffry. [doi]
- Eigenvector Computation and Community Detection in Asynchronous Gossip ModelsFrederik Mallmann-Trenn, Cameron Musco, Christopher Musco. [doi]
- High Probability Frequency Moment SketchesSumit Ganguly, David P. Woodruff. [doi]
- Synchronization Strings: List Decoding for Insertions and DeletionsBernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan. [doi]
- A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided ErrorHendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel. [doi]
- Fast Reed-Solomon Interactive Oracle Proofs of ProximityEli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev. [doi]
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate RecoveryAnand Louis, Rakesh Venkat. [doi]
- How Hard Is It to Satisfy (Almost) All Roommates?Jiehua Chen, Danny Hermelin, Manuel Sorge, Harel Yedidsion. [doi]
- A Faster Construction of Greedy Consensus TreesPawel Gawrychowski, Gad M. Landau, Wing-Kin Sung, Oren Weimann. [doi]
- A Note on Two-Colorability of Nonuniform HypergraphsLech Duraj, Grzegorz Gutowski, Jakub Kozik. [doi]
- Bisimulation Invariant Monadic-Second Order Logic in the FiniteAchim Blumensath, Felix Wolf 0002. [doi]
- Orthogonal Point Location and Rectangle Stabbing Queries in 3-dTimothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis. [doi]
- Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order AtomsLorenzo Clemente, Slawomir Lasota. [doi]
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its ConsequencesDirk Nowotka, Aleksi Saarela. [doi]
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic ComputationsDariusz R. Kowalski, Miguel A. Mosteiro. [doi]
- New Approximation Algorithms for (1, 2)-TSPAnna Adamaszek, Matthias Mnich, Katarzyna Paluch. [doi]
- Congestion-Free Rerouting of Flows on DAGsSaeed Akhoondian Amiri, Szymon Dudycz, Stefan Schmid, Sebastian Wiederrecht. [doi]
- Improved Bounds for Shortest Paths in Dense Distance GraphsPawel Gawrychowski, Adam Karczmarz. [doi]
- Generic Single Edge Fault Tolerant Exact Distance OracleManoj Gupta, Aditi Singh. [doi]
- Improved Approximation for Node-Disjoint Paths in Grids with Sources on the BoundaryJulia Chuzhoy, David H. K. Kim, Rachit Nimavat. [doi]
- Almost Sure ProductivityAlejandro Aguirre 0001, Gilles Barthe, Justin Hsu, Alexandra Silva 0001. [doi]
- On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed SurfaceAlbert Atserias, Stephan Kreutzer, Marc Noy. [doi]
- Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse GraphsRan Duan, Kaifeng Lyu, Yuanhang Xie. [doi]
- On Estimating Edit Distance: Alignment, Dimension Reduction, and EmbeddingsMoses Charikar, Ofir Geri, Michael P. Kim, William Kuszmaul. [doi]
- Uniformization Problems for Synchronizations of Automatic Relations on WordsSarah Winter. [doi]
- Computing Tutte PathsAndreas Schmid 0003, Jens M. Schmidt. [doi]
- Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic TimeRan Duan, Hanlin Ren. [doi]
- Brief Announcement: Hamming Distance Completeness and Sparse Matrix MultiplicationDaniel Graf 0001, Karim Labib, Przemyslaw Uznanski. [doi]
- Probability Theory from a Programming Perspective (Invited Paper)Sam Staton. [doi]
- Towards Blackbox Identity Testing of Log-Variate CircuitsMichael A. Forbes, Sumanta Ghosh, Nitin Saxena 0001. [doi]
- Brief Announcement: Towards an Abstract Model of User Retention DynamicsEli Ben-Sasson, Eden Saig. [doi]
- Finer Tight Bounds for Coloring on Clique-WidthMichael Lampis. [doi]
- A PTAS for a Class of Stochastic Dynamic ProgramsHao Fu, Jian Li, Pan Xu. [doi]
- Maximizing Profit with Convex Costs in the Random-order ModelAnupam Gupta, Ruta Mehta, Marco Molinaro. [doi]
- Perfect Simulation of the Hard Disks Model by Partial Rejection SamplingHeng Guo 0001, Mark Jerrum. [doi]
- Approximate Convex Hull of Data StreamsAvrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, Lin F. Yang. [doi]
- Tighter Connections Between Formula-SAT and Shaving LogsAmir Abboud, Karl Bringmann. [doi]
- Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper)Theophanis Hadjistasi, Alexander A. Schwarzmann. [doi]
- Byzantine Gathering in Polynomial TimeSébastien Bouchard, Yoann Dieudonné, Anissa Lamani. [doi]
- The Price of Stability of Weighted Congestion GamesGeorge Christodoulou 0001, Martin Gairing, Yiannis Giannakopoulos, Paul G. Spirakis. [doi]
- Faster Algorithms for Integer Programs with Block StructureFriedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein. [doi]
- Randomized Sliding Window Algorithms for Regular LanguagesMoses Ganardi, Danny Hucke, Markus Lohrey. [doi]
- The Bottleneck Complexity of Secure Multiparty ComputationElette Boyle, Abhishek Jain 0002, Manoj Prabhakaran, Ching-Hua Yu. [doi]
- A Centralized Local Algorithm for the Sparse Spanning Graph ProblemChristoph Lenzen, Reut Levi. [doi]
- On the Complexity of Sampling Vertices Uniformly from a GraphFlavio Chierichetti, Shahrzad Haddadan. [doi]
- Small Bias Requires Large FormulasAndrej Bogdanov. [doi]
- Resynchronizing Classes of Word RelationsMaría Emilia Descotte, Diego Figueira, Gabriele Puppis. [doi]
- A Faster FPTAS for #KnapsackPawel Gawrychowski, Liran Markin, Oren Weimann. [doi]
- Sample-Optimal Identity Testing with High ProbabilityIlias Diakonikolas, Themis Gouleakis, John Peebles, Eric Price. [doi]
- Parameterized Algorithms for Zero Extension and Metric Labelling ProblemsFelix Reidl, Magnus Wahlström. [doi]
- Temporal Vertex Cover with a Sliding Time WindowEleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev. [doi]
- Spanning Trees With Edge Conflicts and Wireless ConnectivityMagnús M. Halldórsson, Guy Kortsarz, Pradipta Mitra, Tigran Tonoyan. [doi]
- A Complete Dichotomy for Complex-Valued Holant^cMiriam Backens. [doi]
- O-Minimal Invariants for Linear LoopsShaull Almagor, Dmitry Chistikov, Joël Ouaknine, James Worrell 0001. [doi]
- An Exponential Separation Between MA and AM Proofs of ProximityTom Gur, Yang P. Liu, Ron D. Rothblum. [doi]
- NP-Hardness of Coloring 2-Colorable Hypergraph with Poly-Logarithmically Many ColorsAmey Bhangale. [doi]
- Resolving SINR Queries in a Dynamic SettingBoris Aronov, Gali Bar-On, Matthew J. Katz. [doi]
- On Computing the Total Variation Distance of Hidden Markov ModelsStefan Kiefer. [doi]
- Polynomial Vector Addition Systems With StatesJérôme Leroux. [doi]
- To Infinity and BeyondInes Klimann. [doi]
- Reducing CMSO Model Checking to Highly Connected GraphsDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh 0001, Meirav Zehavi. [doi]
- Brief Announcement: Bounded-Degree Cut is Fixed-Parameter TractableMingyu Xiao, Hiroshi Nagamochi. [doi]
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous AutomatonMikhail Raskin. [doi]
- Stabilizing Weighted GraphsZhuan Khye Koh, Laura Sanità. [doi]
- Generalized Center Problems with OutliersDeeparnab Chakrabarty, Maryam Negahbani. [doi]
- Revisiting Frequency Moment Estimation in Random Order StreamsVladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang. [doi]
- A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete ConvexityTasuku Soma, Yuichi Yoshida. [doi]
- Reachability Switching GamesJohn Fearnley, Martin Gairing, Matthias Mnich, Rahul Savani. [doi]
- On the Complexity of Infinite Advice StringsGaëtan Douéneau-Tabot. [doi]
- Costs and Rewards in Priced Timed AutomataMartin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan, James Worrell 0001. [doi]
- On the Probe Complexity of Local Computation AlgorithmsUriel Feige, Boaz Patt-Shamir, Shai Vardi. [doi]
- Fully Dynamic Almost-Maximal Matching: Breaking the Polynomial Worst-Case Time BarrierMoses Charikar, Shay Solomon. [doi]
- Approximate Sparse Linear RegressionSariel Har-Peled, Piotr Indyk, Sepideh Mahabadi. [doi]
- First-Order Interpretations of Bounded Expansion ClassesJakub Gajarský, Stephan Kreutzer, Jaroslav Nesetril, Patrice Ossona de Mendez, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk. [doi]
- An Improved Isomorphism Test for Bounded-Tree-Width GraphsMartin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking. [doi]
- Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SATSixue Liu. [doi]
- Load Thresholds for Cuckoo Hashing with Overlapping BlocksStefan Walzer. [doi]
- Edit Distance between Unrooted Trees in Cubic TimeBartlomiej Dudek, Pawel Gawrychowski. [doi]
- Brief Announcement: Bayesian Auctions with Efficient QueriesJing Chen 0001, Bo Li, Yingkai Li, Pinyan Lu. [doi]
- Brief Announcement: Erasure-Resilience Versus Tolerance to ErrorsSofya Raskhodnikova, Nithin M. Varma. [doi]
- Tight Bounds on Online Checkpointing AlgorithmsAchiya Bar-On, Itai Dinur, Orr Dunkelman, Rani Hod, Nathan Keller, Eyal Ronen, Adi Shamir. [doi]
- Reachability and Distances under Multiple ChangesSamir Datta, Anish Mukherjee 0001, Nils Vortmeier, Thomas Zeume. [doi]
- How to Navigate Through Obstacles?Eduard Eiben, Iyad A. Kanj. [doi]
- One-Way Trail OrientationsAnders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg. [doi]
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer ProgramsMartin Koutecký, Asaf Levin, Shmuel Onn. [doi]
- When is Containment Decidable for Probabilistic Automata?Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell 0001. [doi]
- Sublinear Algorithms for MAXCUT and Correlation ClusteringAditya Bhaskara, Samira Daruki, Suresh Venkatasubramanian. [doi]
- Unambiguous Languages Exhaust the Index HierarchyMichal Skrzypczak. [doi]
- Generalized Comparison Trees for Point-Location ProblemsDaniel M. Kane, Shachar Lovett, Shay Moran. [doi]
- Towards Unified Approximate Pattern Matching for Hamming and L_1 DistancePawel Gawrychowski, Przemyslaw Uznanski. [doi]
- Fully Dynamic MIS in Uniformly Sparse GraphsKrzysztof Onak, Baruch Schieber, Shay Solomon, Nicole Wein. [doi]
- On the Identity Problem for the Special Linear Group and the Heisenberg GroupSang-Ki Ko, Reino Niskanen, Igor Potapov. [doi]
- Restricted Max-Min Fair AllocationSiu-Wing Cheng, Yuchen Mao. [doi]
- Strictly Balancing Matrices in Polynomial Time Using Osborne's IterationRafail Ostrovsky, Yuval Rabani, Arman Yousefi. [doi]