Table of Contents

• Generating Hard Instances of the Short Basis ProblemMiklós Ajtai. 1-9 [doi]
• Wide Area ComputationLuca Cardelli. 10-24 [doi]
• Proof Techniques for Cryptographic ProtocolsKevin J. Compton, Scott Dexter. 25-39 [doi]
• Type Structure for Low-Level Programming LanguagesKarl Crary, J. Gregory Morrisett. 40-54 [doi]
• Real Computations with Fake NumbersFelipe Cucker. 55-73 [doi]
• A Model for Associative Memory, a Basis for Thinking and ConsciousnessN. G. de Bruijn. 74-89 [doi]
• Numerical Integration with Exact Real ArithmeticAbbas Edalat, Marko Krznaric. 90-104 [doi]
• Observations about the Nature and State of Computer Science (Keynote Address)Juris Hartmanis. 105 [doi]
• DNA Computing: New Ideas and ParadigmsGrzegorz Rozenberg, Arto Salomaa. 106-118 [doi]
• Online Data Structures in External MemoryJeffrey Scott Vitter. 119-133 [doi]
• From Computational Learning Theory to Discovery ScienceOsamu Watanabe. 134-148 [doi]
• Bounded Depth Arithmetic Circuits: Counting and ClosureEric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh. 149-158 [doi]
• Parametric Temporal Logic for Model Measuring Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled. 159-168 [doi]
• Communicating Hierarchical State MachinesRajeev Alur, Sampath Kannan, Mihalis Yannakakis. 169-178 [doi]
• Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching ProgramsAlexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim. 179-189 [doi]
• General Morphisms of Petri Nets (Extended Abstract)Marek A. Bednarczyk, Andrzej M. Borzyszkowski. 190-199 [doi]
• On Some Tighter Inapproximability Results (Extended Abstract)Piotr Berman, Marek Karpinski. 200-209 [doi]
• Decomposition and Composition of Timed AutomataPatricia Bouyer, Antoine Petit. 210-219 [doi]
• New Applications of the Incompressibility MethodHarry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi. 220-229 [doi]
• Mobility Types for Mobile AmbientsLuca Cardelli, Andrew D. Gordon, Giorgio Ghelli. 230-239 [doi]
• Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov ChainsPeter Clote. 240-249 [doi]
• Decidable Fragments of Simultaneous Rigid ReachabilityVéronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes. 250-260 [doi]
• Text Compression Using AntidictionariesMaxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi. 261-270 [doi]
• Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NPAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano. 271-280 [doi]
• Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking ProblemMartin Dickhöfer, Thomas Wilke. 281-290 [doi]
• Space Time Tradeoffs for Graph PropertiesYevgeniy Dodis, Sanjeev Khanna. 291-300 [doi]
• Boundedness of Reset P/T NetsCatherine Dufourd, Petr Jancar, Ph. Schnoebelen. 301-310 [doi]
• Two-Way Finite State Transducers and Monadic Second-Order LogicJoost Engelfriet, Hendrik Jan Hoogeboom. 311-320 [doi]
• Partially Ordered Regular Languages for Graph QueriesSergio Flesca, Sergio Greco. 321-330 [doi]
• Deciding First-Order Properties of Locally Tree-Decomposalbe GraphsMarkus Frick, Martin Grohe. 331-340 [doi]
• Comparison of Process Algebra Equivalences Using FormatsVashti Galpin. 341-350 [doi]
• Compact Routing Tables for Graphs of Bounded GenusCyril Gavoille, Nicolas Hanusse. 351-360 [doi]
• Computing LOGCFL CertificatesGeorg Gottlob, Nicola Leone, Francesco Scarcello. 361-371 [doi]
• Efficient Techniques for Maintaining Multidimensional Keys in Linked Data StructuresRoberto Grossi, Giuseppe F. Italiano. 372-381 [doi]
• On the Complements of Partial k-TreesArvind Gupta, Damon Kaller, Thomas C. Shermer. 382-391 [doi]
• Approximation Results for Kinetic Variants of TSPMikael Hammar, Bengt J. Nilsson. 392-401 [doi]
• Distributed Probabilistic Polling and Applications to Proportionate AgreementYehuda Hassin, David Peleg. 402-411 [doi]
• Bisimulation Equivanlence Is Decidable for Normed Process AlgebraYoram Hirshfeld, Mark Jerrum. 412-421 [doi]
• A Framework for Decidable Metrical LogicsYoram Hirshfeld, Alexander Moshe Rabinovich. 422-432 [doi]
• On the Power of Las Vegas II. Two-Way Finite AutomataJuraj Hromkovic, Georg Schnitger. 433-442 [doi]
• Stable Marriage with Incomplete Lists and TiesKazuo Iwama, David Manlove, Shuichi Miyazaki, Yasufumi Morita. 443-452 [doi]
• Average-Case Complexity of ShellsortTao Jiang, Ming Li, Paul M. B. Vitányi. 453-462 [doi]
• Linear-Time Construction of Two-Dimensional Suffix TreesDong Kyue Kim, Kunsoo Park. 463-472 [doi]
• A Connection between the Star Problem and the Finite Power Property in Trace MonoidsDaniel Kirsten. 473-482 [doi]
• Two Techniques in the Area of the Star ProblemDaniel Kirsten, Jerzy Marcinkowski. 483-492 [doi]
• Approximations by OBDDs and the Variable Ordering ProblemMatthias Krause, Petr Savický, Ingo Wegener. 493-502 [doi]
• Simulation Preorder on Simple Process AlgebrasAntonín Kucera, Richard Mayr. 503-512 [doi]
• Solos in ConcertCosimo Laneve, Björn Victor. 513-523 [doi]
• Shortest Anisotropic Paths on TerrainsMark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack. 524-533 [doi]
• Relations between Local and Global Periodicity of WordsArto Lepistö. 534-543 [doi]
• Efficient Merging, Construction, and Maintenance of Evolutionary TreesAndrzej Lingas, Hans Olsson, Anna Östlin. 544-553 [doi]
• Formalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive ConstructionsMarino Miculan. 554-564 [doi]
• Leader Election by d Dimensional Cellular AutomataCodrin M. Nichitiu, Eric Rémila. 565-574 [doi]
• New Upper Bounds for MaxSatRolf Niedermeier, Peter Rossmanith. 575-584 [doi]
• Polynomial and Rational Evaluation and Interpolation (with Structured Matrices)Vadim Olshevsky, Victor Y. Pan. 585-594 [doi]
• Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup TimeRasmus Pagh. 595-604 [doi]
• Finite Automata with Generalized Acceptance CriteriaTimo Peichl, Heribert Vollmer. 605-614 [doi]
• A Variant of the Arrow Distributed Directory with Low Average ComplexityDavid Peleg, Eilon Reshef. 615-624 [doi]
• Closed Freyd- and kappa-categoriesJohn Power, Hayo Thielecke. 625-634 [doi]
• Typed Exeptions and Continuations Cannot Macro-Express Each OtherJon G. Riecke, Hayo Thielecke. 635-644 [doi]
• Automata, Power Series, and Coinduction: Taking Input Derivatives SeriouslyJan J. M. M. Rutten. 645-654 [doi]
• Accessing Multiple Sequences Through Set Associative CachesPeter Sanders. 655-664 [doi]
• T(A) = T(B)?Géraud Sénizergues. 665-675 [doi]
• Many-Valued Logics and Holographic ProofsMario Szegedy. 676-686 [doi]
• On the Complexity and Inapproximability of Shortest Implicant ProblemsChristopher Umans. 687-696 [doi]
• The Wave Propagator Is Turing ComputableKlaus Weihrauch, Ning Zhong 0002. 697-707 [doi]
• An FPTAS for Agreeably Weighted Variance on a Single MachineGerhard J. Woeginger. 707-716 [doi]
• Erratum: Bulk-synchronous Parallel Multiplication of Boolean MatricesAlexandre Tiskin. 717-718 [doi]