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=188
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal binary search trees
S.V. Nagaraj
Theoretical Computer Science
188
(1-2), 1997, pp. 1-44
Linear speed-up for cellular automata synchronizers and applications
Olivier Heen
Theoretical Computer Science
188
(1-2), 1997, pp. 45-57
Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
Sandeep Sen
Theoretical Computer Science
188
(1-2), 1997, pp. 59-78
Approximate testing and its relationship to learning
Kathleen Romanik
Theoretical Computer Science
188
(1-2), 1997, pp. 79-99
Gap-languages and log-time complexity classes
Kenneth W. Regan
,
Heribert Vollmer
Theoretical Computer Science
188
(1-2), 1997, pp. 101-116
On the power of circuits with gates of low
L_1
norms
Vince Grolmusz
Theoretical Computer Science
188
(1-2), 1997, pp. 117-128
Complexity of tile rotation problems
Eric Goles
,
Iván Rapaport
Theoretical Computer Science
188
(1-2), 1997, pp. 129-159
On sequences resulting from iteration of modified quadratic and palindromic mappings
Anton C̑erný
Theoretical Computer Science
188
(1-2), 1997, pp. 161-174
Kolmogorov numberings and minimal identification
Rusins Freivalds
,
Sanjay Jain
Theoretical Computer Science
188
(1-2), 1997, pp. 175-194
Automaticity of double sequences generated by one-dimensional linear cellular automata
J.-P. Allouche
,
F. von Haeseler
,
H.-O. Peitgen
,
A. Petersen
,
G. Skordev
Theoretical Computer Science
188
(1-2), 1997, pp. 195-209
A short proof of representability of fork algebras
Viktor Gyuris
Theoretical Computer Science
188
(1-2), 1997, pp. 211-220
Optimal algorithms for generalized searching in sorted matrices
Hong Shen
Theoretical Computer Science
188
(1-2), 1997, pp. 221-230
Structure of 3-infix--outfix maximal codes
Dong Yang Long
,
Jian Ma
,
Duanning Zhou
Theoretical Computer Science
188
(1-2), 1997, pp. 231-240
An improved shellsort algorithm
Renren Liu
Theoretical Computer Science
188
(1-2), 1997, pp. 241-247