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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A faster FPT algorithm for the maximum Agreement Forest problem
Michael Hallett
,
Catherine McCartin
Theory of Computing Systems
41
(3), 2007, pp. 539-550
Some hard problems on matroid spikes
Petr Hlinȇný
Theory of Computing Systems
41
(3), 2007, pp. 551-562
Efficient exact algorithms through enumerating maximal independent sets and other techniques
Venkatesh Raman
,
Saket Saurabh
,
Somnath Sikdar
Theory of Computing Systems
41
(3), 2007, pp. 563-587
Compressed suffix trees with full functionality
Kunihiko Sadakane
Theory of Computing Systems
41
(4), 2007, pp. 589-607
The convergence of realistic distributed load-balancing algorithms
F. Cedó
,
A. Cortés
,
A. Ripoll
,
M.A. Senar
,
E. Luque
Theory of Computing Systems
41
(4), 2007, pp. 609-618
Formal efficiency analysis for tree transducer composition
Janis Voigtlander
Theory of Computing Systems
41
(4), 2007, pp. 619-689
The hardness of approximating spanner problems
Michael Elkin
,
David Peleg
Theory of Computing Systems
41
(4), 2007, pp. 691-729
Toward maximizing the quality of results of dependent tasks computed unreliably
Li Gao
,
Grzegorz Malewicz
Theory of Computing Systems
41
(4), 2007, pp. 731-752
The complexity of the descriptiveness of Boolean circuits over different sets of gates
Elmar Böhler
,
Henning Schnoor
Theory of Computing Systems
41
(4), 2007, pp. 753-777
Bounded-diameter minimum-cost graph problems
Sanjiv Kapoor
,
Mohammad Sarwat
Theory of Computing Systems
41
(4), 2007, pp. 779-794
Odometers on regular languages
Valérie Berthé
,
Michel Rigo
Theory of Computing Systems
40
(1), 2007, pp. 1-31
Chinese remaindering with multiplicative noise
Igor E. Shparlinski
,
Ron Steinfeld
Theory of Computing Systems
40
(1), 2007, pp. 33-41
The structure of infinite solutions of marked and binary post correspondence problems
Vesa Halava
,
Tero Harju
,
Juhani Karhumäki
Theory of Computing Systems
40
(1), 2007, pp. 43-54
Compact labeling scheme for XML ancestor queries
Haim Kaplan
,
Tova Milo
,
Ronen Shabo
Theory of Computing Systems
40
(1), 2007, pp. 55-99
OBDD-based cryptanalysis of oblivious keystream generators
Matthias Krause
Theory of Computing Systems
40
(1), 2007, pp. 101-121
A simple 3-edge-connected component algorithm
Yung H. Tsin
Theory of Computing Systems
40
(2), 2007, pp. 125-142
Rendezvous and election of mobile agents: Impact of sense of direction
Lali Barrière
,
Paola Flocchini
,
Pierre Fraigniaud
,
Nicola Santoro
Theory of Computing Systems
40
(2), 2007, pp. 143-162
Query learning of regular tree languages: How to avoid dead states
Frank Drewes
,
Johanna Högberg
Theory of Computing Systems
40
(2), 2007, pp. 163-185
Constant approximation algorithms for rectangle stabbing and related problems
Guang Xu
,
Jinhui Xu
Theory of Computing Systems
40
(2), 2007, pp. 187-204
Distribution of additive functions with respect to numeration systems on regular languages
Peter J. Grabner
,
Michel Rigo
Theory of Computing Systems
40
(3), 2007, pp. 205-223
Efficient exploration of faulty trees
Euripides Markou
,
Andrzej Pelc
Theory of Computing Systems
40
(3), 2007, pp. 225-247
Randomized algorithms for 3-SAT
Thomas Hofmeister
,
Uwe Schöning
,
Rainer Schuler
,
Osamu Watanabe
Theory of Computing Systems
40
(3), 2007, pp. 249-262
Dichotomies in the complexity of solving systems of equations over finite semigroups
O. Klíma
,
P. Tesson
,
D. Thérien
Theory of Computing Systems
40
(3), 2007, pp. 263-297
Characterizing TC
^0
in terms of infinite groups
Andreas Krebs
,
Klaus-Jörn Lange
,
Stephanie Reifferscheid
Theory of Computing Systems
40
(4), 2007, pp. 303-325
Sorting stably, in place, with
O(n \log n)
comparisons and
O(n)
moves
Gianni Franceschini
Theory of Computing Systems
40
(4), 2007, pp. 327-353
Seiten
<
1
2
3
>