Table of Contents

• The Ubiquitous Digital TreePhilippe Flajolet. 1-22 [doi]
• Flat Holonomies on Automata NetworksGene Itkis, Leonid A. Levin. 23-49 [doi]
• Interprocedurally Analyzing Polynomial IdentitiesMarkus Müller-Olm, Michael Petter, Helmut Seidl. 50-67 [doi]
• External String Sorting: Faster and Cache-ObliviousRolf Fagerberg, Anna Pagh, Rasmus Pagh. 68-79 [doi]
• Amortized Rigidness in Dynamic Cartesian TreesIwona Bialynicka-Birula, Roberto Grossi. 80-91 [doi]
• Distribution-Sensitive Construction of Minimum-Redundancy Prefix CodesAhmed A. Belal, Amr Elmasry. 92-103 [doi]
• On Critical Exponents in Fixed Points of Binary ::::k::::-Uniform MorphismsDalia Krieger. 104-114 [doi]
• Equivalence of F-Algebras and Cubic FormsManindra Agrawal, Nitin Saxena. 115-126 [doi]
• Complete Codes in a Sofic ShiftMarie-Pierre Béal, Dominique Perrin. 127-136 [doi]
• Kolmogorov Complexity with ErrorLance Fortnow, Troy Lee, Nikolai K. Vereshchagin. 137-148 [doi]
• Kolmogorov Complexity and the Recursion TheoremBjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan. 149-161 [doi]
• Entanglement in Interactive Proof Systems with Binary AnswersStephanie Wehner. 162-171 [doi]
• Quantum Algorithms for Matching and Network FlowsAndris Ambainis, Robert Spalek. 172-183 [doi]
• The Number of Runs in a String: Improved Analysis of the Linear Upper BoundWojciech Rytter. 184-195 [doi]
• Estimating Entropy and Entropy Norm on Data StreamsAmit Chakrabarti, Khanh Do Ba, S. Muthukrishnan. 196-205 [doi]
• Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path ProblemsDaniel Golovin, Vineet Goyal, R. Ravi. 206-217 [doi]
• Exact Price of Anarchy for Polynomial Congestion GamesSebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann. 218-229 [doi]
• Oblivious Symmetric AlternationVenkatesan T. Chakaravarthy, Sambuddha Roy. 230-241 [doi]
• Combining Multiple HeuristicsTzur Sayag, Shai Fine, Yishay Mansour. 242-253 [doi]
• Conflict-Free Colorings of Rectangles RangesKhaled M. Elbassioni, Nabil H. Mustafa. 254-263 [doi]
• Grid Vertex-Unfolding Orthogonal PolyhedraMirela Damian, Robin Y. Flatland, Joseph O Rourke. 264-276 [doi]
• Theory and Application of Width Bounded Geometric SeparatorBin Fu. 277-288 [doi]
• Invariants of Automatic Presentations and Semi-synchronous TransductionsVince Bárány. 289-300 [doi]
• On the Accepting Power of 2-Tape Büchi AutomataOlivier Finkel. 301-312 [doi]
• Weighted Picture Automata and Weighted LogicsIna Mäurer. 313-324 [doi]
• Markov Decision Processes with Multiple ObjectivesKrishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger. 325-336 [doi]
• The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing MechanismsPaolo Penna, Carmine Ventre. 337-348 [doi]
• Convergence and Approximation in Potential GamesGeorge Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos. 349-360 [doi]
• Fast FPT-Algorithms for Cleaning GridsJosep Díaz, Dimitrios M. Thilikos. 361-371 [doi]
• Tradeoffs in Depth-Two SuperconcentratorsChinmoy Dutta, Jaikumar Radhakrishnan. 372-383 [doi]
• On Hypergraph and Graph Isomorphism with Bounded Color ClassesVikraman Arvind, Johannes Köbler. 384-395 [doi]
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic SequencesAndrey Yu. Rumyantsev, M. A. Ushakov. 396-407 [doi]
• Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard SetsJohn M. Hitchcock. 408-419 [doi]
• Regularity Problems for Visibly Pushdown LanguagesVince Bárány, Christof Löding, Olivier Serre. 420-431 [doi]
• Regular Expressions and NFAs Without ::::epsilon::::-TransitionsGeorg Schnitger. 432-443 [doi]
• Redundancy in Complete SetsChristian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang. 444-454 [doi]
• Sparse Selfreducible Sets and Polynomial Size Circuit Lower BoundsHarry Buhrman, Leen Torenvliet, Falk Unger. 455-468 [doi]
• Linear Advice for Randomized Logarithmic SpaceLance Fortnow, Adam R. Klivans. 469-476 [doi]
• Nested Pebbles and Transitive ClosureJoost Engelfriet, Hendrik Jan Hoogeboom. 477-488 [doi]
• Definability of Languages by Generalized First-Order Formulas over (N, +)Amitabha Roy, Howard Straubing. 489-499 [doi]
• Generalized Modal SatisfiabilityMichael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor. 500-511 [doi]
• Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity GamesKrishnendu Chatterjee, Thomas A. Henzinger. 512-523 [doi]
• DAG-Width and Parity GamesDietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer. 524-536 [doi]
• Reliable Computations Based on Locally Decodable CodesAndrei E. Romashchenko. 537-548 [doi]
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and MovementsReuven Cohen, David Peleg. 549-560 [doi]
• A Faster Algorithm for the Steiner Tree ProblemDaniel Mölle, Stefan Richter, Peter Rossmanith. 561-570 [doi]
• Generating Randomized Roundings with Cardinality Constraints and DerandomizationsBenjamin Doerr. 571-583 [doi]
• Online Sorting Buffers on LineRohit Khandekar, Vinayaka Pandit. 584-595 [doi]
• Optimal Node RoutingYossi Azar, Yoel Chaiutin. 596-607 [doi]
• Memoryless Facility Location in One PassDimitris Fotakis. 608-620 [doi]
• Energy-Efficient Algorithms for Flow Time MinimizationSusanne Albers, Hiroshi Fujiwara. 621-633 [doi]
• Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic GamesKousha Etessami, Mihalis Yannakakis. 634-645 [doi]
• Datalog and Constraint Satisfaction with Infinite TemplatesManuel Bodirsky, Víctor Dalmau. 646-659 [doi]
• Evaluating Monotone Circuits on Cylinders, Planes and ToriNutan Limaye, Meena Mahajan, Jayalal M. N. Sarma. 660-671 [doi]
• Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic TwoAlexander Healy, Emanuele Viola. 672-683 [doi]
• Weighted Asynchronous Cellular AutomataDietrich Kuske. 684-695 [doi]
• On the Complexity of the Most General Firing Squad Synchronization ProblemDarin Goldstein, Kojiro Kobayashi. 696-711 [doi]