Theoretical Computer Science, Volume 99

Volume 99, Number 1, 1992

Virgil Emil Cazanescu, Gheorghe Stefanescu: A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization. 1-63 BibTeX
James Hein: Completions of Perpetual Logic Programs. 65-78 BibTeX
Jean-Luc Lambert: A Structure to Decide Reachability in Petri Nets. 79-104 BibTeX
Wim H. Hesselink: Processes and Formalism for Unbounded Choice. 105-119 BibTeX
Lutz Priese, Doris Nolte: Strong Fairness and Ultra Metrics. 121-140 BibTeX
Philip S. Mulry: Monads and Algebras in the Semantics or Partial Data Types. 141-155 BibTeX
Sanguthevar Rajasekaran, John H. Reif: Nested Annealing: A Provable Improvement to Simulated Annealing. 157-176 BibTeX

Symeon Bozapalidis: Alphabetic Tree Relations. 177-211 BibTeX
Jyrki Nummenmaa: Constructing Compact Rectilinear Planar Layouts Using Canonical Representation of Planar Graphs. 213-230 BibTeX
Jean Neraud: On the Rank of the Subsets of a Free Monoid. 231-241 BibTeX
Oscar H. Ibarra, Nicholas Q. Trân: On Space-Bounded Synchronized Alternating Turing Machines. 243-264 BibTeX
Shuhua Zhang: Efficient Simplicity Testing of Automata. 265-278 BibTeX
José L. Balcázar, Uwe Schöning: Logarithmic Advice Classes. 279-290 BibTeX
Stefano Varricchio: On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series. 291-299 BibTeX
Oscar H. Ibarra, Tao Jiang, Hui Wang: A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. 301-313 BibTeX
Jean-Denis Fouks: Tseitin's Formula Revisited. 315-326 BibTeX
Brigitte Mossé: Puissances de mots et reconnaissabilité des point fixes d'une substitution. 327-334 BibTeX
Chính T. Hoàng: A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. 335-344 BibTeX