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 Volume=41
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
Seiten
<
1
2