Abstract is missing.
- Algorithmic Verification of Linear Temporal Logic SpecificationsYonit Kesten, Amir Pnueli, Li-on Raviv. 1-16 [doi]
- On Existentially First-Order Definable Languages and Their Relation to NPBernd Borchert, Dietrich Kuske, Frank Stephan. 17-28 [doi]
- An Algebraic Approach to Communication ComplexityJean-François Raymond, Pascal Tesson, Denis Thérien. 29-40 [doi]
- Deciding Global Partial-Order PropertiesRajeev Alur, Kenneth L. McMillan, Doron Peled. 41-52 [doi]
- Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)Xinxin Liu, Scott A. Smolka. 53-66 [doi]
- Hardness Results for Dynamic Problems by Extensions of Fredman and Saks Chronogram MethodThore Husfeldt, Theis Rauhe. 67-78 [doi]
- Simpler and Faster Dictionaries on the AC:::0::: RAMTorben Hagerup. 79-90 [doi]
- Partial-Congruence Factorization of Bisimilarity Induced by Open MapsSlawomir Lasota. 91-102 [doi]
- Reset Nets Between Decidability and UndecidabilityCatherine Dufourd, Alain Finkel, Ph. Schnoebelen. 103-115 [doi]
- Geometric Algorithms for Robotic ManipulationMark H. Overmars. 116-117 [doi]
- Compact Encodings of Planar Graphs via Canonical Orderings and Multiple ParenthesesRichie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-I Lu. 118-129 [doi]
- Reducing Simple Polygons to Triangles - A Proof for an Improved ConjectureThorsten Graf, Kamakoti Veezhinathan. 130-139 [doi]
- Difficult Configurations - On the Complexity of LTrLIgor Walukiewicz. 140-151 [doi]
- On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)Bernard Boigelot, Stéphane Rassart, Pierre Wolper. 152-163 [doi]
- Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning TreesDavid Peleg. 164-175 [doi]
- Independent Sets with Domination ConstraintsMagnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle. 176-187 [doi]
- Robust Asynchronous Protocols Are Finite-StateMadhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni. 188-199 [doi]
- Deciding Bisimulation-Like Equivalences with Finite-State ProcessesPetr Jancar, Antonín Kucera, Richard Mayr. 200-211 [doi]
- Do Probabilistic Algorithms Outperform Deterministic Ones?Avi Wigderson. 212-214 [doi]
- A Degree-Decreasing Lemma for (MOD q - MOD p) CircuitsVince Grolmusz. 215-222 [doi]
- Improved Pseudorandom Generators for Combinatorial RectanglesChi-Jen Lu. 223-234 [doi]
- Translation Validation for Synchronous LanguagesAmir Pnueli, Ofer Strichman, Michael Siegel. 235-246 [doi]
- An Efficient and Unified Approach to the Decidability of Equivalence of Propositional ProgramsVladimir A. Zakharov. 247-258 [doi]
- On Branching Programs With Bounded Uncertainty (Extended Abstract)Stasys Jukna, Stanislav Zák. 259-270 [doi]
- CONS-Free Programs with Tree Input (Extended Abstract)Amir M. Ben-Amram, Holger Petersen. 271-282 [doi]
- Concatenable Graph Processes: Relating Processes and Derivation TracesPaolo Baldan, Andrea Corradini, Ugo Montanari. 283-295 [doi]
- Axioms for Contextual Net ProcessesFabio Gadducci, Ugo Montanari. 296-308 [doi]
- Existential Types: Logical Relations and Operational EquivalenceAndrew M. Pitts. 309-326 [doi]
- Optimal Sampling Strategies in QuicksortConrado Martínez, Salvador Roura. 327-338 [doi]
- A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency TablesMartin E. Dyer, Catherine S. Greenhill. 339-350 [doi]
- A Modular Approach to Denotational SemanticsJohn Power, Giuseppe Rosolini. 351-362 [doi]
- Generalised Flowcharts and GamesPasquale Malacaria, Chris Hankin. 363-374 [doi]
- Efficient Minimization of Numerical Summation ErrorsMing-Yang Kao, Jie Wang. 375-386 [doi]
- Efficient Approximation Algorithms for the Subset-Sums Equality ProblemCristina Bazgan, Miklos Santha, Zsolt Tuza. 387-396 [doi]
- Structural Recursive Definitions in Type TheoryEduardo Giménez. 397-408 [doi]
- A Good Class of Tree Automata and Application to Inductive Theorem ProvingDenis Lugiez. 409-420 [doi]
- Locally Periodic Infinite Words and a Chaotic BehaviourJuhani Karhumäki, Arto Lepistö, Wojciech Plandowski. 421-430 [doi]
- Bridges for Concatenation HierarchiesJean-Eric Pin. 431-442 [doi]
- Complete Proof Systems for Observation Congruences in Finite-Control pi-CalculusHuimin Lin. 443-454 [doi]
- Concurrent Constraints in the Fusion CalculusBjörn Victor, Joachim Parrow. 455-469 [doi]
- On Computing the Entropy of Cellular AutomataMichele d Amico, Giovanni Manzini, Luciano Margara. 470-481 [doi]
- On the Determinization of Weighted Finite AutomataAdam L. Buchsbaum, Raffaele Giancarlo, Jeffery Westbrook. 482-493 [doi]
- Bulk-Synchronous Parallel Multiplication of Boolean MatricesAlexandre Tiskin. 494-506 [doi]
- A Complex Example of a Simplifying Rewrite SystemHélène Touzet. 507-517 [doi]
- On a Duality Between Kruskal and Dershowitz TheoremsPaul-André Melliès. 518-529 [doi]
- A Total AC-Compatible Reduction Ordering on Higher-Order TermsDaria Walukiewicz. 530-542 [doi]
- Model Checking Game Properties of Multi-agent Systems (Abstract)Thomas A. Henzinger. 543 [doi]
- Limited Wavelength Conversion in All-Optical Tree NetworksLuisa Gargano. 544-555 [doi]
- Computing Mimicking NetworksShiva Chaudhuri, K. V. Subrahmanyam, Frank Wagner, Christos D. Zaroliagis. 556-567 [doi]
- Metric Semantics for True Concurrent Real TimeChristel Baier, Joost-Pieter Katoen, Diego Latella. 568-579 [doi]
- The Regular Real-Time LanguagesThomas A. Henzinger, Jean-François Raskin, Pierre Yves Schobbens. 580-591 [doi]
- Static and Dynamic Low-Congested Interval Routing SchemesSerafino Cicerone, Gabriele Di Stefano, Michele Flammini. 592-603 [doi]
- Low-Bandwidth Routing and Electrical Power NetworksDoug Cook, Vance Faber, Madhav V. Marathe, Aravind Srinivasan, Yoram J. Sussmann. 604-615 [doi]
- Constraint Automata and the Complexity of Recursive Subtype EntailmentFritz Henglein, Jakob Rehof. 616-627 [doi]
- Reasoning about The Past with Two-Way AutomataMoshe Y. Vardi. 628-641 [doi]
- A Neuroidal Architecture for Cognitive ComputationLeslie G. Valiant. 642-669 [doi]
- Deterministic Polylog Approximation for Minimum Communication Spanning TreesDavid Peleg, Eilon Reshef. 670-681 [doi]
- A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-ConnectivityArtur Czumaj, Andrzej Lingas. 682-694 [doi]
- Global/Local Subtyping and Capability Inference for a Distributed pi-calculusPeter Sewell. 695-706 [doi]
- Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-CalculusZhoujun Li, Huowang Chen. 707-718 [doi]
- Inversion of Circulant Matrices over Z::m::Dario Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara. 719-730 [doi]
- Application of Lempel-Ziv Encodings to the Solution of Words EquationsWojciech Plandowski, Wojciech Rytter. 731-742 [doi]
- Explicit Substitutions for Constructive NecessityNeil Ghani, Valeria de Paiva, Eike Ritter. 743-754 [doi]
- The Relevance of Proof-IrrelevanceGilles Barthe. 755-768 [doi]
- New Horizons in Quantum Information ProcessingGilles Brassard. 769-771 [doi]
- Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NPIvan Damgård, Birgit Pfitzmann. 772-783 [doi]
- Image Density is Complete for Non-Interactive-SZK (Extended Abstract)Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung. 784-795 [doi]
- Randomness SpacesPeter Hertling, Klaus Weihrauch. 796-807 [doi]
- Totality, Definability and Boolean CiruitsAntonio Bucciarelli, Ivano Salvo. 808-819 [doi]
- Quantum CountingGilles Brassard, Peter Høyer, Alain Tapp. 820-831 [doi]
- On the Complexity of Deriving Score Functions from Examples for Problems in Molecular BiologyTatsuya Akutsu, Mutsunori Yagiura. 832-843 [doi]
- A Hierarchy of Equivalences for Asynchronous CalculiCédric Fournet, Georges Gonthier. 844-855 [doi]
- On Asynchrony in Name-Passing CalculiMassimo Merro, Davide Sangiorgi. 856-867 [doi]
- Protection in Programming-Language TranslationsMartín Abadi. 868-883 [doi]
- Efficient Simulations by Queue MachinesHolger Petersen, John Michael Robson. 884-895 [doi]
- Power of Cooperation and Multihead Finite SystemsPavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys. 896-907 [doi]
- A Simple Solution to Type SpecializationOlivier Danvy. 908-917 [doi]
- Multi-Stage Programming: Axiomatization and Type SafetyWalid Taha, Zine-El-Abidine Benaissa, Tim Sheard. 918-929 [doi]