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=Theory of Computing Systems AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Matching algorithms are fast in sparse random graphs
Holger Bast
,
Kurt Mehlhorn
,
Guido Schäfer
,
Hisao Tamaki
Theory of Computing Systems
39
(1), 2006, pp. 3-14
A Burnside approach to the finite substitution problem
Daniel Kirsten
Theory of Computing Systems
39
(1), 2006, pp. 15-50
Solving the 2-disjoint paths problem in nearly linear time
Torsten Tholey
Theory of Computing Systems
39
(1), 2006, pp. 51-78
Constant width planar computation characterizes ACC
^0
Kristoffer Arnsfelt Hansen
Theory of Computing Systems
39
(1), 2006, pp. 79-92
Approximation algorithms for minimizing average distortion
Kedar Dhamdhere
,
Anupam Gupta
,
R. Ravi
Theory of Computing Systems
39
(1), 2006, pp. 93-111
Simpler computation of single-source shortest paths in linear average time
Torben Hagerup
Theory of Computing Systems
39
(1), 2006, pp. 113-120
The expected competitive ratio for weighted completion time scheduling
Alexander Souza
,
Angelika Steger
Theory of Computing Systems
39
(1), 2006, pp. 121-136
Complexity of regular language matching and other decidable cases of the satisfiability problem for constraints between regular open terms
Sebastian Bala
Theory of Computing Systems
39
(1), 2006, pp. 137-163
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Theory of Computing Systems
39
(1), 2006, pp. 165-188
Time-space tradeoff in derandomizing probabilistic logspace
Jin-Yi Cai
,
Venkatesan T. Chakaravarthy
,
Dieter van Melkebeek
Theory of Computing Systems
39
(1), 2006, pp. 189-208
Local limit properties for pattern statistics and rational models
Alberto Bertoni
,
Christian Choffrut
,
Massimiliano Goldwurm
,
Violetta Lonati
Theory of Computing Systems
39
(1), 2006, pp. 209-235
Active context-free games
Anca Muscholl
,
Thomas Schwentick
,
Luc Segoufin
Theory of Computing Systems
39
(1), 2006, pp. 237-276
Why computational complexity requires stricter martingales
John M. Hitchcock
,
Jack H. Lutz
Theory of Computing Systems
39
(2), 2006, pp. 277-296
The expressive power of bijections over weakly arithmetized structures
Étienne Ailloud
,
Arnaud Durand
Theory of Computing Systems
39
(2), 2006, pp. 297-309
Algebraic characterization of reversible logic gates
Xiaoyu Song
,
Guowu Yang
,
Marek Perkowski
,
Yuke Wang
Theory of Computing Systems
39
(2), 2006, pp. 311-319
Optimal implicit dictionaries over unbounded universes
Gianni Franceschini
,
Roberto Grossi
Theory of Computing Systems
39
(2), 2006, pp. 321-345
Reachability problems on regular ground tree rewriting graphs
Christof Löding
Theory of Computing Systems
39
(2), 2006, pp. 347-383
A Reference Correction of ''Effective Jordan decomposition''
Xizhong Zheng
,
Robert Rettinger
Theory of Computing Systems
39
(2), 2006, pp. 385-385
Insertion sort is
O(n \log n)
Michael A. Bender
,
Martin Farach-Colton
,
Miguel A. Mosteiro
Theory of Computing Systems
39
(3), 2006, pp. 391-397
The Graham-Knowlton problem revisited
Navin Goyal
,
Sachin Lodha
,
S. Muthukrishnan
Theory of Computing Systems
39
(3), 2006, pp. 399-412
More fun with symmetric Venn diagrams
Frank Ruskey
,
Mark Weston
Theory of Computing Systems
39
(3), 2006, pp. 413-423
Juggling with pattern matching
Jean Cardinal
,
Steve Kremer
,
Stefan Langerman
Theory of Computing Systems
39
(3), 2006, pp. 425-437
Morpion solitaire
Erik D. Demaine
,
Martin L. Demaine
,
Arthur Langerman
,
Stefan Langerman
Theory of Computing Systems
39
(3), 2006, pp. 439-453
Sequencing from compomers: The puzzle
Sebastian Böcker
Theory of Computing Systems
39
(3), 2006, pp. 455-471
Puzzles, art, and magic with algorithms
Erik D. Demaine
,
Martin L. Demaine
Theory of Computing Systems
39
(3), 2006, pp. 473-481
Seiten 1
2
>