Theory of Computing Systems, Volume 34

Volume 34, Number 1, 2001

• Alan L. Selman:
  Editorial Statement. 1
  Electronic Edition (Springer LINK) BibTeX
• Evangelos Kranakis, Danny Krizanc, Flaminia L. Luccio:
  On Recognizing a String on an Anonymous Ring. 3-12
  Electronic Edition (Springer LINK) BibTeX
• Valmir C. Barbosa, Mario R. F. Benevides, Felipe M. G. França:
  Sharing Resources at Nonuniform Access Rates. 13-26
  Electronic Edition (Springer LINK) BibTeX
• Pierre B. A. Lecomte, Michel Rigo:
  Numeration Systems on a Regular Language. 27-44
  Electronic Edition (Springer LINK) BibTeX
• Thomas Noll, Heiko Vogler:
  The Universality of Higher-Order Attributed Tree Transducers. 45-75
  Electronic Edition (Springer LINK) BibTeX
• Michael Mitzenmacher:
  Analyses of Load Stealing Models Based on Families of Differential Equations. 77-98
  Electronic Edition (Springer LINK) BibTeX

Volume 34, Number 2, 2001

• Sanguthevar Rajasekaran:
  A Framework for Simple Sorting Algorithms on Parallel Disk Systems. 101-114
  Electronic Edition (Springer LINK) BibTeX
• Nimar S. Arora, Robert D. Blumofe, C. Greg Plaxton:
  Thread Scheduling for Multiprogrammed Multiprocessors. 115-144
  Electronic Edition (Springer LINK) BibTeX
• Wolfgang Dittrich, David A. Hutchinson, Anil Maheshwari:
  Blocking in Parallel Multisearch Problems. 145-189
  Electronic Edition (Springer LINK) BibTeX

Volume 34, Number 3, 2001

• Daniel Kirsten, Gwénaël Richomme:
  Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. 193-227
  Electronic Edition (Springer LINK) BibTeX
• Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
  An Improved Stability Bound for Binary Exponential Backoff. 229-244
  Electronic Edition (Springer LINK) BibTeX
• Lance Fortnow, Aduri Pavan, Alan L. Selman:
  Distributionally Hard Languages. 245-261
  Electronic Edition (Springer LINK) BibTeX
• Juha Honkala:
  A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem. 263-272
  Electronic Edition (Springer LINK) BibTeX

Volume 34, Number 4, 2001

• Pilar de la Torre, Clyde P. Kruskal:
  Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search. 275-298
  Electronic Edition (Springer LINK) BibTeX
• Didier Caucal, Teodor Knapik:
  An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs. 299-336
  Electronic Edition (Springer LINK) BibTeX
• Sung Kwon Kim, Chan-Su Shin:
  Computing the Optimal Bridge between Two Polygons. 337-352
  Electronic Edition (Springer LINK) BibTeX
• Ronald I. Becker, Isabella Lari, Mario Lucertini, Bruno Simeone:
  A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders. 353-374
  Electronic Edition (Springer LINK) BibTeX
• Arturo Carpi, Aldo de Luca, Stefano Varricchio:
  Special Factors and Uniqueness Conditions in Rational Trees. 375-395
  Electronic Edition (Springer LINK) BibTeX