Theoretical Computer Science
, Volume 66
Volume 66, Number 1, 1989
Thomas Lehmkuhl
,
Thomas Lickteig
: On the Order of Approximation in Approximative Triadic Decompositions of Tensors. 1-14
BibTeX
Paul E. S. Dunne
: On Monotone Simulations of Nonmonotone Networks. 15-25
BibTeX
Adolfo Piperno
: Abstraction Problems in Combinatory Logic a Compositive Approach. 27-43
BibTeX
Jarkko Kari
: Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms. 45-53
BibTeX
Zhang Luo Xin
: A Efficient Algorithm to Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group. 55-63
BibTeX
Rieks op den Akker
: On LC(0) Grammars and Languages. 65-85
BibTeX
Alasdair Urquhart
: The Complexity of Gentzen Systems for Propositional Logic. 87-97
BibTeX
Richard Statman
: On Sets of Solutions to Combinator Equations. 99-104
BibTeX
Andrzej Pelc
: Weakly Adaptive Comparison Searching. 105-111
BibTeX
Daniele Mundici
: Functions Computed by Monotone Boolean Formulas with no Repeated Variables. 113-114
BibTeX
Volume 66, Number 2, 1989
Selected Papers from ICALP 1987, Karlsruhe
Volker Diekert
: On the Knuth-Bendix Completion for Concurrent Processes. 117-136
BibTeX
Martin Dietzfelbinger
: Lower Bounds for Sorting of Sums. 137-155
BibTeX
Herbert Edelsbrunner
,
Günter Rote
,
Emo Welzl
: Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. 157-180
BibTeX
Christos Levcopoulos
,
Andrzej Lingas
,
Jörg-Rüdiger Sack
: Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems. 181-203
BibTeX
M. A. Nait Abdallah
: A Logico-Algebraic Approach to the Model Theory of Knowledge. 205-232
BibTeX
Volume 66, Number 3, 1989
Pascal Weil
: Inverse Monoids of Dot-Depth Two. 233-245
BibTeX
Hideki Yamasaki
: Language-Theoretical Representations of omega-Languages. 247-254
BibTeX
Dana Angluin
,
William I. Gasarch
,
Carl H. Smith
: Training Sequences. 255-272
BibTeX
Akira Ito
,
Katsushi Inoue
,
Itsuo Takanami
: Deterministic Two-Dimensional On-Line Tessellation Acceptors are Equivalent to Two-Way Two-Dimensional Alternating Finite Automata Through 180°-Rotation. 273-287
BibTeX
G. Jacopini
,
P. Mentrasti
: Generation of Invertible Functions. 289-297
BibTeX
Johann A. Makowsky
,
Ildikó Sain
: Weak Second Order Characterizations of Various Program Verification Systems. 299-321
BibTeX
Mohamed Mezghiche
: On Pseudo-c-beta-Normal Form in Combinatory Logic. 323-331
BibTeX
Michael L. Tiomkin
: Probabilistic Termination Versus Fair Termination. 333-340
BibTeX
Juha Honkala
: A Necessary Condition for the Rationality of the Zeta Function of a Regular Language. 341-347
BibTeX
Copyright ©
Sun May 17 00:23:59 2009 by
Michael Ley
(
ley@uni-trier.de
)