Table of Contents

• Towards the Graph Minor Theorems for Directed GraphsKen-ichi Kawarabayashi, Stephan Kreutzer. 3-10 [doi]
• Automated Synthesis of Distributed ControllersAnca Muscholl. 11-27 [doi]
• Games for Dependent TypesSamson Abramsky, Radha Jagadeesan, Matthijs Vákár. 31-43 [doi]
• Short Proofs of the Kneser-Lovász Coloring PrincipleJames Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate. 44-55 [doi]
• Provenance Circuits for Trees and Treelike InstancesAntoine Amarilli, Pierre Bourhis, Pierre Senellart. 56-68 [doi]
• Language Emptiness of Continuous-Time Parametric Timed AutomataNikola Benes, Peter Bezdek, Kim Guldstrand Larsen, Jirí Srba. 69-81 [doi]
• Analysis of Probabilistic Systems via Generating Functions and Padé ApproximationMichele Boreale. 82-94 [doi]
• On Reducing Linearizability to State ReachabilityAhmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza. 95-107 [doi]
• The Complexity of Synthesis from Probabilistic ComponentsKrishnendu Chatterjee, Laurent Doyen 0001, Moshe Y. Vardi. 108-120 [doi]
• Edit Distance for Pushdown AutomataKrishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop. 121-133 [doi]
• Solution Sets for Equations over Free Groups are EDT0L LanguagesLaura Ciobanu, Volker Diekert, Murray Elder. 134-145 [doi]
• Limited Set quantifiers over Countable Linear OrderingsThomas Colcombet, A. V. Sreejith. 146-158 [doi]
• Reachability is in DynFOSamir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume. 159-170 [doi]
• Natural HomologyJérémy Dubut, Eric Goubault, Jean Goubault-Larrecq. 171-183 [doi]
• Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision ProcessesKousha Etessami, Alistair Stewart, Mihalis Yannakakis. 184-196 [doi]
• Trading Bounds for Memory in Games with CountersNathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak. 197-208 [doi]
• Decision Problems of Tree Transducers with OriginEmmanuel Filiot, Sebastian Maneth, Pierre-Alain Reynier, Jean-Marc Talbot. 209-221 [doi]
• Incompleteness Theorems, Large Cardinals, and Automata over Infinite WordsOlivier Finkel. 222-233 [doi]
• The Odds of Staying on BudgetChristoph Haase, Stefan Kiefer. 234-246 [doi]
• From Sequential Specifications to Eventual ConsistencyRadha Jagadeesan, James Riely. 247-259 [doi]
• Fixed-Dimensional Energy Games are in Pseudo-Polynomial TimeMarcin Jurdzinski, Ranko Lazic, Sylvain Schmitz. 260-272 [doi]
• An Algebraic Geometric Approach to Nivat's ConjectureJarkko Kari, Michal Szabados. 273-285 [doi]
• Nominal Kleene CoalgebraDexter Kozen, Konstantinos Mamouras, Daniela Petrisan, Alexandra Silva 0001. 286-298 [doi]
• On Determinisation of Good-for-Games AutomataDenis Kuperberg, Michal Skrzypczak. 299-310 [doi]
• Owicki-Gries Reasoning for Weak Memory ModelsOri Lahav, Viktor Vafeiadis. 311-323 [doi]
• On the Coverability Problem for Pushdown Vector Addition Systems in One DimensionJérôme Leroux, Grégoire Sutre, Patrick Totzke. 324-336 [doi]
• Compressed Tree CanonizationMarkus Lohrey, Sebastian Maneth, Fabian Peternek. 337-349 [doi]
• Parsimonious Types and Non-uniform ComputationDamiano Mazza, Kazushige Terui. 350-361 [doi]
• Baire Category Quantifier in Monadic Second Order LogicHenryk Michalewski, Matteo Mio. 362-374 [doi]
• Liveness of Parameterized Timed NetworksBenjamin Aminof, Sasha Rubin, Florian Zuleger, Francesco Spegni. 375-387 [doi]
• Symmetric Strategy ImprovementSven Schewe, Ashutosh Trivedi, Thomas Varghese. 388-400 [doi]
• Effect Algebras, Presheaves, Non-locality and ContextualitySam Staton, Sander Uijlen. 401-413 [doi]
• On the Complexity of Intersecting Regular, Context-Free, and Tree LanguagesJoseph Swernofsky, Michael Wehar. 414-426 [doi]
• Containment of Monadic Datalog Programs via Bounded Clique-WidthMikolaj Bojanczyk, Filip Murlak, Adam Witkowski. 427-439 [doi]
• An Approach to Computing Downward ClosuresGeorg Zetzsche. 440-451 [doi]
• How Much Lookahead is Needed to Win Infinite Games?Felix Klein, Martin Zimmermann 0002. 452-463 [doi]
• Symmetric Graph Properties Have Independent EdgesDimitris Achlioptas, Paris Siminelakis. 467-478 [doi]
• Polylogarithmic-Time Leader Election in Population ProtocolsDan Alistarh, Rati Gelashvili. 479-491 [doi]
• Core Size and Densification in Preferential Attachment NetworksChen Avin, Zvi Lotker, Yinon Nahum, David Peleg. 492-503 [doi]
• Maintaining Near-Popular MatchingsSayan Bhattacharya, Martin Hoefer, Chien-Chung Huang, Telikepalli Kavitha, Lisa Wagner. 504-515 [doi]
• Ultra-Fast Load Balancing on Scale-Free NetworksKarl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald. 516-527 [doi]
• Approximate Consensus in Highly Dynamic Networks: The Role of Averaging AlgorithmsBernadette Charron-Bost, Matthias Függer, Thomas Nowak. 528-539 [doi]
• The Range of Topological Effects on CommunicationArkadev Chattopadhyay, Atri Rudra. 540-551 [doi]
• Secretary Markets with Local InformationNing Chen, Martin Hoefer, Marvin Künnemann, Chengyu Lin, Peihan Miao. 552-563 [doi]
• A Simple and Optimal Ancestry Labeling Scheme for TreesSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart. 564-574 [doi]
• Interactive Communication with Unknown Noise RateVarsha Dani, Mahnush Movahedi, Jared Saia, Maxwell Young. 575-587 [doi]
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension GraphsAndreas Emil Feldmann. 588-600 [doi]
• A Unified Framework for Strong Price of Anarchy in Clustering GamesMichal Feldman, Ophir Friedler. 601-613 [doi]
• On the Diameter of Hyperbolic Random GraphsTobias Friedrich, Anton Krohmer. 614-625 [doi]
• Tight Bounds for Cost-Sharing in Weighted Congestion GamesMartin Gairing, Konstantinos Kollias, Grammateia Kotsialou. 626-637 [doi]
• Distributed Broadcast Revisited: Towards Universal OptimalityMohsen Ghaffari. 638-649 [doi]
• Selling Two Goods OptimallyYiannis Giannakopoulos, Elias Koutsoupias. 650-662 [doi]
• Adaptively Secure Coin-Flipping, RevisitedShafi Goldwasser, Yael Tauman Kalai, Sunoo Park. 663-674 [doi]
• Optimal Competitiveness for the Rectilinear Steiner Arborescence ProblemErez Kantor, Shay Kutten. 675-687 [doi]
• Normalization Phenomena in Asynchronous NetworksAmin Karbasi, Johannes Lengler, Angelika Steger. 688-700 [doi]
• Broadcast from Minicast Secure Against General AdversariesPavel Raykov. 701-712 [doi]