Theoretical Computer Science, Volume 115

Volume 115, Number 1, 1993

• Richard Blute: Linear Logic, Coherence, and Dinaturality. 3-41 BibTeX
• Albert Burroni: Higher-Dimensional Word Problems with Applications to Equational Logic. 43-62 BibTeX
• Thierry Coquand: Another Proof of the Intuitionistic Ramsey Theorem. 63-75 BibTeX
• Abbas Edalat, Michael B. Smyth: I-Categories as a Framework for Solving Domain Equations. 77-106 BibTeX
• Peter J. Freyd: Structural Polymorphism. 107-129 BibTeX
• Grzegorz Jarzembski: Programs in Partial Algebras. 131-149 BibTeX
• C. Barry Jay: Tail Recursion Through Universal Invariants. 151-189 BibTeX

Volume 115, Number 2, 1993

• Igor Litovsky, Yves Métivier: Computing with Graph Rewriting Systems with Priorities. 191-224 BibTeX
• Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer: Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. 225-241 BibTeX
• Arturo Carpi: Overlap-Free Words and Finite Automata. 243-260 BibTeX
• Oscar H. Ibarra, Nicholas Q. Trân: Synchronized Finite Automata and 2DFA Reductions. 261-275 BibTeX
• Luc Longpré, Alan L. Selman: Hard Promise Problems and Nonuniform Complexity. 277-290 BibTeX
• A. Troesch: Interprétation géométrique de l'algorithme d'Euclide et reconnaissance de segments. 291-319 BibTeX
• Eric Goles Ch., Marcos A. Kiwi: Games on Line Graphs and Sand Piles. 321-349 BibTeX
• R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan: Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs. 351-357 BibTeX
• Masashi Katsura, Yuji Kobayashi: The Shuffle Algebra and its Derivations. 359-369 BibTeX
• Shouwen Tang, Bin Fu, Tran Liu: Exponential-Time and Subexponential-Time Sets. 371-381 BibTeX
• Steven Homer, Stuart A. Kurtz, James S. Royer: On A-Truth-Table-Hard Languages. 383-389 BibTeX
• Sándor Vágvölgyi: A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language. 391-399 BibTeX