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=145
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Pattern growth in elementary cellular automata
G. Braga
,
G. Cattaneo
,
P. Flocchini
,
C. Quaranta Vogliotti
Theoretical Computer Science
145
(1-2), 1995, pp. 1-26
Fundamental study: Pattern growth in elementary cellular automata
G. Braga
,
G. Cattaneo
,
P. Flocchini
,
C. Quaranta Vogliotti
Theoretical Computer Science
145
(1-2), 1995, pp. 1-26
Optimal parallel algorithms for path problems on planar graphs
G. Srikrishna
,
C. Pandu Rangan
Theoretical Computer Science
145
(1-2), 1995, pp. 27-43
On the size of binary decision diagrams representing Boolean functions
Y. Breitbart
,
H. Hunt III
,
D. Rosenkrantz
Theoretical Computer Science
145
(1-2), 1995, pp. 45-69
Implicit language equations: Existence and uniqueness of solutions
Ernst L. Leiss
Theoretical Computer Science
145
(1-2), 1995, pp. 71-93
Anonymous wireless rings
Krzysztof Diks
,
Evangelos Kranakis
,
Adam Malinowski
,
Andrzej Pelc
Theoretical Computer Science
145
(1-2), 1995, pp. 95-109
The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness
Nadia Creignou
Theoretical Computer Science
145
(1-2), 1995, pp. 111-145
Complete problems for monotone NP
Iain A. Stewart
Theoretical Computer Science
145
(1-2), 1995, pp. 147-157
Generating self-affine fractals by collage grammars
F. Drewes
,
A. Habel
,
H.-J. Kreowski
,
S. Taubenberger
Theoretical Computer Science
145
(1-2), 1995, pp. 159-187
Using multiset discrimination to solve language processing problems without hashing
Jiazhen Cai
,
Robert Paige
Theoretical Computer Science
145
(1-2), 1995, pp. 189-228
Variétés et fonctions rationnelles
Christophe Reutenauer
,
Marcel Paul Schützenberger
Theoretical Computer Science
145
(1-2), 1995, pp. 229-240
A polynomial-time computable curve whose interior has a nonrecursive measure
Ker-I Ko
Theoretical Computer Science
145
(1-2), 1995, pp. 241-270
Tight bounds on the round complexity of distributed 1-solvable tasks
Ofer Biran
,
Shlomo Moran
,
Shmuel Zaks
Theoretical Computer Science
145
(1-2), 1995, pp. 271-290
Interval queries on object histories
Seymour Ginsburg
,
Katsumi Tanaka
Theoretical Computer Science
145
(1-2), 1995, pp. 291-316
On finding minimal, maximal, and consistent sequences over a binary alphabet
Martin Middendorf
Theoretical Computer Science
145
(1-2), 1995, pp. 317-327
A linear-time recognition algorithm for
P_4
-reducible graphs
B. Jamison
,
S. Olariu
Theoretical Computer Science
145
(1-2), 1995, pp. 329-344
Completion of recognizable bifix codes
Liang Zhang
,
Zhonghui Shen
Theoretical Computer Science
145
(1-2), 1995, pp. 345-355
A space efficient algorithm for finding the best nonoverlapping alignment score
Gary Benson
Theoretical Computer Science
145
(1-2), 1995, pp. 357-369
P
-selectivity: Intersections and indices
Lane A. Hemaspaandra
,
Zhigen Jiang
Theoretical Computer Science
145
(1-2), 1995, pp. 371-380
Independent sets versus perfect matchings
Shang-Hua Teng
Theoretical Computer Science
145
(1-2), 1995, pp. 381-390
A decomposition theorem for probabilistic transition systems
Oded Maler
Theoretical Computer Science
145
(1-2), 1995, pp. 391-396