Table of Contents

• A Calculus and Algebra for Distributed Data ManagementSerge Abiteboul. 1-11 [doi]
• The Büchi Complementation SagaMoshe Y. Vardi. 12-22 [doi]
• Speed-Up Techniques for Shortest-Path ComputationsDorothea Wagner, Thomas Willhalm. 23-36 [doi]
• Compact Forbidden-Set RoutingBruno Courcelle, Andrew Twigg. 37-48 [doi]
• A New Bound for Pure Greedy Hot Potato RoutingManfred Kunde. 49-60 [doi]
• Wavelength Management in WDM Rings to Maximize the Number of ConnectionsIoannis Caragiannis. 61-72 [doi]
• A First Investigation of Sturmian TreesJean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot. 73-84 [doi]
• On the Size of the Universal Automaton of a Regular LanguageSylvain Lombardy. 85-96 [doi]
• Correlations of Partial WordsFrancine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson. 97-108 [doi]
• Testing Convexity Properties of Tree ColoringsEldar Fischer, Orly Yahalom. 109-120 [doi]
• Why Almost All ::::k:::: -Colorable Graphs Are EasyAmin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik. 121-132 [doi]
• On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower BoundsPeter Bürgisser. 133-144 [doi]
• A New Rank Technique for Formula Size Lower BoundsTroy Lee. 145-156 [doi]
• Hard Metrics from Cayley Graphs of Abelian GroupsIlan Newman, Yuri Rabinovich. 157-162 [doi]
• Broadcasting vs. Mixing and Information Dissemination on Cayley GraphsRobert Elsässer, Thomas Sauerwald. 163-174 [doi]
• Light Orthogonal Networks with Constant Geometric DilationAdrian Dumitrescu, Csaba D. Tóth. 175-187 [doi]
• Admissibility in Infinite GamesDietmar Berwanger. 188-199 [doi]
• Pure Stationary Optimal Strategies in Markov Decision ProcessesHugo Gimbert. 200-211 [doi]
• Symmetries and the Complexity of Pure Nash EquilibriumFelix Brandt, Felix A. Fischer, Markus Holzer. 212-223 [doi]
• Computing Representations of Matroids of Bounded Branch-WidthDaniel Král. 224-235 [doi]
• Characterizing Minimal Interval CompletionsPinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger. 236-247 [doi]
• The Complexity of Unions of Disjoint SetsChristian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner. 248-259 [doi]
• Kolmogorov-Loveland Stochasticity and Kolmogorov ComplexityLaurent Bienvenu. 260-271 [doi]
• Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via CoresetsStefan Funke, Sören Laue. 272-283 [doi]
• On the Complexity of Affine Image MatchingChristian Hundt, Maciej Liskiewicz. 284-295 [doi]
• On Fixed Point Equations over Commutative SemiringsJavier Esparza, Stefan Kiefer, Michael Luttenberger. 296-307 [doi]
• An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid RingsAndrea Sattler-Klein. 308-319 [doi]
• A Cubic Kernel for Feedback Vertex SetHans Leo Bodlaender. 320-331 [doi]
• The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and CountingPeter Damaschke. 332-343 [doi]
• An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary GraphsMarc Tedder, Derek G. Corneil. 344-355 [doi]
• A Search Algorithm for the Maximal Attractor of a Cellular AutomatonEnrico Formenti, Petr Kurka. 356-366 [doi]
• Universal TilingsGrégory Lafitte, Michael Weiss. 367-380 [doi]
• On the Complexity of Unary Tiling-Recognizable Picture LanguagesAlberto Bertoni, Massimiliano Goldwurm, Violetta Lonati. 381-392 [doi]
• A Characterization of Strong Learnability in the Statistical Query ModelHans-Ulrich Simon. 393-404 [doi]
• On the Consistency of Discrete Bayesian LearningJan Poland. 405-416 [doi]
• VPSPACE and a Transfer Theorem over the RealsPascal Koiran, Sylvain Perifel. 417-428 [doi]
• On Symmetric Signatures in Holographic AlgorithmsJin-yi Cai, Pinyan Lu. 429-440 [doi]
• Randomly Rounding Rationals with Cardinality Constraints and DerandomizationsBenjamin Doerr. 441-452 [doi]
• Cheating to Get Better Roommates in a Random Stable MatchingChien-Chung Huang. 453-464 [doi]
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding WindowCostas Busch, Srikanta Tirthapura. 465-476 [doi]
• Arithmetizing Classes Around NC :::1::: and LNutan Limaye, Meena Mahajan, B. V. Raghavendra Rao. 477-488 [doi]
• The Polynomially Bounded Perfect Matching Problem Is in NC :::2:::Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf. 489-499 [doi]
• Languages with Bounded Multiparty Communication ComplexityArkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien. 500-511 [doi]
• New Approximation Algorithms for Minimum Cycle Bases of GraphsTelikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail. 512-523 [doi]
• On Completing Latin SquaresIman Hajirasouliha, Hossein Jowhari, Ravi Kumar, Ravi Sundaram. 524-535 [doi]
• Small Space Representations for Metric Min-Sum ::::k:::: -Clustering and Their ApplicationsArtur Czumaj, Christian Sohler. 536-548 [doi]
• An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood LogicDavide Bresolin, Angelo Montanari, Pietro Sala. 549-560 [doi]
• Bounded-Variable Fragments of Hybrid LogicsThomas Schwentick, Volker Weber. 561-572 [doi]
• Rank-1 Modal Logics Are CoalgebraicLutz Schröder, Dirk Pattinson. 573-585 [doi]
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial GroupsGábor Ivanyos, Luc Sanselme, Miklos Santha. 586-597 [doi]
• Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision ProblemAndrew M. Childs, Aram Wettroth Harrow, Pawel Wocjan. 598-609 [doi]
• Quantum Network CodingMasahito Hayashi, Kazuo Iwama, Harumichi Nishimura, Rudy Raymond Harry Putra, Shigeru Yamashita. 610-621 [doi]
• Reachability in Unions of Commutative Rewriting Systems Is DecidableMikolaj Bojanczyk, Piotr Hoffman. 622-633 [doi]
• Associative-Commutative Deducibility ConstraintsSergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune. 634-645 [doi]
• On the Automatic Analysis of Recursive Security Protocols with XORRalf Küsters, Tomasz Truderung. 646-657 [doi]
• Improved Online Algorithms for the Sorting Buffer ProblemIftah Gamzu, Danny Segev. 658-669 [doi]
• Cost Sharing Methods for Makespan and Completion Time SchedulingJanina Brenner, Guido Schäfer. 670-681 [doi]
• Planar Graphs: Logical Complexity and Parallel Isomorphism TestsOleg Verbitsky. 682-693 [doi]
• Enumerating All Solutions for Constraint Satisfaction ProblemsHenning Schnoor, Ilka Schnoor. 694-705 [doi]