Table of Contents

• Distributed Quantum ComputingHarry Buhrman, Hein Röhrig. 1-20 [doi]
• Selfish Routing in Non-cooperative Networks: A SurveyRainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode. 21-45 [doi]
• Process Algebraic Frameworks for the Specification and Analysis of Cryptographic ProtocolsRoberto Gorrieri, Fabio Martinelli. 46-67 [doi]
• Semantic and Syntactic Approaches to Simulation RelationsJo Erskine Hannay, Shin-ya Katsumata, Donald Sannella. 68-91 [doi]
• On the Computational Complexity of Conservative ComputingGiancarlo Mauri, Alberto Leporati. 92-112 [doi]
• Constructing Infinite Graphs with a Decidable MSO-TheoryWolfgang Thomas. 113-124 [doi]
• Towards a Theory of Randomized Search HeuristicsIngo Wegener. 125-141 [doi]
• Adversarial Models for Priority-Based NetworksCarme Àlvarez, Maria J. Blesa, Josep Díaz, Antonio Fernández, Maria J. Serna. 142-151 [doi]
• On Optimal Merging NetworksKazuyuki Amano, Akira Maruoka. 152-161 [doi]
• Problems with Cannot Be Reduced to Any Proper SubproblemsKlaus Ambos-Spies. 162-168 [doi]
• ACID-Unification Is NEXPTIME-DecidableSiva Anantharaman, Paliath Narendran, Michaël Rusinowitch. 169-178 [doi]
• Completeness in Differential Approximation ClassesGiorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos. 179-188 [doi]
• On the Length of the Minimum Solution of Word Equations in One VariableKensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda. 189-197 [doi]
• Smoothed Analysis of Three Combinatorial ProblemsCyril Banderier, René Beier, Kurt Mehlhorn. 198-207 [doi]
• Inferring Strings from Graphs and ArraysHideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda. 208-217 [doi]
• Faster Algorithms for ::::k::::-Medians in TreesRobert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter. 218-227 [doi]
• Periodicity and Transitivity for Cellular Automata in Besicovitch TopologiesFrançois Blanchard, Julien Cervelle, Enrico Formenti. 228-238 [doi]
• Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout AlgorithmsHans Leo Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos. 239-248 [doi]
• Error-Bounded Probabilistic Computations between MA and AMElmar Böhler, Christian Glaßer, Daniel Meister. 249-258 [doi]
• A Faster FPT Algorithm for Finding Spanning Trees with Many LeavesPaul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger. 259-268 [doi]
• Symbolic Analysis of Crypto-Protocols Based on Modular ExponentiationMichele Boreale, Maria Grazia Buscemi. 269-278 [doi]
• Denotational Testing Semantics in Coinductive FormMichele Boreale, Fabio Gadducci. 279-289 [doi]
• Lower Bounds for General Graph-Driven Read-Once Parity Branching ProgramsHenrik Brosenne, Matthias Homeister, Stephan Waack. 290-299 [doi]
• The Minimal Graph Model of Lambda CalculusAntonio Bucciarelli, Antonino Salibra. 300-307 [doi]
• Unambiguous Automata on Bi-infinite WordsOlivier Carton. 308-317 [doi]
• Relating Hierarchy of Temporal Properties to Model CheckingIvana Cerná, Radek Pelánek. 318-327 [doi]
• Arithmetic Constant-Depth Circuit Complexity ClassesHubie Chen. 328-337 [doi]
• Inverse NP ProblemsHubie Chen. 338-347 [doi]
• A Linear-Time Algorithm for 7-Coloring 1-Planar GraphsZhi-Zhong Chen, Mitsuharu Kouno. 348-357 [doi]
• Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid ParityVíctor Dalmau, Daniel K. Ford. 358-367 [doi]
• Randomized Algorithms for Determining the Majority on GraphsGianluca De Marco, Andrzej Pelc. 368-377 [doi]
• Using Transitive-Closure Logic for Deciding Linear Properties of MonoidsChristian Delhommé, Teodor Knapik, D. Gnanaraj Thomas. 378-387 [doi]
• Linear-Time Computation of Local PeriodsJean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre. 388-397 [doi]
• Two Dimensional Packing: The Power of RotationLeah Epstein. 398-407 [doi]
• Approximation Schemes for the Min-Max Starting Time ProblemLeah Epstein, Tamir Tassa. 408-418 [doi]
• Quantum Testers for Hidden Group PropertiesKatalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen. 419-428 [doi]
• Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz TracesPaul Gastin, Madhavan Mukund, K. Narayan Kumar. 429-438 [doi]
• LTL with Past and Two-Way Very-Weak Alternating AutomataPaul Gastin, Denis Oddoux. 439-448 [doi]
• Match-Bounded String Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann. 449-459 [doi]
• Probabilistic and Nondeterministic Unary AutomataGregor Gramlich. 460-469 [doi]
• On Matroid Properties Definable in the MSO LogicPetr Hlinený. 470-479 [doi]
• Characterizations of Catalytic Membrane Computing SystemsOscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena. 480-489 [doi]
• Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected GraphsToshimasa Ishii, Masayuki Hagiwara. 490-499 [doi]
• Scheduling and Traffic Allocation for Tasks with Bounded SplittabilityPiotr Krysta, Peter Sanders, Berthold Vöcking. 500-510 [doi]
• Computing Average Value in Ad Hoc NetworksMiroslaw Kutylowski, Daniel Letkiewicz. 511-520 [doi]
• A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel ProcessesSlawomir Lasota. 521-530 [doi]
• Solving the Sabotage Game Is PSPACE-HardChristof Löding, Philipp Rohde. 531-540 [doi]
• The Approximate Well-Founded Semantics for Logic Programs with UncertaintyYann Loyer, Umberto Straccia. 541-550 [doi]
• Which Is the Worst-Case Nash Equilibrium?Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode, Paul G. Spirakis, Imrich Vrto. 551-561 [doi]
• A Unique Decomposition Theorem for Ordered Monoids with Applications in Process TheoryBas Luttik. 562-571 [doi]
• Generic Algorithms for the Generation of Combinatorial ObjectsConrado Martínez, Xavier Molinero. 572-581 [doi]
• On the Complexity of Some Problems in Interval ArithmeticKlaus Meer. 582-591 [doi]
• An Abduction-Based Method for Index Relaxation in Taxonomy-Based SourcesCarlo Meghini, Yannis Tzitzikas, Nicolas Spyratos. 592-601 [doi]
• On Selection Functions that Do Not Preserve NormalityWolfgang Merkle, Jan Reimann. 602-611 [doi]
• On Converting CNF to DNFPeter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener. 612-621 [doi]
• A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher QuorumNadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot. 622-631 [doi]
• On the Complexity of Some Equivalence Problems for Propositional CalculiSteffen Reith. 632-641 [doi]
• Quantified Mu-Calculus for Control SynthesisStéphane Riedweg, Sophie Pinchinat. 642-651 [doi]
• On Probabilistic Quantified Satisfability GamesMarcin Rychlik. 652-661 [doi]
• A Completeness Property of Wilke s Tree AlgebrasSaeed Salehi. 662-670 [doi]
• Symbolic Topological Sorting with OBDDSPhilipp Woelfel. 671-680 [doi]
• Ershov s Hierarchy of Real NumbersXizhong Zheng, Robert Rettinger, Romain Gengler. 681-690 [doi]