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=88
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Strong and robustly strong polynomial-time reducibilities to sparse sets
Ricard Gavaldá
,
José L. Balcázar
Theoretical Computer Science
88
, 1991, pp. 1-14
Partial specifications and compositional verification
Kim G. Larsen
,
Bent Thomsen
Theoretical Computer Science
88
, 1991, pp. 15-32
\Delta_2^p
-complete lexicographically first maximal subgraph problems
Satoru Miyano
Theoretical Computer Science
88
, 1991, pp. 33-57
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
Maxime Crochemore
,
Wojciech Rytter
Theoretical Computer Science
88
, 1991, pp. 59-82
The complexity of Grigorchuk groups with application to cryptography
Max Garzon
,
Yechezkel Zalcstein
Theoretical Computer Science
88
, 1991, pp. 83-98
Finite automaton aperiodicity is PSPACE-complete
Sang Cho
,
Dung T. Huynh
Theoretical Computer Science
88
, 1991, pp. 99-116
A graph-based regularity test for deterministic context-free languages
Pritti Shankar
,
B.S. Adiga
Theoretical Computer Science
88
, 1991, pp. 117-125
A deterministic algorithm for modular knapsack problems
Arto Salomaa
Theoretical Computer Science
88
, 1991, pp. 127-138
A regular characterization of graph languages definable in monadic second-order logic
Joost Engelfriet
Theoretical Computer Science
88
, 1991, pp. 139-150
Graph grammars with path-controlled embedding
Kunio Aizawa
,
Akira Nakamura
Theoretical Computer Science
88
, 1991, pp. 151-170
Représentations des nombres réels par développements en base entière et complexité
Salah Labhalla
,
Henri Lombardi
Theoretical Computer Science
88
, 1991, pp. 171-182
Planar graph coloring is not self-reducible, assuming
P \neq NP
Samir Khuller
,
Vijay V. Vazirani
Theoretical Computer Science
88
, 1991, pp. 183-189
On multiple context-free grammars
Hiroyuki Seki
,
Takashi Matsumura
,
Mamoru Fujii
,
Tadao Kasami
Theoretical Computer Science
88
, 1991, pp. 191-229
A result about the power of geometric oracle machines
Ulrich Huckenbeck
Theoretical Computer Science
88
, 1991, pp. 231-251
A complete description for a monoid of deterministic bottom-up tree transformation classes
Z. Fülöp
Theoretical Computer Science
88
, 1991, pp. 253-268
Equivalence, reduction and minimization of finite automata over semirings
Kety Peeva
Theoretical Computer Science
88
, 1991, pp. 269-285
A note on real-time one-way alternating multicounter machines
Katsushi Inoue
,
Akira Ito
,
Itsuo Takanami
Theoretical Computer Science
88
, 1991, pp. 287-296
Separation of deterministic, nondeterministic and alternating complexity classes
Andrej Bebják
,
Ivana S̑tefáneková
Theoretical Computer Science
88
, 1991, pp. 297-311
On the algebraic complexity of rational iteration procedures
Walter Baur
Theoretical Computer Science
88
, 1991, pp. 313-324
On the degree of ambiguity of finite automata
Andreas Weber
,
Helmut Seidl
Theoretical Computer Science
88
, 1991, pp. 325-349
Extended automata-like regular expressions of star degree at most (2,1)
Heekeun Yoo
,
Kosaburo Hashiguchi
Theoretical Computer Science
88
, 1991, pp. 351-363
Fibonacci morphisms and Sturmian words
Patrice Séébold
Theoretical Computer Science
88
, 1991, pp. 365-384