Contents - Part II
Invited Talks
Towards the Graph Minor Theorems for Directed Graphs 3 Ken-Ichi Kawarabayashi and Stephan Kreutzer
Automated Synthesis of Distributed Controllers 11 Anca Muscholl
Track B: Logic, Semantics, Automata and Theory of Programming
Games for Dependent Types 31 Samson Abramsky, Radha Jagadeesan, and Matthijs Vakdr
Short Proofs of the Kneser-Lovasz Coloring Principle 44 James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, and Gabriel Istrate
Provenance Circuits for Trees and Treelike Instances 56 Antoine Amarilli, Pierre Bourhis, and Pierre Senellart
Language Emptiness of Continuous-Time Parametric Timed Automata 69 Nikola Benes, Peter Bezdek, Kim G. Larsen, and Jin Srba
Analysis of Probabilistic Systems via Generating Functions and Pade Approximation 82 Michele Boreale
On Reducing Linearizability to State Reachability 95 Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza
The Complexity of Synthesis from Probabilistic Components 108 Krishnendu Chatterjee, Laurent Doyen, and Moshe Y. Vardi
Edit Distance for Pushdown Automata 121 Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, and Jan Otop
Solution Sets for Equations over Free Groups Are EDTOL Languages 134 Laura Ciobanu, Volker Diekert, and Murray Elder
Limited Set quantifiers over Countable Linear Orderings 146 Thomas Colcombet and A.V. Sreejith
http://d-nb.info/1071249711 XXVM Contents - Part II
Reachability Is in DynFO 159 Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, and Thomas Zeume
Natural Homology 171 Jeremy Dubut, Eric Goubault, and Jean Goubault-Larrecq
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes 184 Kousha Etessami, Alistair Stewart, and Mihalis Yannakakis
Trading Bounds for Memory in Games with Counters 197 Nathanael Fijalkow, Florian Horn, Denis Kuperberg, and Michal Skrzypczak
Decision Problems of Tree Transducers with Origin 209 Emmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, and Jean-Marc Talbot
Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words 222 Olivier Finkel
The Odds of Staying on Budget 234 Christoph Haase and Stefan Kiefer
From Sequential Specifications to Eventual Consistency 247 Radha Jagadeesan and James Riely
Fixed-Dimensional Energy Games Are in Pseudo-Polynomial Time 260 Marcin Jurdzinski, Ranko Lazic, and Sylvain Schmitz
An Algebraic Geometric Approach to Nivat's Conjecture 273 Jarkko Kari and Michal Szabados
Nominal Kleene Coalgebra 286 Dexter Kozen, Konstantinos Mamouras, Daniela Petri ^an, and Alexandra Silva
On Determinisation of Good-for-Games Automata 299 Denis Kuperberg and Michal Skrzypczak
Owicki-Gries Reasoning for Weak Memory Models 311 Ori Lahav and Viktor Vafeiadis
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension 324 Jerome Leroux, Gregoire Sutre, and Patrick Totzke Contents - Part II XXIX
Compressed Tree Canonization 337 Markus Lohrey, Sebastian Maneth, and Fabian Peternek
Parsimonious Types and Non-uniform Computation 350 Damiano Mazza and Kazushige Terui
Baire Category Quantifier in Monadic Second Order Logic 362 Henryk Michalewski and Matteo Mio
Liveness of Parameterized Timed Networks 375 Benjamin Aminof, Sasha Rubin, Florian Zuleger, and Francesco Spegni
Symmetric Strategy Improvement 388 Sven Schewe, Ashutosh Trivedi, and Thomas Varghese
Effect Algebras, Presheaves, Non-locality and Contextuality 401 Sam Staton and Sander Uijlen
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages 414 Joseph Swernofsky and Michael Wehar
Containment of Monadic Datalog Programs via Bounded Clique-Width .... 427 Mikolaj Bojanczyk, Filip Murlak, and Adam Witkowski
An Approach to Computing Downward Closures 440 Georg Zetzsche
How Much Lookahead Is Needed to Win Infinite Games? 452 Felix Klein and Martin Zimmermann
Track C: Foundations of Networked Computation: Models, Algorithms and Information Management
Symmetric Graph Properties Have Independent Edges 467 Dimitris Achlioptas and Paris Siminelakis
Polylogarithmic-Time Leader Election in Population Protocols 479 Dan Alistarh and Rati Gelashvili
Core Size and Densification in Preferential Attachment Networks 492 Chen Avin, Zvi Lotker, Yinon Nahum, and David Peleg
Maintaining Near-Popular Matchings 504 Sayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, and Lisa Wagner XXX Contents - Part II
Ultra-Fast Load Balancing on Scale-Free Networks 516 Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, and Thomas Sauerwald
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms 528 Bernadette Charron-Bost, Matthias Fiigger, and Thomas Nowak
The Range of Topological Effects on Communication 540 Arkadev Chattopadhyay and Atri Rudra
Secretary Markets with Local Information 552 Ning Chen, Martin Hoefer, Marvin Kiinnemann, Chengyu Lin, and Peihan Miao
A Simple and Optimal Ancestry Labeling Scheme for Trees 564 S0ren Dahlgaard, Mathias Bcek Tejs Knudsen, and Noy Rotbart
Interactive Communication with Unknown Noise Rate 575 Varsha Dani, Mahnush Movahedi, Jared Saia, and Maxwell Young
Fixed Parameter Approximations for ^-Center Problems in Low Highway Dimension Graphs 588 Andreas Emil Feldmann
A Unified Framework for Strong Price of Anarchy in Clustering Games. ... 601 Michal Feldman and Ophir Friedler
On the Diameter of Hyperbolic Random Graphs 614 Tobias Friedrich and Anton Krohmer
Tight Bounds for Cost-Sharing in Weighted Congestion Games 626 Martin Gairing, Konstantinos Kollias, and Grammateia Kotsialou
Distributed Broadcast Revisited: Towards Universal Optimality 638 Mohsen Ghaffari
Selling Two Goods Optimally 650 Yiannis Giannakopoulos and Elias Koutsoupias
Adaptively Secure Coin-Flipping, Revisited 663 Shafi Goldwasser, Yael Tauman Kalai, and Sunoo Park
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem 675 Erez Kantor and Shay Kutten Contents - Part II XXXI
Normalization Phenomena in Asynchronous Networks 688 Amin Karbasi, Johannes Lengler, and Angelika Steger
Broadcast from Minicast Secure Against General Adversaries 701 Pavel Raykov
Author Index 713 Contents - Part I
Track A: Algorithms, Complexity and Games
Statistical Randomized Encodings: A Complexity Theoretic View 1 Shweta Agrawal, Yuval Ishai, Dakshita Khurana, and Anat Paskin-Cherniavsky
Tighter Fourier Transform Lower Bounds 14 Nir Ailon
Quantifying Competitiveness in Paging with Locality of Reference 26 Susanne Albers and Dario Frascaria
Approximation Algorithms for Computing Maximin Share Allocations 39 Georgios Amanatidis, Evangelos Markakis, Afshin Nikzad, and Amin Saberi
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare 52 Elliot Anshelevich, Koushik Kar, and Shreyas Sekar
Batched Point Location in SINR Diagrams via Algebraic Tools 65 Boris Aronov and Matthew J. Katz
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-uniform Costs 78 Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, and Yuval Rabani
Serving in the Dark Should Be Done Non-uniformly 91 Yossi Azar and Ilan Reuven Cohen
Finding the Median (Obliviously) with Bounded Space 103 Paul Beame, Vincent Liew, and Mihai Patra$cu
Approximation Algorithms for Min-Sum ^-Clustering and Balanced A:-Median 116 Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, and Rohit Sivakumar
Solving Linear Programming with Constraints Unknown 129 Xiaohui Bei, Ning Chen, and Shengyu Zhang XXXIV Contents - Part I
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources 143 Salman Beigi, Omid Etesami, and Amin Gohari
Limitations of Algebraic Approaches to Graph Isomorphism Testing 155 Christoph Berkholz and Martin Grohe
Fully Dynamic Matching in Bipartite Graphs 167 Aaron Bernstein and Cliff Stein
Feasible Interpolation for QBF Resolution Calculi 180 Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla
Simultaneous Approximation of Constraint Satisfaction Problems 193 Amey Bhangale, Swastik Kopparty, and Sushant Sachdeva
Design of Dynamic Algorithms via Primal-Dual Method 206 Sayan Bhattacharya, Monika Henzinger, and Giuseppe F. Italiano
What Percentage of Programs Halt? 219 Laurent Bienvenu, Damien Desfontaines, and Alexander Shen
The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems 231 Andreas Bjdrklund, Holger Dell, and Thore Husfeldt
Spotting Trees with Few Leaves 243 Andreas Bjdrklund, Vikram Kamat, Lukasz Kowalik, and Meirav Zehavi
Constraint Satisfaction Problems over the Integers with Successor 256 Manuel Bodirsky, Barnaby Martin, and Antoine Mottet
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits 268 Mark Bun and Justin Thaler
Algorithms and Complexity for Turaev-Viro Invariants 281 Benjamin A. Burton, Clement Maria, and Jonathan Spreer
Big Data on the Rise? - Testing Monotonicity of Distributions 294 Clement L. Canonne
Unit Interval Editing Is Fixed-Parameter Tractable 306 Yixin Cao
Streaming Algorithms for Submodular Function Maximization 318 Chandra Chekuri, Shalmoli Gupta, and Kent Quanrud Contents - Part I XXXV
Multilinear Pseudorandom Functions 331 Aloni Cohen and Justin Holmgren
Zero-Fixing Extractors for Sub-Logarithmic Entropy 343 Gil Cohen and Igor Shinkar
Interactive Proofs with Approximately Commuting Provers 355 Matthew Coudron and Thomas Vidick
Popular Matchings with Two-Sided Preferences and One-Sided Ties 367 Agnes Cseh, Chien-Chung Huang, and Telikepalli Kavitha
Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity 380 Radu Curticapean
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols 393 Jurek Czyzowicz, Leszek Gqsieniec, Adrian Kosowski, Evangelos Kranakis, Paul G. Spirakis, and Przemyslaw Uznanski
Scheduling Bidirectional Traffic on a Path 406 Yann Disser, Max Klimm, and Elisabeth Ltibbecke
On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace 419 Dean Doron and Amnon Ta-Shma
On Planar Boolean CSP 432 Zdenek Dvordk and Martin Kupec
On Temporal Graph Exploration 444 Thomas Erlebach, Michael Hoffmann, and Frank Kammer
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation 456 Antonio Faonio, Jesper Buus Nielsen, and Daniele Venturi
A (l+£)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs 469 Andreas Emil Feldmann, Wai Shing Fung, Jochen Konemann, and lan Post
Lower Bounds for the Graph Homomorphism Problem 481 Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, and Ivan Mihajlin XXXVI Contents - Part I
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree 494 Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh
Relative Discrepancy Does not Separate Information and Communication Complexity 506 Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Lauriitre, and Jeremie Roland
A Galois Connection for Valued Constraint Languages of Infinite Size 517 Peter Fulla and Stanislav Zivny
Approximately Counting //-Colourings Is #BIS-Hard 529 Andreas Galanis, Leslie Ann Goldberg, and Mark Jerrum
Taylor Polynomial Estimator for Estimating Frequency Moments 542 Sumit Ganguly
ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria 554 Jugal Garg, Ruta Mehta, Vijay V. Vazirani, and Sadra Yazdanbod
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets 567 Serge Gaspers and Gregory B. Sorkin
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search 580 Pawel Gawrychowski, Shay Mozes, and Oren Weimann
Optimal Encodings for Range Top-fc, Selection, and Min-Max 593 Pawel Gawrychowski and Patrick K. Nicholson
2-Vertex Connectivity in Directed Graphs 605 Loukas Georgiadis, Giuseppe F. Italiano, Luigi Laura, and Nikos Parotsidis
Ground State Connectivity of Local Hamiltonians 617 Sevag Gharibian and Jamie Sikora
Uniform Kemelization Complexity of Hitting Forbidden Minors 629 Archontia C. Giannopoulou, Bart M.P. Jansen, Daniel Lokshtanov, and Saket Saurabh
Counting Homomorphisms to Square-Free Graphs, Modulo 2 642 Andreas Gobel, Leslie Ann Goldberg, and David Richerby Contents - Part I XXXVU
Approximately Counting Locally-Optimal Structures 654 Leslie Ann Goldberg, Rob Gysel, and John Lapinskas
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract) 666 Oded Goldreich, Tom Gur, and Ron D. Rothblum
Fast Algorithms for Diameter-Optimally Augmenting Paths 678 Ulrike Grofie, Joachim Gudmundsson, Christian Knauer, Michiel Smid, and Fabian Stehn
Hollow Heaps 689 Thomas Dueholm Hansen, Haim Kaplan, Robert E. Tarjan, and Uri Zwick
Linear-Time List Recovery of High-Rate Expander Codes 701 Brett Hemenway and Mary Wootters
Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time 713 Monika Henzinger, Sebastian Krinninger, and Veronika Loitzenbauer
Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs 725 Monika Henzinger, Sebastian Krinninger, and Danupon Nanongkai
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities 737 Sungjin Im and Benjamin Moseley
Local Reductions 749 Hamid Jahanjou, Eric Miles, and Emanuele Viola
Query Complexity in Expectation 761 Jedrzej Kaniewski, Troy Lee, and Ronald de Wolf
Near-Linear Query Complexity for Graph Inference 773 Sampath Kannan, Claire Mathieu, and Hang Zhou
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set 785 Marek Karpinski, Andrzej Lingas, and Dzmitry Sledneu
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden 797 Yasushi Kawase, Yusuke Kobayashi, and Yutaro Yamaguchi
Lower Bounds for Sums of Powers of Low Degree Univariates 810 Neeraj Kayal, Pascal Koiran, Timothee Pecatte, and Chandan Saha XXXVin Contents - Part I
Approximating CSPs Using LP Relaxation 822 Subhash Khot and Rishi Saket
Comparator Circuits over Finite Bounded Posets 834 Balagopal Komarath, Jayalal Sarma, and K.S. Sunil
Algebraic Properties of Valued Constraint Satisfaction Problem 846 Marcin Kozik and Joanna Ochremiak
Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic 859 Marvin Kunnemann and Bodo Manthey
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy 872 Adam Kurpisz, Samuli Leppanen, and Monaldo Mastrolilli
Replacing Mark Bits with Randomness in Fibonacci Heaps 886 Jerry Li and John Peebles
A PTAS for the Weighted Unit Disk Cover Problem 898 Jian Li and Yifei Jin
Approximating the Expected Values for Combinatorial Optimization Problems Over Stochastic Points 910 Lingxiao Huang and Jian LA
Deterministic Truncation of Linear Matroids 922 Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, and Saket Saurabh
Linear Time Parameterized Algorithms for Subset Feedback Vertex Set.... 935 Daniel Lokshtanov, M.S. Ramanujan, and Saket Saurabh
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains 947 Joseph S.B. Mitchell, Valentin Polishchuk, Mikko Sysikaski, and Haitao Wang
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity 960 Marco Molinaro, David P. Woodruff, and Grigory Yaroslavtsev
A (2+a)-Approximation Algorithm for the Storage Allocation Problem 973 Tobias Momke and Andreas Wiese
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas 985 Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, and Venkatesh Raman Contents - Part 1 XXXIX
Computing the Frechet Distance Between Polygons with Holes 997 Amir Nayyeri and Anastasios Sidiropoulos
An Improved Private Mechanism for Small Databases 1010 Aleksandar Nikolov
Binary Pattern Tile Set Synthesis Is NP-Hard 1022 Lila Kari, Steffen Kopecki, Pierre-Etienne Meunier, Matthew J. Patitz, and Shinnosuke Seki
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity 1035 Swagato Sanyal
Condensed Unpredictability 1046 Maciej Skdrski, Alexander Golovnev, and Krzysztof Pietrzak
Sherali-Adams Relaxations for Valued CSPs 1058 Johan Thapper and Stanislav Zivny
Two-Sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm 1070 Yajun Wang and Sam Chiu-wai Wong
The Simultaneous Communication of Disjointness with Applications to Data Streams 1082 Omri Weinstein and David P. Woodruff
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication. . . . 1094 Huacheng Yu
Author Index 1107