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: Author="King, K.N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Alternating multihead finite automata
K.N. King
Theoretical Computer Science
61
, 1988, pp. 149-174
An optimal algorithm for sink-finding
K.N. King
,
B. Smith-Thomas
Information Processing Letters
14
(3), 1982, May, pp. 109-111
Measures of parallelism in alternating computation trees
K.N. King
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 189-201
Alternating multihead finite automata
K.N. King
Lecture Notes in Computer Science
115
, 1981, pp. 506-520
Iteration theorems for families of strict deterministic languages
K.N. King
Theoretical Computer Science
10
(3), 1980, pp. 317-333
Stack languages and
\log n
space
K.N. King
,
C. Wrathall
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 281-299