Theoretical Computer Science, Volume 145

Volume 145, Numbers 1&2, 10 July 1995

• G. Braga, G. Cattaneo, Paola Flocchini, C. Quaranta Vogliotti:
  Pattern Growth in Elementary Cellular Automata. 1-26
  Electronic Edition (link) BibTeX
• G. Srikrishna, C. Pandu Rangan:
  Optimal Parallel Algorithms for Path Problems on Planar Graphs. 27-43
  Electronic Edition (link) BibTeX
• Yuri Breitbart, Harry B. Hunt III, Daniel J. Rosenkrantz:
  On the Size of Binary Decision Diagrams Representing Boolean Functions. 45-69
  Electronic Edition (link) BibTeX
• Ernst L. Leiss:
  Implicit Language Equations: Existence and Uniqueness of Solutions. 71-93
  Electronic Edition (link) BibTeX
• Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc:
  Anonymous Wireless Rings. 95-109
  Electronic Edition (link) BibTeX
• Nadia Creignou:
  The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness. 111-145
  Electronic Edition (link) BibTeX
• Iain A. Stewart:
  Complete Problems for Monotone NP. 147-157
  Electronic Edition (link) BibTeX
• Frank Drewes, Annegret Habel, Hans-Jörg Kreowski, Stefan Taubenberger:
  Generating Self-Affine Fractals by Collage Grammars. 159-187
  Electronic Edition (link) BibTeX
• Jiazhen Cai, Robert Paige:
  Using Multiset Discrimination to Solve Language Processing Problems Without Hashing. 189-228
  Electronic Edition (link) BibTeX
• Christophe Reutenauer, Marcel Paul Schützenberger:
  Variétés et fonctions rationnelles. 229-240
  Electronic Edition (link) BibTeX
• Ker-I Ko:
  A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure. 241-270
  Electronic Edition (link) BibTeX
• Ofer Biran, Shlomo Moran, Shmuel Zaks:
  Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. 271-290
  Electronic Edition (link) BibTeX
• Seymour Ginsburg, Katsumi Tanaka:
  Interval Queries on Object Histories. 291-316
  Electronic Edition (link) BibTeX
• Martin Middendorf:
  On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet. 317-327
  Electronic Edition (link) BibTeX
• Beverly Jamison, Stephan Olariu:
  A Linear-Time Recognition Algorithm for P4-Reducible Graphs. 329-344
  Electronic Edition (link) BibTeX
• Liang Zhang, Zhonghui Shen:
  Completion of Recognizable Bifix Codes. 345-355
  Electronic Edition (link) BibTeX
• Gary Benson:
  A Space Efficient Algorithm for Finding the Best Nonoverlapping Alignment Score. 357-369
  Electronic Edition (link) BibTeX
• Lane A. Hemaspaandra, Zhigen Jiang:
  P-Selectivity: Intersections and Indices. 371-380
  Electronic Edition (link) BibTeX
• Shang-Hua Teng:
  Independent Sets Versus Perfect Matchings. 381-390
  Electronic Edition (link) BibTeX
• Oded Maler:
  A Decomposition Theorem for Probabilistic Transition Systems. 391-396
  Electronic Edition (link) BibTeX