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=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fault-tolerant sequential scan
Paola Flocchini
,
Andrzej Pelc
,
Nicola Santoro
Theory of Computing Systems
45
(1), 2009, pp. 1-26
Polynomial-size binary decision diagrams for the exactly half-
d
-hyperclique problem reading each input bit twice
Daniel Král'
Theory of Computing Systems
45
(1), 2009, pp. 27-42
Degree-optimal routing for P2P systems
Giovanni Chiola
,
Gennaro Cordasco
,
Luisa Gargano
,
Mikael Hammar
,
Alberto Negro
,
et al.
Theory of Computing Systems
45
(1), 2009, pp. 43-63
An outer-measure approach for resource-bounded measure
Jack Jie Dai
Theory of Computing Systems
45
(1), 2009, pp. 64-73
Probabilistic length-reducing two-pushdown automata
Tomasz Jurdziński
Theory of Computing Systems
45
(1), 2009, pp. 74-107
On the theory of matchgate computations
Jin-Yi Cai
,
Vinay Choudhary
,
Pinyan Lu
Theory of Computing Systems
45
(1), 2009, pp. 108-132
Infinite traces and symbolic dynamics
Wit Foryś
,
Piotr Oprocha
Theory of Computing Systems
45
(1), 2009, pp. 133-149
Sophistication revisited
Luís Antunes
,
Lance Fortnow
Theory of Computing Systems
45
(1), 2009, pp. 150-161
Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications
George Tsaggouris
,
Christos Zaroliagis
Theory of Computing Systems
45
(1), 2009, pp. 162-186
Exponential separation of quantum and classical online space complexity
François Le Gall
Theory of Computing Systems
45
(2), 2009, pp. 188-202
The cache complexity of multithreaded cache oblivious algorithms
Matteo Frigo
,
Volker Strumpen
Theory of Computing Systems
45
(2), 2009, pp. 203-233
Towards a scalable and robust DHT
Baruch Awerbuch
,
Christian Scheideler
Theory of Computing Systems
45
(2), 2009, pp. 234-260
Tell me who I am: An interactive recommendation system
Noga Alon
,
Baruch Awerbuch
,
Yossi Azar
,
Boaz Patt-Shamir
Theory of Computing Systems
45
(2), 2009, pp. 261-279
On the price of heterogeneity in parallel systems
P. Brighten Godfrey
,
Richard M. Karp
Theory of Computing Systems
45
(2), 2009, pp. 280-301
Network design with weighted players
Ho-Lin Chen
,
Tim Roughgarden
Theory of Computing Systems
45
(2), 2009, pp. 302-324
Smooth scheduling under variable rates or the analog-digital confinement game
Ami Litman
,
Shiri Moran-Schein
Theory of Computing Systems
45
(2), 2009, pp. 325-354
A new efficient algorithm for computing the longest common subsequence
Costas S. Iliopoulos
,
M. Sohel Rahman
Theory of Computing Systems
45
(2), 2009, pp. 355-371
Bounds on mincut for Cayley graphs over Abelian Groups
Vladimir Lipets
Theory of Computing Systems
45
(2), 2009, pp. 372-380
Unavoidable sets of partial words
F. Blanchet-Sadri
,
N.C. Brownstein
,
Andy Kalcic
,
Justin Palumbo
,
T. Weynand
Theory of Computing Systems
45
(2), 2009, pp. 381-406
Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
Sun-Yuan Hsieh
,
Yu-Fen Weng
Theory of Computing Systems
45
(2), 2009, pp. 407-425
WAOA 2006 special issue of TOCS
Thomas Erlebach
,
Christos Kaklamanis
Theory of Computing Systems
45
(3), 2009, pp. 427-428
Online dynamic programming speedups
Amotz Bar-Noy
,
Mordecai J. Golin
,
Yan Zhang
Theory of Computing Systems
45
(3), 2009, pp. 429-445
Covering many or few points with unit disks
Mark de Berg
,
Cabello
,
Sariel Har-Peled
Theory of Computing Systems
45
(3), 2009, pp. 446-469
Online
k
-server routing problems
Vincenzo Bonifaci
,
Leen Stougie
Theory of Computing Systems
45
(3), 2009, pp. 470-485
A randomized algorithm for online unit clustering
Timothy M. Chan
,
Hamid Zarrabi-Zadeh
Theory of Computing Systems
45
(3), 2009, pp. 486-496
Seiten 1
2
3
>