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=302
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Conjugacy and Episturmian morphisms
G. Richomme
Theoretical Computer Science
302
(1-3), 2003, pp. 1-34
Nearly optimal strategies for special cases of on-line capital investment
Peter Damaschke
Theoretical Computer Science
302
(1-3), 2003, pp. 35-44
Analysis of multiple quickselect variants
Alois Panholzer
Theoretical Computer Science
302
(1-3), 2003, pp. 45-91
Pushdown timed automata: A binary reachability characterization and safety verification
Zhe Dang
Theoretical Computer Science
302
(1-3), 2003, pp. 93-121
\mu
-recursion and infinite limits
Jerzy Mycka
Theoretical Computer Science
302
(1-3), 2003, pp. 123-133
Term rewriting restricted to ground terms
Sándor Vágvölgyi
Theoretical Computer Science
302
(1-3), 2003, pp. 135-165
A note on differentiable palindromes
S. Brlek
,
A. Ladouceur
Theoretical Computer Science
302
(1-3), 2003, pp. 167-178
Nondeterministic regular expressions as solutions of equational systems
Rocco De Nicola
,
Anna Labella
Theoretical Computer Science
302
(1-3), 2003, pp. 179-189
Optimizing stable in-place merging
Jingchao Chen
Theoretical Computer Science
302
(1-3), 2003, pp. 191-210
Application of Lempel-Ziv factorization to the approximation of grammar-based compression
Wojciech Rytter
Theoretical Computer Science
302
(1-3), 2003, pp. 211-222
Generalizations of suffix arrays to multi-dimensional matrices
Dong Kyue Kim
,
Yoo Ah Kim
,
Kunsoo Park
Theoretical Computer Science
302
(1-3), 2003, pp. 223-238
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
Klaus Jansen
Theoretical Computer Science
302
(1-3), 2003, pp. 239-256
On the complexity of intersecting finite state automata and
NL
versus
NP
George Karakostas
,
Richard J. Lipton
,
Anastasios Viglas
Theoretical Computer Science
302
(1-3), 2003, pp. 257-274
Unification and extension of weighted finite automata applicable to image compression
Zhuhan Jiang
,
Olivier de Vel
,
Bruce Litow
Theoretical Computer Science
302
(1-3), 2003, pp. 275-294
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Pál Dömösi
,
Chrystopher L. Nehaniv
,
John L. Rhodes
Theoretical Computer Science
302
(1-3), 2003, pp. 295-317
On maximizing the throughput of multiprocessor tasks
Aleksei V. Fishkin
,
Guochuan Zhang
Theoretical Computer Science
302
(1-3), 2003, pp. 319-335
Distributed broadcast in radio networks of unknown topology
Andrea E.F. Clementi
,
Angelo Monti
,
Riccardo Silvestri
Theoretical Computer Science
302
(1-3), 2003, pp. 337-364
A recognition and parsing algorithm for arbitrary conjunctive grammars
Alexander Okhotin
Theoretical Computer Science
302
(1-3), 2003, pp. 365-399
Generalizations of suffix arrays to multi-dimensional matrices
Dong Kyue Kim
,
Yoo Ah Kim
,
Kunsoo Park
Theoretical Computer Science
302
(1-3), 2003, pp. 401-416
Generalized satisfiability problems: Minimal elements and phase transitions
Nadia Creignou
,
Hervé Daudé
Theoretical Computer Science
302
(1-3), 2003, pp. 417-430
On the number of occurrences of a symbol in words of regular languages
Alberto Bertoni
,
Christian Choffrut
,
Massimiliano Goldwurm
,
Violetta Lonati
Theoretical Computer Science
302
(1-3), 2003, pp. 431-456
P
-immune sets with holes lack self-reducibility properties
Lane A. Hemaspaandra
,
Harald Hempel
Theoretical Computer Science
302
(1-3), 2003, pp. 457-466
Query complexity of membership comparable sets
Till Tantau
Theoretical Computer Science
302
(1-3), 2003, pp. 467-474
Palindrome recognition using a multidimensional tape
Therese Biedl
,
Jonathan F. Buss
,
Erik D. Demaine
,
Martin L. Demaine
,
Mohammadtaghi Hajiaghayi
,
Tomás̑ Vinaȓ
Theoretical Computer Science
302
(1-3), 2003, pp. 475-480
Decidability results for Watson-Crick D0L systems with nonregular triggers
Juha Honkala
Theoretical Computer Science
302
(1-3), 2003, pp. 481-488
Seiten 1
2
>