Table of Contents

• Hypergraph Traversal Revisited: Cost Measures and Dynamic AlgorithmsGiorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni. 1-16 [doi]
• Defining the Java Virtual Machine as Platform for Provably Correct Java CompilationEgon Börger, Wolfram Schulte. 17-35 [doi]
• Towards a Theory of Recursive StructuresDavid Harel. 36-53 [doi]
• Modularization and Abstraction: The Keys to Practical Formal VerificationYonit Kesten, Amir Pnueli. 54-71 [doi]
• On the Role of Time and Space in Neural ComputationWolfgang Maass. 72-83 [doi]
• From Algorithms to Working Programs: On the Use of Program Checking in LEDAKurt Mehlhorn, Stefan Näher. 84-93 [doi]
• Computationally-Sound CheckersSilvio Micali. 94-116 [doi]
• Reasoning About the PastMogens Nielsen. 117-128 [doi]
• Satisfiability - Algorithms and LogicPavel Pudlák. 129-141 [doi]
• The Joys of BisimulationColin Stirling. 142-151 [doi]
• Towards Algorithmic Explanation of Mind Evolution and FunctioningJirí Wiedermann. 152-166 [doi]
• Combinatorial Hardness Proofs for Polynomial EvaluationMikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo. 167-175 [doi]
• Minimum Propositional Proof Length is NP-Hard to Linearly ApproximateMichael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi. 176-184 [doi]
• Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three AtomsMarek Chrobak, Christoph Dürr. 185-193 [doi]
• Locally Explicit Construction of Rödl s Asymptotically Good PackingsNikolai N. Kuzjurin. 194-202 [doi]
• Proof Theory of Fuzzy Logics: Urquhart s C and Related LogicsMatthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith. 203-212 [doi]
• Nonstochastic Languages as Projections of 2-Tape Quasideterministic LanguagesRichard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska. 213-219 [doi]
• Flow Logic for Imperative ObjectsFlemming Nielson, Hanne Riis Nielson. 220-228 [doi]
• Expressive Completeness of Temporal Logic of ActionAlexander Moshe Rabinovich. 229-238 [doi]
• Reducing AC-Termination to TerminationMaria C. F. Ferreira, Delia Kesner, Laurence Puel. 239-247 [doi]
• On One-Pass Term RewritingZoltán Fülöp, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi. 248-256 [doi]
• On the Word, Subsumption, and Complement Problem for Recurrent Term SchematizationsMiki Hermann, Gernot Salzer. 257-266 [doi]
• Encoding the Hydra Battle as a Rewrite SystemHélène Touzet. 267-276 [doi]
• Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) TimeChristian Hagenah, Anca Muscholl. 277-285 [doi]
• Iterated Length-Preserving Rational TransductionsMichel Latteux, David Simplot, Alain Terlutte. 286-295 [doi]
• The Head Hierarchy for Oblivious Finite Automata with Polynomial Advice CollapsesHolger Petersen. 296-304 [doi]
• The Equivalence Problem for Deterministic Pushdown Transducers into Abelian GroupsGéraud Sénizergues. 305-315 [doi]
• The Semi-Full Closure of Pure Type SystemsGilles Barthe. 316-325 [doi]
• Predicative Polymorphic SubtypingMarcin Benke. 326-335 [doi]
• A Computational Interpretation of the lambda-µ-CalculusGavin M. Bierman. 336-345 [doi]
• Polymorphic Subtyping Without DistributivityJacek Chrzaszcz. 346-355 [doi]
• A (Non-elementary) Modular Decision Procedure for LTrLPaul Gastin, Raphaël Meyer, Antoine Petit. 356-365 [doi]
• Complete Abstract Interpretations Made ConstructiveRoberto Giacobazzi, Francesco Ranzato, Francesca Scozzari. 366-377 [doi]
• Timed Bisimulation and Open MapsThomas Hune, Mogens Nielsen. 378-387 [doi]
• Deadlocking States in Context-Free Process AlgebraJirí Srba. 388-398 [doi]
• A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log ::::n:::: Negation GatesKazuyuki Amano, Akira Maruoka. 399-408 [doi]
• On Counting AC:::0::: Circuits with Negative ConstantsAndris Ambainis, David A. Mix Barrington, Huong LeThanh. 409-417 [doi]
• A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice s TheoremLane A. Hemaspaandra, Jörg Rothe. 418-426 [doi]
• Model Checking Real-Time Properties of Symmetric SystemsE. Allen Emerson, Richard J. Trefler. 427-436 [doi]
• Locality of Order-Invariant First-Order FormulasMartin Grohe, Thomas Schwentick. 437-445 [doi]
• Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract ModelAlessandra Di Pierro, Herbert Wiklicky. 446-455 [doi]
• Lazy Functional Algorithms for Exact Real FunctionalsAlex K. Simpson. 456-464 [doi]
• Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random SetsKlaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt. 465-473 [doi]
• Positive Turing and Truth-Table Completeness for NEXP Are IncomparableLevke Bentzien. 474-482 [doi]
• Tally NP Sets and Easy Census FunctionsJudy Goldsmith, Mitsunori Ogihara, Jörg Rothe. 483-492 [doi]
• Average-Case Intractability vs. Worst-Case IntractabilityJohannes Köbler, Rainer Schuler. 493-502 [doi]
• Shuffle on Trajectories: The Schützenberger Product and Related OperationsTero Harju, Alexandru Mateescu, Arto Salomaa. 503-511 [doi]
• Gaußian Elimination and a Characterization of Algebraic Power SeriesWerner Kuich. 512-521 [doi]
• D0L-Systems and Surface AutomorphismsLuis-Miguel Lopez, Philippe Narbel. 522-532 [doi]
• About Synchronization LanguagesIsabelle Ryl, Yves Roos, Mireille Clerbout. 533-542 [doi]
• When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?Klaus Barthelmann. 543-552 [doi]
• Spatial and Temporal Refinement of Typed Graph Transformation SystemsMartin Große-Rhode, Francesco Parisi-Presicce, Marta Simeoni. 553-561 [doi]
• Approximating Maximum Independent Sets in Uniform HypergraphsThomas Hofmeister, Hanno Lefmann. 562-570 [doi]
• Representing Hyper-Graphs by Regular LanguagesSalvatore La Torre, Margherita Napoli. 571-579 [doi]
• Improved Time and Space Hierarchies of One-Tape Off-Line TMsKazuo Iwama, Chuzo Iwamoto. 580-588 [doi]
• Tarskian Set Constraints Are in NEXPTIMEPawel Mielniczuk, Leszek Pacholski. 589-596 [doi]
• forall exists*-Equational Theory of Context Unification is Pi::1:::::0:::-HardSergei G. Vorobyov. 597-606 [doi]
• Speeding-Up Nondeterministic Single-Tape Off-Line Computations by One AlternationJirí Wiedermann. 607-615 [doi]
• Facial Circuits of Planar Graphs and Context-Free LanguagesBruno Courcelle, Denis Lapoire. 616-624 [doi]
• Optimizing OBDDs Is Still Intractable for Monotone FunctionsKazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima. 625-635 [doi]
• Blockwise Variable Orderings for Shared BDDsHarry Preuß, Anand Srivastav. 636-644 [doi]
• On the Composition Problem for OBDDs with Multiple Variable OrdersAnna Slobodová. 645-655 [doi]
• Equations in Transfinite StringsChristian Choffrut, Sándor Horváth. 656-664 [doi]
• Minimal Forbidden Words and Factor AutomataMaxime Crochemore, Filippo Mignosi, Antonio Restivo. 665-673 [doi]
• On Defect Effect of Bi-Infinite WordsJuhani Karhumäki, Ján Manuch, Wojciech Plandowski. 674-682 [doi]
• On Repetition-Free Binary Words of Minimal DensityRoman M. Kolpakov, Gregory Kucherov, Yuriy Tarannikov. 683-692 [doi]
• Embedding of Hypercubes into GridsSergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder. 693-701 [doi]
• Tree Decompositions of Small DiameterHans Leo Bodlaender, Torben Hagerup. 702-712 [doi]
• Degree-Preserving ForestsHajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra. 713-721 [doi]
• A Parallelization of Dijkstra s Shortest Path AlgorithmAndreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders. 722-731 [doi]
• Comparison Between the Complexity of a Function and the Complexity of Its GraphBruno Durand, Sylvain Porrot. 732-739 [doi]
• IFS and Control LanguagesHenning Fernau, Ludwig Staiger. 740-750 [doi]
• One Quantifier Will Do in Existential Monadic Second-Order Logic over PicturesOliver Matz. 751-759 [doi]
• On Some Recognizable Picture-LanguagesKlaus Reinhardt. 760-770 [doi]
• On the Complexity of Wavelength ConvertersVincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano. 771-779 [doi]
• On Boolean vs. Modular Arithmetic for Circuits and Communication ProtocolsCarsten Damm. 780-788 [doi]
• Communication Complexity and Lower Bounds on Multilective ComputationsJuraj Hromkovic. 789-797 [doi]
• A Finite Hierarchy of the Recursively Enumerable Real NumbersKlaus Weihrauch, Xizhong Zheng. 798-806 [doi]
• One Guess One-Way Cellular ArraysThomas Buchholz, Andreas Klein, Martin Kutrib. 807-815 [doi]
• Topological Definitions of Chaos Applied to Cellular Automata DynamicsGianpiero Cattaneo, Luciano Margara. 816-824 [doi]
• Characterization of Sensitive Linear Cellular Automata with Respect to the Counting DistanceGiovanni Manzini. 825-833 [doi]
• Additive Cellular Automata over Z::p:: and the Bottom of (CA, <=)Jacques Mazoyer, Ivan Rapaport. 834-843 [doi]