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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complete classes of automata for the
\alpha_0
-product
Z. ésik
,
P. Domosi
Theoretical Computer Science
47
(1), 1986, pp. 1-14
Real-time, pseudo real-time, and linear-time ITA
K. Culik II
,
Sheng Yu
Theoretical Computer Science
47
(1), 1986, pp. 15-26
The problems of cyclic equality and conjugacy for finite complete rewriting systems
P. Narendran
,
F. Otto
Theoretical Computer Science
47
(1), 1986, pp. 27-38
Rational equivalence relations
J.H. Johnson
Theoretical Computer Science
47
(1), 1986, pp. 39-60
Lie patterns in search procedures
A. Pelc
Theoretical Computer Science
47
(1), 1986, pp. 61-69
The equivalence of finite valued transducers (on HDT0L languages) is decidable
Karel Culik II
,
Juhani Karhumäki
Theoretical Computer Science
47
(1), 1986, pp. 71-84
NP
is as easy as detecting unique solutions
L.G. Valiant
,
V.V. Vazirani
Theoretical Computer Science
47
(1), 1986, pp. 85-93
On the complementation of Buchi Automata
J.-P. Pecuchet
Theoretical Computer Science
47
(1), 1986, pp. 95-98
On polynomials with symmetric Galois group which are easy to compute
J. Heintz
Theoretical Computer Science
47
(1), 1986, pp. 99-105
On the size of unambiguous context-free grammars
P. Wyrostek
Theoretical Computer Science
47
(1), 1986, pp. 107-110
On nondeterminism in parallel computation
P.W. Dymond
Theoretical Computer Science
47
(2), 1986, pp. 111-120
A classification of complexity core lattices
P. Orponen
Theoretical Computer Science
47
(2), 1986, pp. 121-130
Some observations on the connection between counting and recursion
K.W. Wagner
Theoretical Computer Science
47
(2), 1986, pp. 131-147
Finite automata and unary languages
M. Chrobak
Theoretical Computer Science
47
(2), 1986, pp. 149-158
Subword topology
V.R. Dare
,
R. Siromoney
Theoretical Computer Science
47
(2), 1986, pp. 159-168
On simple and creative sets in NP
S. Homer
Theoretical Computer Science
47
(2), 1986, pp. 169-180
Le calcul rapide des mélanges de deux mots
Jean-Claude Spehner
Theoretical Computer Science
47
(2), 1986, pp. 181-203
Searching and pebbling
L.M. Kirousis
,
C.H. Papadimitriou
Theoretical Computer Science
47
(2), 1986, pp. 205-218
Self-embedding indexed grammars
R. Parchmann
,
J. Duske
Theoretical Computer Science
47
(2), 1986, pp. 219-223
The undecidability of self-embedding for finite semi-Thue and Thue systems
F. Otto
Theoretical Computer Science
47
(2), 1986, pp. 225-232
Two time-space tradeoffs for element distinctness
M. Karchmer
Theoretical Computer Science
47
(3), 1986, pp. 237-246
Balance of many-valued transductions and equivalence problems
Y. Maon
,
A. Yehudai
Theoretical Computer Science
47
(3), 1986, pp. 247-262
One one-way functions and polynomial-time isomorphisms
Ker-I Ko
,
T.J. Long
,
D.-Z. Du
Theoretical Computer Science
47
(3), 1986, pp. 263-276
Parallel ear decomposition search (EDS) and
st
-numbering in graphs
Y. Maon
,
B. Schieber
,
U. Vishkin
Theoretical Computer Science
47
(3), 1986, pp. 277-298
On the continued fraction representation of computable real numbers
Ker-I Ko
Theoretical Computer Science
47
(3), 1986, pp. 299-313
Seiten 1
2
>