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=380
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the cover time and mixing time of random geometric graphs
Chen Avin
,
Gunes Ercal
Theoretical Computer Science
380
(1-2), 2007, pp. 2-22
A tight linear bound on the synchronization delay of bijective automata
Eugen Czeizler
,
Jarkko Kari
Theoretical Computer Science
380
(1-2), 2007, pp. 23-36
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Artur Czumaj
,
Miroslaw Kowaluk
,
Andrzej Lingas
Theoretical Computer Science
380
(1-2), 2007, pp. 37-46
Balanced allocation and dictionaries with tightly packed constant size bins
Martin Dietzfelbinger
,
Christoph Weidling
Theoretical Computer Science
380
(1-2), 2007, pp. 47-68
Weighted automata and weighted logics
Manfred Droste
,
Paul Gastin
Theoretical Computer Science
380
(1-2), 2007, pp. 69-86
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Martin Gairing
,
Burkhard Monien
,
Andreas Woclaw
Theoretical Computer Science
380
(1-2), 2007, pp. 87-99
Comparing the size of NFAs with and without
\epsilon
-transitions
Juraj Hromkovic̑
,
Georg Schnitger
Theoretical Computer Science
380
(1-2), 2007, pp. 100-114
The quantum query complexity of the Abelian hidden subgroup problem
Pascal Koiran
,
Vincent Nesme
,
Natacha Portier
Theoretical Computer Science
380
(1-2), 2007, pp. 115-126
On dynamic bit-probe complexity
Mihai Pȃtraşcu
,
Corina E. Tarniţȃ
Theoretical Computer Science
380
(1-2), 2007, pp. 127-142
Recursively defined metric spaces without contraction
Franck van Breugel
,
Claudio Hermida
,
Michael Makkai
,
James Worrell
Theoretical Computer Science
380
(1-2), 2007, pp. 143-163
New up-to techniques for weak bisimulation
Damien Pous
Theoretical Computer Science
380
(1-2), 2007, pp. 164-180
Discrete random variables over domains
Michael Mislove
Theoretical Computer Science
380
(1-2), 2007, pp. 181-198
Tight lower bounds for query processing on streaming and external memory data
Martin Grohe
,
Christoph Koch
,
Nicole Schweikardt
Theoretical Computer Science
380
(1-2), 2007, pp. 199-217
Reversals and palindromes in continued fractions
Boris Adamczewski
,
Jean-Paul Allouche
Theoretical Computer Science
380
(3), 2007, pp. 220-237
On alpha-adic expansions in Pisot bases
Petr Ambroz̑
,
Christiane Frougny
Theoretical Computer Science
380
(3), 2007, pp. 238-250
Functional stepped surfaces, flips, and generalized substitutions
Pierre Arnoux
,
Valérie Berthé
,
Thomas Fernique
,
Damien Jamet
Theoretical Computer Science
380
(3), 2007, pp. 251-265
Factor versus palindromic complexity of uniformly recurrent infinite words
Peter Baláz̑i
,
Zuzana Masáková
,
Edita Pelantová
Theoretical Computer Science
380
(3), 2007, pp. 266-275
Discrete rotations and symbolic dynamics
Valérie Berthé
,
Bertrand Nouvel
Theoretical Computer Science
380
(3), 2007, pp. 276-285
A geometrical characterization of factors of multidimensional Billiard words and some applications
Jean-Pierre Borel
Theoretical Computer Science
380
(3), 2007, pp. 286-303
On the arithmetical complexity of Sturmian words
J. Cassaigne
,
A.E. Frid
Theoretical Computer Science
380
(3), 2007, pp. 304-316
Local rule substitutions and stepped surfaces
Thomas Fernique
Theoretical Computer Science
380
(3), 2007, pp. 317-329
Powers in a class of
A
-strict standard episturmian words
Amy Glen
Theoretical Computer Science
380
(3), 2007, pp. 330-354
Extension of the decidability of the marked PCP to instances with unique blocks
Vesa Halava
,
Tero Harju
,
Juhani Karhumäki
,
Michel Latteux
Theoretical Computer Science
380
(3), 2007, pp. 355-362
On systems of word equations with simple loop sets
S̑tȇpán Holub
,
Juha Kortelainen
Theoretical Computer Science
380
(3), 2007, pp. 363-372
A note on the number of squares in a word
Lucian Ilie
Theoretical Computer Science
380
(3), 2007, pp. 373-376
Seiten 1
2
>