External Links

    Journal: Theory Comput. Syst.

    Volume 28, Issue 6

    487 -- 514William I. Gasarch, Mark W. Krentel, Kevin J. Rappoport. OptP as the Normal Behavior of NP-Complete Problems
    515 -- 552Bruno Courcelle, Joost Engelfriet. A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars
    553 -- 564Matthias Krause, Stephan Waack. Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In

    Volume 28, Issue 5

    387 -- 395Franz Aurenhammer, Johann Hagauer. Recognizing Binary Hamming Graphs in O(n² log n) Time
    397 -- 420Christian Choffrut, Leucio Guerra. Logical Definability of Some Rational Trace Languages
    421 -- 435Shimon Even, Sergio Rajsbaum. Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer
    437 -- 450Christian Choffrut, Massimiliano Goldwurm. Rational Transductions and Complexity of Counting Problems
    451 -- 468Jeffery Westbrook, Dicky C. K. Yan. The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems
    469 -- 486Amos Israeli, Amnon Shaham, Asaf Shirazi. Linear-Time Snapshot Implementations in Unbalanced Systems

    Volume 28, Issue 4

    283 -- 298Frederic Green. A Lower Bound for Monotone Perceptrons
    299 -- 327Timothy J. Long, Ming-Jye Sheu. A Refinement of the Low and High Hierarchies
    329 -- 339Maciej Liskiewicz. On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals
    341 -- 361Celia Wrathall, Volker Diekert. On Confluence of One-Rule Trace-Rewriting Systems
    363 -- 384Friedrich Otto. On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems

    Volume 28, Issue 3

    173 -- 198Richard Chang, Jim Kadin. On Computing Boolean Connectives of Characteristic Functions
    199 -- 213Michael A. Palis, Sunil M. Shende. Pumping Lemmas for the Control Language Hierarchy
    215 -- 228Jeff I. Chu, Georg Schnitger. Communication Complexity of Matrix Computation over Finite Fields
    229 -- 243Kenneth W. Regan, James S. Royer. On Closure Properties of Bounded Two-Sided Error Complexity Classes
    245 -- 266Emanuela Fachini, Jozef Gruska, Margherita Napoli, Domenico Parente. Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata
    267 -- 279Sanjay Jain, Arun Sharma. Prudence in Vacillatory Language Identification

    Volume 28, Issue 2

    89 -- 108Alberto Apostolico, Maxime Crochemore. Fast Parallel Lyndon Factorization with Applications
    109 -- 116Jie Wang. Productive Functions and Isomorphisms
    117 -- 140Carme Àlvarez, José L. Balcázar, Birgit Jenner. Adaptive Logspace Reducibility and Parallel Time
    141 -- 172Jyrki Kivinen. Learning Reliably and with One-Sided Error

    Volume 28, Issue 1

    1 -- 11Prabhakar Raghavan. Robust Algorithms for Packet Routing in a Mesh
    13 -- 20Josep Rifà, Joan Borrell. A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields
    21 -- 39Christoph Meinel, Stephan Waack. Separating Complexity Classes Related to Bounded Alternating /omega-Branching Programs
    41 -- 65Igor Litovsky, Yves Métivier, Eric Sopena. Different Local Controls for Graph Relabeling Systems
    67 -- 88Hubert Comon. On Unification of Terms with Integer Exponents
    runs on