Abstract is missing.
- Nondeterministic Streaming String TransducersRajeev Alur, Jyotirmoy V. Deshmukh. 1-20 [doi]
- An Introduction to Randomness ExtractorsRonen Shaltiel. 21-41 [doi]
- Invitation to Algorithmic Uses of Inclusion-ExclusionThore Husfeldt. 42-59 [doi]
- On the Relation between Differential Privacy and Quantitative Information FlowMário S. Alvim, Miguel E. Andrés, Konstantinos Chatzikokolakis, Catuscia Palamidessi. 60-76 [doi]
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location ProblemShi Li. 77-88 [doi]
- Rice s Theorem for ::::μ::::-Limit Sets of Cellular AutomataMartin Delacourt. 89-100 [doi]
- Fault-Tolerant Compact Routing Schemes for General GraphsShiri Chechik. 101-112 [doi]
- Regular Languages of Words over Countable Linear OrderingsOlivier Carton, Thomas Colcombet, Gabriele Puppis. 125-136 [doi]
- Algebraic Independence and Blackbox Identity TestingMalte Beecken, Johannes Mittmann, Nitin Saxena. 137-148 [doi]
- A Fragment of ML Decidable by Visibly Pushdown AutomataDavid Hopkins, Andrzej S. Murawski, C.-H. Luke Ong. 149-161 [doi]
- Krivine Machines and Higher-Order SchemesSylvain Salvati, Igor Walukiewicz. 162-173 [doi]
- Relating Computational Effects by ⊤ ⊤-LiftingShin-ya Katsumata. 174-185 [doi]
- Constructing Differential Categories and Deconstructing Categories of GamesJim Laird, Giulio Manzonetto, Guy McCusker. 186-197 [doi]
- Nondeterminism Is Essential in Small 2FAs with Few ReversalsChristos A. Kapoutsis. 198-209 [doi]
- Isomorphism of Regular Trees and WordsMarkus Lohrey, Christian Mathissen. 210-221 [doi]
- On the Capabilities of Grammars, Automata, and Transducers Controlled by MonoidsGeorg Zetzsche. 222-233 [doi]
- The Cost of Traveling between LanguagesMichael Benedikt, Gabriele Puppis, Cristian Riveros. 234-245 [doi]
- Emptiness and Universality Problems in Timed Automata with Positive FrequencyNathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer. 246-257 [doi]
- Büchi Automata Can Have Smaller QuotientsLorenzo Clemente. 258-270 [doi]
- Automata-Based CSL Model CheckingLijun Zhang, David N. Jansen, Flemming Nielson, Holger Hermanns. 271-282 [doi]
- A Progress Measure for Explicit-State Probabilistic Model-CheckersXin Zhang, Franck van Breugel. 283-294 [doi]
- Probabilistic Bisimulation and Simulation Algorithms by Abstract InterpretationSilvia Crafa, Francesco Ranzato. 295-306 [doi]
- On the Semantics of Markov AutomataYuxin Deng, Matthew Hennessy. 307-318 [doi]
- Runtime Analysis of Probabilistic Programs with Unbounded RecursionTomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková. 319-331 [doi]
- Approximating the Termination Value of One-Counter MDPs and Stochastic GamesTomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera. 332-343 [doi]
- Generic Expression Hardness Results for Primitive Positive Formula ComparisonSimone Bova, Hubie Chen, Matthew Valeriote. 344-355 [doi]
- Guarded NegationVince Bárány, Balder ten Cate, Luc Segoufin. 356-367 [doi]
- Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in PredicatesMatthew Anderson, Dieter van Melkebeek, Nicole Schweikardt, Luc Segoufin. 368-379 [doi]
- Modular Markovian LogicLuca Cardelli, Kim G. Larsen, Radu Mardare. 380-391 [doi]
- Programming with Infinitesimals: A While-Language for Hybrid System ModelingKohei Suenaga, Ichiro Hasuo. 392-403 [doi]
- Model Checking the Quantitative ::::μ::::-Calculus on Linear Hybrid SystemsDiana Fischer, Lukasz Kaiser. 404-415 [doi]
- On Reachability for Hybrid Automata over Bounded TimeThomas Brihaye, Laurent Doyen, Gilles Geeraerts, Joël Ouaknine, Jean-François Raskin, James Worrell. 416-427 [doi]
- Deciding Robustness against Total Store OrderingAhmed Bouajjani, Roland Meyer, Eike Möhlmann. 428-440 [doi]
- Multiply-Recursive Upper Bounds with Higman s LemmaSylvain Schmitz, Ph. Schnoebelen. 441-452 [doi]
- Liveness-Preserving Atomicity AbstractionAlexey Gotsman, Hongseok Yang. 453-465 [doi]
- On Stabilization in Herman s AlgorithmStefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, James Worrell, Lijun Zhang. 466-477 [doi]
- Online Graph Exploration: New Results on Old and New AlgorithmsNicole Megow, Kurt Mehlhorn, Pascal Schweitzer. 478-489 [doi]
- Distance Oracles for Vertex-Labeled GraphsDanny Hermelin, Avivit Levy, Oren Weimann, Raphael Yuster. 490-501 [doi]
- Asymptotically Optimal Randomized Rumor SpreadingBenjamin Doerr, Mahmoud Fouz. 502-513 [doi]
- Fast Convergence for Consensus in Dynamic NetworksT.-H. Hubert Chan, Li Ning. 514-525 [doi]
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching ProblemKook Jin Ahn, Sudipto Guha. 526-538 [doi]
- Restoring Pure Equilibria to Weighted Congestion GamesKonstantinos Kollias, Tim Roughgarden. 539-551 [doi]
- Existence and Uniqueness of Equilibria for Flows over TimeRoberto Cominetti, José R. Correa, Omar Larré. 552-563 [doi]
- Collusion in Atomic Splittable Routing GamesChien-Chung Huang. 564-575 [doi]
- Adaptively Secure Non-interactive Threshold CryptosystemsBenoît Libert, Moti Yung. 588-600 [doi]
- Content Search through ComparisonsAmin Karbasi, Stratis Ioannidis, Laurent Massoulié. 601-612 [doi]
- Efficient Distributed Communication in Ad-Hoc Radio NetworksBogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki. 613-624 [doi]
- Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR ModelMagnús M. Halldórsson, Pradipta Mitra. 625-636 [doi]
- Convergence Time of Power-Control DynamicsJohannes Dams, Martin Hoefer, Thomas Kesselheim. 637-649 [doi]
- A New Approach for Analyzing Convergence Algorithms for Mobile RobotsAndreas Cord-Landwehr, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, Sven Kurras, Marcus Märtens, Friedhelm Meyer auf der Heide, Christoph Raupach, Kamil Swierkot, Daniel Warner, Christoph Weddemann, Daniel Wonisch. 650-661 [doi]