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=399
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal delay for media-on-demand with pre-loading and pre-buffering
Amotz Bar-Noy
,
Richard E. Ladner
,
Tami Tamir
Theoretical Computer Science
399
(1-2), 2008, pp. 3-11
Distributed chasing of network intruders
Lélia Blin
,
Pierre Fraigniaud
,
Nicolas Nisse
,
Sandrine Vial
Theoretical Computer Science
399
(1-2), 2008, pp. 12-37
Minimum-energy broadcast and disk cover in grid wireless networks
Tiziana Calamoneri
,
Andrea E.F. Clementi
,
Miriam Di Ianni
,
Massimo Lauria
,
Angelo Monti
,
Riccardo Silvestri
Theoretical Computer Science
399
(1-2), 2008, pp. 38-53
Election and rendezvous with incomparable labels
Jérémie Chalopin
Theoretical Computer Science
399
(1-2), 2008, pp. 54-70
Local spreading algorithms for autonomous robot systems
Reuven Cohen
,
David Peleg
Theoretical Computer Science
399
(1-2), 2008, pp. 71-82
Fast deterministic distributed algorithms for sparse spanners
Bilel Derbel
,
Cyril Gavoille
Theoretical Computer Science
399
(1-2), 2008, pp. 83-100
On fractional dynamic faults with thresholds
Stefan Dobrev
,
Rastislav Královic̑
,
Richard Královic̑
,
Nicola Santoro
Theoretical Computer Science
399
(1-2), 2008, pp. 101-117
Distance-
k
knowledge in self-stabilizing algorithms
Wayne Goddard
,
Stephen T. Hedetniemi
,
David P. Jacobs
,
Vilmar Trevisan
Theoretical Computer Science
399
(1-2), 2008, pp. 118-127
The maximum edge-disjoint paths problem in complete graphs
Adrian Kosowski
Theoretical Computer Science
399
(1-2), 2008, pp. 128-140
How to meet in anonymous network
Dariusz R. Kowalski
,
Adam Malinowski
Theoretical Computer Science
399
(1-2), 2008, pp. 141-156
Time constrained graph searching
Brian Alspach
,
Danny Dyer
,
Denis Hanson
,
Boting Yang
Theoretical Computer Science
399
(3), 2008, pp. 158-168
Monotonicity of non-deterministic graph searching
Frédéric Mazoit
,
Nicolas Nisse
Theoretical Computer Science
399
(3), 2008, pp. 169-178
The role of information in the cop-robber game
Volkan Isler
,
Nikhil Karnad
Theoretical Computer Science
399
(3), 2008, pp. 179-190
Cleaning a network with brushes
M.E. Messinger
,
R.J. Nowakowski
,
P. Praƚat
Theoretical Computer Science
399
(3), 2008, pp. 191-205
Digraph measures: Kelly decompositions, games, and orderings
Paul Hunter
,
Stephan Kreutzer
Theoretical Computer Science
399
(3), 2008, pp. 206-219
Offline variants of the ``lion and man'' problem - Some problems and techniques for measuring crowdedness and for safe path planning -
Adrian Dumitrescu
,
Ichiro Suzuki
,
Paweƚ Żyliński
Theoretical Computer Science
399
(3), 2008, pp. 220-235
An annotated bibliography on guaranteed graph searching
Fedor V. Fomin
,
Dimitrios M. Thilikos
Theoretical Computer Science
399
(3), 2008, pp. 236-245