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=164
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Heaps with bits
Svante Carlsson
,
Jingsen Chen
,
Christer Mattsson
Theoretical Computer Science
164
(1-2), 1996, pp. 1-12
Anomalous learning helps succinctness
John Case
,
Sanjay Jain
,
Arun Sharma
Theoretical Computer Science
164
(1-2), 1996, pp. 13-28
On almost cylindrical languages and the decidability of the D0L and PWD0L primitivity problems
John Harrison
Theoretical Computer Science
164
(1-2), 1996, pp. 29-40
Relationships between the dynamical systems associated to the Rauzy substitutions
Víctor F. Sirvent
Theoretical Computer Science
164
(1-2), 1996, pp. 41-57
Worst-case analysis of fast heuristics for packing squares into a square
C. Picouleau
Theoretical Computer Science
164
(1-2), 1996, pp. 59-72
Two-dimensional partitioning problems
Martin Middendorf
Theoretical Computer Science
164
(1-2), 1996, pp. 73-106
Reliable computations on faulty EREW PRAM
Krzysztof Diks
,
Andrzej Pelc
Theoretical Computer Science
164
(1-2), 1996, pp. 107-122
Structural equivalence and ET0L grammars
Kai Salomaa
,
Derick Wood
,
Sheng Yu
Theoretical Computer Science
164
(1-2), 1996, pp. 123-140
Cook versus Karp-Levin: Separating completeness notions if
NP
is not small
Jack H. Lutz
,
Elvira Mayordomo
Theoretical Computer Science
164
(1-2), 1996, pp. 141-163
Propriétés combinatoires des suites définies par le billard dans les triangles pavants
Pascal Hubert
Theoretical Computer Science
164
(1-2), 1996, pp. 165-183
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
James Allen Fill
Theoretical Computer Science
164
(1-2), 1996, pp. 185-206
A polynomial algorithm for the membership problem with categorial grammars
Alain Finkel
,
Isabelle Tellier
Theoretical Computer Science
164
(1-2), 1996, pp. 207-221
An application of Hajós factorizations to variable-length codes
Clelia De Felice
Theoretical Computer Science
164
(1-2), 1996, pp. 223-252
Coin-sliding and go
David Moews
Theoretical Computer Science
164
(1-2), 1996, pp. 253-276
On the asymptotic average length of a maximum common subsequence for words over a finite alphabet
Ioan Tomescu
Theoretical Computer Science
164
(1-2), 1996, pp. 277-285
The complexity of subgraph isomorphism for classes of partial
k
-trees
Arvind Gupta
,
Naomi Nishimura
Theoretical Computer Science
164
(1-2), 1996, pp. 287-298
A work-time optimal algorithm for computing all string covers
Costas S. Iliopoulos
,
Kunsoo Park
Theoretical Computer Science
164
(1-2), 1996, pp. 299-310