Abstract is missing.
- Hardness of ApproximationSubhash Khot. [doi]
- Leader Election in Unreliable Radio NetworksMohsen Ghaffari, Calvin C. Newport. [doi]
- A Fast Distributed Stateless Algorithm for alpha-Fair Packing ProblemsJelena Marasevic, Clifford Stein, Gil Zussman. [doi]
- Mixing Time of Markov Chains, Dynamical Systems and EvolutionIoannis Panageas, Nisheeth K. Vishnoi. [doi]
- Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) TimeMichael W. Mahoney, Satish Rao, Di Wang, Peng Zhang. [doi]
- The Complexity of Rational SynthesisRodica Condurache, Emmanuel Filiot, Raffaella Gentilini, Jean-François Raskin. [doi]
- Front Matter, Table of Contents, Preface, Organization, List of Authors [doi]
- The Complexity of Downward Closure ComparisonsGeorg Zetzsche. [doi]
- The Non-Uniform k-Center ProblemDeeparnab Chakrabarty, Prachi Goyal, Ravishankar Krishnaswamy. [doi]
- Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to TimePetra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling. [doi]
- Bootstrap Percolation on Geometric Inhomogeneous Random GraphsChristoph Koch 0006, Johannes Lengler. [doi]
- On the Sensitivity ConjectureAvishay Tal. [doi]
- Past, Present, and Infinite FutureThomas Wilke. [doi]
- Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by TreewidthDániel Marx, Valia Mitsou. [doi]
- Near Optimal Adjacency Labeling Schemes for Power-Law GraphsCasper Petersen, Noy Rotbart, Jakob Grue Simonsen, Christian Wulff-Nilsen. [doi]
- A Program Logic for Union BoundsGilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub. [doi]
- Power of Quantum Computation with Few Clean QubitsKeisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, Seiichiro Tani. [doi]
- Semi-Streaming Algorithms for Annotated Graph StreamsJustin Thaler. [doi]
- Carpooling in Social NetworksAmos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, Rotem Zach. [doi]
- Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric InequalitiesYitong Yin. [doi]
- Information Complexity Is ComputableMark Braverman, Jon Schneider. [doi]
- Approximating Directed Steiner Problems via Tree EmbeddingBundit Laekhanukit. [doi]
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of HardnessHubie Chen. [doi]
- Semi-Streaming Algorithms for Annotated Graph StreamsJustin Thaler. [doi]
- A Linear Acceleration Theorem for 2D Cellular Automata on All Complete NeighborhoodsAnaël Grandjean, Victor Poupet. [doi]
- Correlation Decay and Tractability of CSPsJonah Brown-Cohen, Prasad Raghavendra. [doi]
- Online Semidefinite ProgrammingNoa Elad, Satyen Kale, Joseph (Seffi) Naor. [doi]
- A Complexity Trichotomy for Approximately Counting List H-ColouringsAndreas Galanis, Leslie Ann Goldberg, Mark Jerrum. [doi]
- On Isoperimetric Profiles and Computational ComplexityPavel Hrubes, Amir Yehudayoff. [doi]
- Voronoi Choice GamesMeena Boppana, Rani Hod, Michael Mitzenmacher, Tom Morgan. [doi]
- Impossibility of Sketching of the 3D Transportation Metric with Quadratic CostAlexandr Andoni, Assaf Naor, Ofer Neiman. [doi]
- Unified Acceleration Method for Packing and Covering Problems via Diameter ReductionDi Wang, Satish Rao, Michael W. Mahoney. [doi]
- Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple AssumptionsBenoît Libert, Somindu C. Ramanna, Moti Yung. [doi]
- Information Cascades on Arbitrary TopologiesJun Wan, Yu Xia, Liang Li, Thomas Moscibroda. [doi]
- Thin MSO with a Probabilistic Path QuantifierMikolaj Bojanczyk. [doi]
- An Almost Cubic Lower Bound for Depth Three Arithmetic CircuitsNeeraj Kayal, Chandan Saha, Sébastien Tavenas. [doi]
- Random-Edge Is Slower Than Random-Facet on Abstract CubesThomas Dueholm Hansen, Uri Zwick. [doi]
- Composition of Stochastic Transition Systems Based on Spans and CouplingsDaniel Gburek, Christel Baier, Sascha Klüppelholz. [doi]
- Dynamic Graph Stream Algorithms in o(n) SpaceZengfeng Huang, Pan Peng. [doi]
- Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper BoundsYun Kuen Cheung, Gramoz Goranci, Monika Henzinger. [doi]
- Anti-Powers in Infinite WordsGabriele Fici, Antonio Restivo, Manuel Silva, Luca Q. Zamboni. [doi]
- Constraint Satisfaction Problems for Reducts of Homogeneous GraphsManuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz. [doi]
- Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity ViolationH. Gökalp Demirci, Shi Li. [doi]
- Quasimetric Embeddings and Their ApplicationsFacundo Mémoli, Anastasios Sidiropoulos, Vijay Sridhar. [doi]
- Space-Efficient Error Reduction for Unitary Quantum ComputationsBill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura. [doi]
- Supercritical Space-Width Trade-Offs for ResolutionChristoph Berkholz, Jakob Nordström. [doi]
- Faster Deterministic Communication in Radio NetworksArtur Czumaj, Peter Davies. [doi]
- Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut ProblemsTill Fluschnik, Danny Hermelin, André Nichterlein, Rolf Niedermeier. [doi]
- Beating the Harmonic Lower Bound for Online Bin PackingSandy Heydrich, Rob van Stee. [doi]
- Approximation via Correlation Decay When Strong Spatial Mixing FailsIvona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Daniel Stefankovic. [doi]
- AC^0 o MOD_2 Lower Bounds for the Boolean Inner ProductMahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie 0002. [doi]
- Lower Bounds for Nondeterministic Semantic Read-Once Branching ProgramsStephen A. Cook, Jeff Edmonds, Venkatesh Medabalimi, Toniann Pitassi. [doi]
- Discordant Voting Processes on Finite GraphsColin Cooper, Martin E. Dyer, Alan M. Frieze, Nicolas Rivera. [doi]
- Diameter and k-Center in Sliding WindowsVincent Cohen-Addad, Chris Schwiegelshohn, Christian Sohler. [doi]
- Constant Congestion Routing of Symmetric Demands in Planar Directed GraphsChandra Chekuri, Alina Ene, Marcin Pilipczuk. [doi]
- On the Resiliency of Randomized Routing Against Multiple Edge FailuresMarco Chiesa, Andrei V. Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Schapira, Scott Shenker. [doi]
- Do Distributed Differentially-Private Protocols Require Oblivious Transfer?Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, Amit Sahai. [doi]
- Improved Protocols and Hardness Results for the Two-Player Cryptogenography ProblemBenjamin Doerr, Marvin Künnemann. [doi]
- Tight Hardness Results for Maximum Weight RectanglesArturs Backurs, Nishanth Dikkala, Christos Tzamos. [doi]
- Parity Separation: A Scientifically Proven Method for Permanent Weight LossRadu Curticapean. [doi]
- On Word and Frontier Languages of Unsafe Higher-Order GrammarsKazuyuki Asada, Naoki Kobayashi 0001. [doi]
- Incremental 2-Edge-Connectivity in Directed GraphsLoukas Georgiadis, Giuseppe F. Italiano, Nikos Parotsidis. [doi]
- Logic of Local Inference for Contextuality in Quantum Physics and BeyondKohei Kishida. [doi]
- Partition Bound Is Quadratically Tight for Product DistributionsPrahladh Harsha, Rahul Jain 0001, Jaikumar Radhakrishnan. [doi]
- On the Complexity of Grammar-Based Compression over Fixed AlphabetsKatrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, Markus L. Schmid. [doi]
- A Parallel Repetition Theorem for All Entangled GamesHenry Yuen. [doi]
- Popular Half-Integral MatchingsTelikepalli Kavitha. [doi]
- Subexponential Time Algorithms for Embedding H-Minor Free GraphsHans L. Bodlaender, Jesper Nederlof, Tom C. van der Zanden. [doi]
- On Equivalence and Uniformisation Problems for Finite TransducersEmmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter. [doi]
- Optimization Algorithms for Faster Computational GeometryZeyuan Allen Zhu, Zhenyu Liao, Yang Yuan. [doi]
- Distance Labeling Schemes for TreesStephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat. [doi]
- Bicovering: Covering Edges With Two Small Subsets of VerticesAmey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz. [doi]
- On Restricted Nonnegative Matrix FactorizationDmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, James Worrell. [doi]
- The Decidable Properties of Subrecursive FunctionsMathieu Hoyrup. [doi]
- Data Structure Lower Bounds for Document Indexing ProblemsPeyman Afshani, Jesper Sindahl Nielsen. [doi]
- Computation Tree Logic for Synchronization PropertiesKrishnendu Chatterjee, Laurent Doyen 0001. [doi]
- Model Checking and Strategy Synthesis for Stochastic Games: From Theory to PracticeMarta Z. Kwiatkowska. [doi]
- Fast, Robust, Quantizable Approximate ConsensusBernadette Charron-Bost, Matthias Függer, Thomas Nowak. [doi]
- Compute ChoiceDevavrat Shah. [doi]
- Deterministic Time-Space Trade-Offs for k-SUMAndrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, R. Ryan Williams. [doi]
- New Interpretation and Generalization of the Kameda-Weiner MethodHellis Tamm. [doi]
- Approximate Span ProgramsTsuyoshi Ito, Stacey Jeffery. [doi]
- k-Center Clustering Under Perturbation ResilienceMaria-Florina Balcan, Nika Haghtalab, Colin White. [doi]
- Formally Verifying a Compiler: What Does It Mean, Exactly?Xavier Leroy. [doi]
- Randomized Query Complexity of Sabotaged and Composed FunctionsShalev Ben-David, Robin Kothari. [doi]
- The Schützenberger Product for Syntactic SpacesMai Gehrke, Daniela Petrisan, Luca Reggio. [doi]
- On the Hardness of Partially Dynamic Graph Problems and Connections to DiameterSøren Dahlgaard. [doi]
- All-Pairs Approximate Shortest Paths and Distance Oracle PreprocessingChristian Sommer. [doi]
- On Percolation and NP-HardnessHuck Bennett, Daniel Reichman, Igor Shinkar. [doi]
- Deciding the Topological Complexity of Büchi LanguagesMichal Skrzypczak, Igor Walukiewicz. [doi]
- An Improved Analysis of the ER-SpUD Dictionary Learning AlgorithmJaroslaw Blasiok, Jelani Nelson. [doi]
- Towards Tight Lower Bounds for Range Reporting on the RAMAllan Grønlund, Kasper Green Larsen. [doi]
- Rényi Information Complexity and an Information Theoretic Characterization of the Partition BoundManoj M. Prabhakaran, Vinod M. Prabhakaran. [doi]
- A Duality Based 2-Approximation Algorithm for Maximum Agreement ForestFrans Schalekamp, Anke van Zuylen, Suzanne van der Ster. [doi]
- Optimal Approximate Matrix Product in Terms of Stable RankMichael B. Cohen, Jelani Nelson, David P. Woodruff. [doi]
- Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation ComplexityM. Praveen, B. Srivathsan. [doi]
- Linear Time Algorithm for Quantum 2SATItai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang. [doi]
- Boundaries of VP and VNPJoshua A. Grochow, Ketan D. Mulmuley, Youming Qiao. [doi]
- Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of ComputationsOlivier Bournez, Daniel S. Graça, Amaury Pouly. [doi]
- On the Size and the Approximability of Minimum Temporally Connected SubgraphsKyriakos Axiotis, Dimitris Fotakis. [doi]
- A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension OneStefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke. [doi]
- Quasi-4-Connected ComponentsMartin Grohe. [doi]
- Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal CliquesAlessio Conte, Roberto Grossi, Andrea Marino, Luca Versari. [doi]
- Analysing Decisive Stochastic ProcessesNathalie Bertrand 0001, Patricia Bouyer, Thomas Brihaye, Pierre G. Carlier. [doi]
- Randomization Can Be as Helpful as a Glimpse of the Future in Online ComputationJesper W. Mikkelsen. [doi]
- The Complexity Landscape of Fixed-Parameter Directed Steiner Network ProblemsAndreas Emil Feldmann, Dániel Marx. [doi]
- Robust Assignments via Ear Decompositions and Randomized RoundingDavid Adjiashvili, Viktor Bindewald, Dennis Michaels. [doi]
- Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization DelayVolker Diekert, Tobias Walter. [doi]
- Tolerant Testers of Image PropertiesPiotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova. [doi]
- House Markets with Matroid and Knapsack ConstraintsPiotr Krysta, Jinshan Zhang. [doi]
- Algorithmic Complexity for the Realization of an Effective Subshift By a SoficMathieu Sablik, Michael Schraudner. [doi]
- Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization DelayVolker Diekert, Tobias Walter. [doi]
- Networks of ComplementsMoshe Babaioff, Liad Blumrosen, Noam Nisan. [doi]
- Erasure-Resilient Property TestingKashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin M. Varma. [doi]
- Coding for Interactive Communication Correcting Insertions and DeletionsMark Braverman, Ran Gelles, Jieming Mao, Rafail Ostrovsky. [doi]
- Approximation Algorithms for Aversion k-Clustering via Local k-MedianAnupam Gupta, Guru Guruganesh, Melanie Schmidt. [doi]
- On the Skolem Problem for Continuous Linear Dynamical SystemsVentsislav Chonev, Joël Ouaknine, James Worrell. [doi]
- Total Space in Resolution Is at Least Width SquaredIlario Bonacina. [doi]
- Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/CoveringSina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, Saeed Seddighin. [doi]
- An Optimal Dual Fault Tolerant Reachability OracleKeerti Choudhary. [doi]
- Reservation Exchange Markets for Internet AdvertisingGagan Goel, Stefano Leonardi, Vahab S. Mirrokni, Afshin Nikzad, Renato Paes Leme. [doi]
- Block-Wise Non-Malleable CodesNishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, Jalaj Upadhyay. [doi]
- The Landscape of Communication Complexity ClassesMika Göös, Toniann Pitassi, Thomas Watson 0001. [doi]
- The Complexity of Hex and the Jordan Curve TheoremAviv Adler, Constantinos Daskalakis, Erik D. Demaine. [doi]
- Approximate Hamming Distance in a StreamRaphaël Clifford, Tatiana A. Starikovskaya. [doi]
- Relating Graph Thickness to Planar Layers and Bend ComplexityStephane Durocher, Debajyoti Mondal. [doi]
- The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality ReductionKasper Green Larsen, Jelani Nelson. [doi]
- Closing the Gap for Makespan Scheduling via Sparsification TechniquesKlaus Jansen, Kim-Manuel Klein, José Verschae. [doi]
- Sensitivity of Counting QueriesMyrto Arapinis, Diego Figueira, Marco Gaboardi. [doi]
- Approximation Algorithms for Clustering Problems with Lower Bounds and OutliersSara Ahmadian, Chaitanya Swamy. [doi]
- Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization ProblemsAdam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli. [doi]
- Price of Competition and Dueling GamesSina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, Saeed Seddighin. [doi]
- Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue MedianZachary Friggstad, Yifeng Zhang. [doi]
- Proving the Herman-Protocol ConjectureMaria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, James Worrell. [doi]
- Bounds on the Voter Model in Dynamic NetworksPetra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, Frederik Mallmann-Trenn. [doi]
- The Linear Voting ModelColin Cooper, Nicolas Rivera. [doi]
- Analysing Survey Propagation Guided Decimationon Random FormulasSamuel Hetterich. [doi]
- Deciding Piecewise Testable Separability for Regular Tree LanguagesJean Goubault-Larrecq, Sylvain Schmitz. [doi]
- Reachability in Networks of Register Protocols under Stochastic SchedulersPatricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan. [doi]
- The Bridge Between Regular Cost Functions and Omega-Regular LanguagesThomas Colcombet, Nathanaël Fijalkow. [doi]
- Optimal Quantum Algorithm for Polynomial InterpolationAndrew M. Childs, Wim van Dam, Shih-Han Hung, Igor E. Shparlinski. [doi]
- Kernelization of Cycle Packing with Relaxed Disjointness ConstraintsAkanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, Saket Saurabh. [doi]
- Amplifiers for the Moran ProcessAndreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby. [doi]
- Competitive Analysis of Constrained Queueing SystemsSungjin Im, Janardhan Kulkarni, Kamesh Munagala. [doi]
- A Hierarchy of Local DecisionLaurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen. [doi]
- Provably Secure Virus Detection: Using The Observer Effect Against MalwareRichard J. Lipton, Rafail Ostrovsky, Vassilis Zikas. [doi]
- Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in LatticesShi Bai, Damien Stehlé, Weiqiang Wen. [doi]
- Fine-Grained Complexity Analysis of Two Classic TSP VariantsMark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger. [doi]
- Improved Bounds on the Sign-Rank of AC^0Mark Bun, Justin Thaler. [doi]
- The Taming of the Semi-Linear SetDmitry Chistikov, Christoph Haase. [doi]
- Minimizing Resources of Sweeping and Streaming String TransducersFélix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. [doi]