Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A generalization of automatic sequences
Jeffrey Shallit
Theoretical Computer Science
61
, 1988, pp. 1-16
Critical classes for the
\alpha_0
-product
Pál Dömösi
,
Zoltán ésik
Theoretical Computer Science
61
, 1988, pp. 17-24
On a subclass of
\infty
-regular languages
Ivan Mezník
Theoretical Computer Science
61
, 1988, pp. 25-32
A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
Xin He
Theoretical Computer Science
61
, 1988, pp. 33-47
An optimistic ternary simulation of gate races
C.-J. Seger
,
J.A. Brzozowski
Theoretical Computer Science
61
, 1988, pp. 49-66
Comparison of two graph-rewrite systems
P.M. van den Broek
Theoretical Computer Science
61
, 1988, pp. 67-81
Implementing first-order rewriting with constructor systems
Satish Thatte
Theoretical Computer Science
61
, 1988, pp. 83-92
2-Asynchronous automata
Robert Cori
,
Eric Sopena
,
Michel Latteux
,
Yves Roos
Theoretical Computer Science
61
, 1988, pp. 93-102
The structure of generalized complexity cores
Ronald V. Book
,
Ding-Zhu Du
Theoretical Computer Science
61
, 1988, pp. 103-119
Parallel construction of perfect matchings and Hamiltonian cycles of dense graphs
Elias Dahlhaus
,
Marek Karpinski
Theoretical Computer Science
61
, 1988, pp. 121-136
Accepting conditions for automata on
\omega
-languages
Tetsuo Moriya
,
Hideki Yamasaki
Theoretical Computer Science
61
, 1988, pp. 137-147
Alternating multihead finite automata
K.N. King
Theoretical Computer Science
61
, 1988, pp. 149-174
Algorithms for plane representations of acyclic digraphs
Giuseppe Di Battista
,
Roberto Tamassia
Theoretical Computer Science
61
, 1988, pp. 175-198
The equational theory of pomsets
Jay L. Gischer
Theoretical Computer Science
61
, 1988, pp. 199-224
Extraction and verification of programs by analysis of formal proofs
Werner Alexi
Theoretical Computer Science
61
, 1988, pp. 225-258
Determinism and looping in combinatory PDL
George Gargov
,
Solomon Passy
Theoretical Computer Science
61
, 1988, pp. 259-277
Ein Satz über die Entropie von Untermonoiden (A theorem on the entropy of submonoids)
Ludwig Staiger
Theoretical Computer Science
61
, 1988, pp. 279-282
A closure property of regular languages
Thomas Kretschmer
Theoretical Computer Science
61
, 1988, pp. 283-287
Logical definability of fixed points
André Arnold
Theoretical Computer Science
61
, 1988, pp. 289-297
Bilinear mincing rank
Edward G. Belaga
Theoretical Computer Science
61
, 1988, pp. 299-306
On finding a minimum dominating set in a tournament
Nimrod Megiddo
,
Uzi Vishkin
Theoretical Computer Science
61
, 1988, pp. 307-316