Table of Contents

• A Core Calculus for Scala Type CheckingVincent Cremet, François Garillot, Sergueï Lenglet, Martin Odersky. 1-23 [doi]
• Tree Exploration with an OraclePierre Fraigniaud, David Ilcinkas, Andrzej Pelc. 24-37 [doi]
• Distributed Data Structures: A Survey on Informative Labeling SchemesCyril Gavoille. 38 [doi]
• From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of DeductionsHerman Geuvers, Iris Loeb. 39-57 [doi]
• The Structure of Tractable Constraint Satisfaction ProblemsMartin Grohe. 58-72 [doi]
• On the Representation of Kleene Algebras with TestsDexter Kozen. 73-83 [doi]
• From Three Ideas in TCS to Three Applications in BioinformaticsMing Li. 84-85 [doi]
• Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-trianglesOswin Aichholzer, Clemens Huemer, S. Kappes, Bettina Speckmann, Csaba D. Tóth. 86-97 [doi]
• Approximate Shortest Path Queries on Weighted Polyhedral SurfacesLyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack. 98-109 [doi]
• A Unified Construction of the Glushkov, Follow, and Antimirov AutomataCyril Allauzen, Mehryar Mohri. 110-121 [doi]
• Algebraic Characterizations of Unitary Linear Quantum Cellular AutomataPablo Arrighi. 122-133 [doi]
• A Polynomial Time Nilpotence Test for Galois Groups and Related ResultsVikraman Arvind, Piyush P. Kurur. 134-145 [doi]
• The Multiparty Communication Complexity of Exact-::::T::::: Improved Bounds and New ProblemsRichard Beigel, William I. Gasarch, James Glenn. 146-156 [doi]
• Crochemore Factorization of Sturmian and Other Infinite WordsJean Berstel, Alessandra Savelli. 157-166 [doi]
• Equations on Partial WordsFrancine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis. 167-178 [doi]
• Concrete Multiplicative Complexity of Symmetric FunctionsJoan Boyar, René Peralta. 179-189 [doi]
• On the Complexity of Limit Sets of Cellular Automata Associated with Probability MeasuresLaurent Boyer, Victor Poupet, Guillaume Theyssier. 190-201 [doi]
• Coloring Random 3-Colorable Graphs with Non-uniform Edge ProbabilitiesUlrik Brandes, Jürgen Lerner. 202-213 [doi]
• The Kleene Equality for GraphsArnaud Carayol, Didier Caucal. 214-225 [doi]
• On the Repetition Threshold for Large AlphabetsArturo Carpi. 226-237 [doi]
• Improved Parameterized Upper Bounds for Vertex CoverJianer Chen, Iyad A. Kanj, Ge Xia. 238-249 [doi]
• On Comparing Sums of Square Roots of Small IntegersQi Cheng. 250-255 [doi]
• A Combinatorial Approach to Collapsing WordsAlessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz, B. Piochi. 256-266 [doi]
• Optimal Linear Arrangement of Interval GraphsJohanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov. 267-279 [doi]
• The Lempel-Ziv Complexity of Fixed Points of MorphismsSorin Constantinescu, Lucian Ilie. 280-291 [doi]
• Partially Commutative Inverse MonoidsVolker Diekert, Markus Lohrey, Alexander Miller. 292-304 [doi]
• Learning Bayesian Networks Does Not Have to Be NP-HardNorbert Dojer. 305-314 [doi]
• Lower Bounds for the Transition Complexity of NFAsMichael Domaratzki, Kai Salomaa. 315-326 [doi]
• Smart Robot Teams Exploring Sparse TreesMiroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer. 327-338 [doi]
• ::::k::::-Sets of Convex Inclusion Chains of Planar Point SetsWael El Oraiby, Dominique Schmitt. 339-350 [doi]
• Toward the Eigenvalue Power LawRobert Elsässer. 351-362 [doi]
• Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish MovesAngelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli. 363-374 [doi]
• Very Sparse Leaf LanguagesLance Fortnow, Mitsunori Ogihara. 375-386 [doi]
• On the Correlation Between Parity and Modular PolynomialsAnna Gál, Vladimir Trifonov. 387-398 [doi]
• Optimally Fast Data Gathering in Sensor NetworksLuisa Gargano, Adele A. Rescigno. 399-411 [doi]
• Magic Numbers in the State Hierarchy of Finite AutomataViliam Geffert. 412-423 [doi]
• Online Single Machine Batch SchedulingBeat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer. 424-435 [doi]
• Machines that Can Output Empty WordsChristian Glaßer, Stephen D. Travers. 436-446 [doi]
• Completeness of Global Evaluation LogicSergey Goncharov, Lutz Schröder, Till Mossakowski. 447-458 [doi]
• NOF-Multiparty Information Complexity Bounds for Pointer JumpingAndre Gronemeier. 459-470 [doi]
• Dimension Characterizations of Complexity ClassesXiaoyang Gu, Jack H. Lutz. 471-479 [doi]
• Approximation Algorithms and Hardness Results for Labeled Connectivity ProblemsRefael Hassin, Jérôme Monnot, Danny Segev. 480-491 [doi]
• An Expressive Temporal Logic for Real TimeYoram Hirshfeld, Alexander Moshe Rabinovich. 492-504 [doi]
• On Matroid Representability and Minor ProblemsPetr Hlinený. 505-516 [doi]
• Non-cooperative Tree CreationMartin Hoefer. 517-527 [doi]
• Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election WinnersChristopher M. Homan, Lane A. Hemaspaandra. 528-539 [doi]
• Reductions for Monotone Boolean CircuitsKazuo Iwama, Hiroki Morizumi. 540-548 [doi]
• Generalised Integer Programming Based on Logically Defined RelationsPeter Jonsson, Gustav Nordh. 549-560 [doi]
• Probabilistic Length-Reducing AutomataTomasz Jurdzinski. 561-572 [doi]
• Sorting Long Sequences in a Single Hop Radio NetworkMarcin Kik. 573-583 [doi]
• Systems of Equations over Finite Semigroups and the #CSP Dichotomy ConjectureOndrej Klíma, Benoit Larose, Pascal Tesson. 584-595 [doi]
• Valiant s Model: From Exponential Sums to Exponential ProductsPascal Koiran, Sylvain Perifel. 596-607 [doi]
• A Reachability Algorithm for General Petri Nets Based on Transition InvariantsAlexander E. Kostin. 608-621 [doi]
• Approximability of Bounded Occurrence Max OnesFredrik Kuivinen. 622-633 [doi]
• Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and DecidabilityMartin Kutrib, Andreas Malcher. 634-645 [doi]
• Faster Algorithm for Bisimulation Equivalence of Normed Context-Free ProcessesSlawomir Lasota, Wojciech Rytter. 646-657 [doi]
• Quantum Weakly Nondeterministic Communication ComplexityFrançois Le Gall. 658-669 [doi]
• Minimal Chordal Sense of Direction and Circulant GraphsRodrigo S. C. Leão, Valmir C. Barbosa. 670-680 [doi]
• Querying and Embedding Compressed TextsYury Lifshits, Markus Lohrey. 681-692 [doi]
• Lempel-Ziv Dimension for Lempel-Ziv CompressionMaría López-Valdés. 693-703 [doi]
• Characterizing Valiant s Algebraic Complexity ClassesGuillaume Malod, Natacha Portier. 704-716 [doi]
• The Price of DefenseMarios Mavronicolas, Loizos Michael, Vicky G. Papadopoulou, Anna Philippou, Paul G. Spirakis. 717-728 [doi]
• The Data Complexity of MDatalog in Basic Modal LogicsLinh Anh Nguyen. 729-740 [doi]
• The Complexity of Counting Functions with Easy Decision VersionAris Pagourtzis, Stathis Zachos. 741-752 [doi]
• On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String ModelGiuseppe Persiano, Ivan Visconti. 753-764 [doi]
• Constrained Minimum Enclosing Circle with Center on a Query Line SegmentSasanka Roy, Arindam Karmakar, Sandip Das, Subhas C. Nandy. 765-776 [doi]
• Hierarchical UnambiguityHolger Spakowski, Rahul Tripathi. 777-788 [doi]
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Cerny ConjectureA. N. Trahtman. 789-800 [doi]
• On Genome Evolution with InnovationDamian Wójtowicz, Jerzy Tiuryn. 801-811 [doi]