Theoretical Computer Science
, Volume 93
Volume 93, Number 1, 1992
A. J. Kfoury
,
Jerzy Tiuryn
,
Pawel Urzyczyn
: On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. 1-41
BibTeX
Sándor Vágvölgyi
: Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead. 43-74
BibTeX
György E. Révész
: A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem. 75-89
BibTeX
Peter G. Harrison
,
Hessam Khoshnevisan
: A New Approach to Recursion Removal. 91-113
BibTeX
V. S. Subrahmanian
: Paraconsistent Disjunctive Deductive Databases. 115-141
BibTeX
Guo-Qiang Zhang
: Stable Neighbourboods. 143-157
BibTeX
Andreas Goerdt
: Unrestricted Resolution versus N-Resolution. 159-167
BibTeX
Volume 93, Number 2, 1992
Pierre Péladeau
: Logically Defined Subsets of N k. 169-183
BibTeX
Kunihiko Hiraishi
,
Atsunobu Ichikawa
: On Structural Conditions for Weak Persistency and Semilinearity of Petri Nets. 185-199
BibTeX
Guy Louchard
,
B. Randrianarimanana
,
René Schott
: Dynamic Algorithms in D.E. Knuth's Model: A Probabilistic Analysis. 201-225
BibTeX
Paola Bonizzoni
,
Giancarlo Mauri
: On Automata on Infinite Trees. 227-244
BibTeX
Zvi M. Kedem
,
Krishna V. Palem
: Optimal Parallel Algorithms for Forest and Term Matching. 245-264
BibTeX
Seinosuke Toda
: Restricted Relativizations of Probablistic Polynomial Time. 265-277
BibTeX
Prakash V. Ramanan
: Testing the Optimality of Alphabetic Trees. 279-301
BibTeX
Joan Boyar
,
Gudmund Skovbjerg Frandsen
,
Carl Sturtivant
: An Arithmetic Model of Computation Equivalent to Threshold Circuits. 303-319
BibTeX
Patrick Dehornoy
: A Criterion for Proving Noetherianity of a Relation. 321-325
BibTeX
Thomas Herbst
: On a Kind of Fatou Property of Context-Free Groups. 327-331
BibTeX
Copyright ©
Sun May 17 00:24:05 2009 by
Michael Ley
(
ley@uni-trier.de
)