External Links

    Journal: Theory Comput. Syst.

    Volume 30, Issue 6

    523 -- 546Gianfranco Bilardi, Franco P. Preparata. Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
    547 -- 558Frank K. H. A. Dehne, Xiaotie Deng, Patrick W. Dymond, Andreas Fabri, Ashfaq A. Khokhar. A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
    559 -- 582Frank Thomson Leighton, Yuan Ma, Torsten Suel. On Probabilistic Networks for Selection, Merging, and Sorting
    583 -- 597Charles E. Leiserson, Keith H. Randall. Parallel Algorithms for the Circuit Value Update Problem
    599 -- 626Philip D. MacKenzie. Lower Bounds for Randomized Exclusive Write PRAMs
    627 -- 644Friedhelm Meyer auf der Heide, Martin Storch, Rolf Wanka. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
    645 -- 670Nir Shavit, Dan Touitou. Elimination Trees and the Construction of Pools and Stacks

    Volume 30, Issue 5

    447 -- 474Shimon Even, Sergio Rajsbaum. The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks
    475 -- 494Hsu-Chun Yen, Bow-Yaw Wang, Ming-Sheng Yang. Deciding a Class of Path Formulas for Conflict-Free Petri Nets
    495 -- 518Christoph Meinel, Anna Slobodová. A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams

    Volume 30, Issue 4

    335 -- 354Hendrik Jan Hoogeboom, Paulien ten Pas. Monadic Second-Order Definable Text Languages
    355 -- 366Carsten Damm, Markus Holzer, Peter Rossmanith. Expressing Uniformity via Oracles
    367 -- 382Luis B. Morales. Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices
    383 -- 422Jean-Eric Pin, Pascal Weil. Ponynominal Closure and Unambiguous Product
    423 -- 428Uwe Schöning. Complexity of Presburger Arithmetic with Fixed Quantifier Dimension
    429 -- 442Jack H. Lutz. Observations on Measure and Lowness for /Delta^p_2

    Volume 30, Issue 3

    223 -- 229Eric Goles Ch., Martín Matamala. Reaction-Diffusion Automata: Three States Implies Universality
    231 -- 247Andrea Pietracaprina, Geppino Pucci. The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines
    249 -- 283Vijay V. Raghavan, Dawn Wilkins. A Characterization and Nearly Linear-Time Equivalence Test for µ-Branching Programs
    285 -- 331Jean-Paul Allouche, E. Cateland, W. J. Gilbert, Heinz-Otto Peitgen, Jeffrey Shallit, Guentcho Skordev. Automatic Maps in Exotic Numeration System

    Volume 30, Issue 2

    113 -- 119Moti Frances, Ami Litman. On Covering Problems of Codes
    121 -- 134Nicholas Pippenger. Regular Languages and Stone Duality
    135 -- 143Hans-Jörg Burtschick, W. Lindner. On Sets Turing Reducible to p-Selective Sets
    145 -- 163Violet R. Syrotiuk, Charles J. Colbourn, Jan K. Pachl. Wang Tilings and Distributed Verification on Anonymous Torus Networks
    165 -- 180Patrizio Cintioli, Riccardo Silvestri. Helping by Unambiguous Computation and Probabilistic Computation
    181 -- 196Kazuyuki Amano, Akira Maruoka. Approximation Algorithms for DNF Under Distributions with Limited Independence
    197 -- 220F. Point, Véronique Bruyère. On the Cobham-Semenov Theorem

    Volume 30, Issue 1

    1 -- 0Paul G. Spirakis. Editor's Foreword
    3 -- 37Andrea Pietracaprina, Franco P. Preparata. Practical Constructive Schemes for Deterministic Shared-Memory Access
    39 -- 49Christos Kaklamanis, Danny Krizanc, Satish Rao. New Graph Decompositions with Applications to Emulations
    51 -- 65Lenwood S. Heath. Graph Embeddings and Simplicial Maps
    67 -- 90James Haralambides, Fillia Makedon. Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees
    91 -- 109Ioan I. Macarie. Multihead Two-Way Probabilistic Finite Automata
    runs on