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=Algorithmica AND Volume=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An edit distance between quotiented trees
Pascal Ferraro
,
Christophe Godin
Algorithmica
36
(1), 2003, pp. 1-39
The solution of linear probabilistic recurrence relations
Louay Bazzi
,
Sanjoy Mitter
Algorithmica
36
(1), 2003, pp. 41-57
Maintenance of a piercing set for intervals with applications
Matthew J. Katz
,
Frank Nielsen
,
Michael Segal
Algorithmica
36
(1), 2003, pp. 59-73
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
Holger Bast
,
Kurt Mehlhorn
,
Guido Schäfer
,
Hisao Tamaki
Algorithmica
36
(1), 2003, pp. 75-88
A 3-party simultaneous protocol for SUM-INDEX
Xiaoming Sun
Algorithmica
36
(1), 2003, pp. 89-91
An
O(n^{1.5})
deterministic gossiping algorithm for radio networks
Ying Xu
Algorithmica
36
(1), 2003, pp. 93-96
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Frank Dehne
,
Wolfgang Dittrich
,
David Hutchinson
Algorithmica
36
(2), 2003, pp. 97-122
Time-constrained scheduling of weighted packets on trees and meshes
Micah Adler
,
Sanjeev Khanna
,
Rajmohan Rajaraman
,
Adi Rosén
Algorithmica
36
(2), 2003, pp. 123-152
Drawing trees symmetrically in three dimensions
Seok-Hee Hong
,
Peter Eades
Algorithmica
36
(2), 2003, pp. 153-178
A new approximation algorithm for finding heavy planar subgraphs
Gruia Cȃlinescu
,
Cristina G. Fernandes
,
Howard Karloff
,
Alexander Zelikovsky
Algorithmica
36
(2), 2003, pp. 179-205
Dynamic TPC acknowledgment and other stories about
e/(e-1)
Anna R. Karlin
,
Claire Kenyon
,
Dana Randall
Algorithmica
36
(3), 2003, pp. 209-224
Competitive on-line switching policies
Amotz Bar-Noy
,
Ari Freund
,
Shimon Landa
,
Joseph (Seffi) Naor
Algorithmica
36
(3), 2003, pp. 225-247
Static optimality and dynamic search-optimality in lists and trees
Avrim Blum
,
Shuchi Chawla
,
Adam Kalai
Algorithmica
36
(3), 2003, pp. 249-260
New bounds for multidimensional packing
Steven S. Seiden
,
Rob van Stee
Algorithmica
36
(3), 2003, pp. 261-293
Temporary tasks assignment resolved
Amitai Armon
,
Yossi Azar
,
Leah Epstein
,
Oded Regev
Algorithmica
36
(3), 2003, pp. 295-314
Multicast pull scheduling: When fairness is fine
Jeff Edmonds
,
Kirk Pruhs
Algorithmica
36
(3), 2003, pp. 315-330
Computing the maximum degree of minors in matrix pencils via combinatorial relaxation
Satoru Iwata
Algorithmica
36
(4), 2003, pp. 331-341
Escaping a grid by edge-disjoint paths
Wun-Tat Chan
,
Francis Y.L. Chin
,
Hing-Fung Ting
Algorithmica
36
(4), 2003, pp. 343-359
Polynomial time algorithms for 2-edge-connectivity augmentation problems
Anna Galluccio
,
Guido Proietti
Algorithmica
36
(4), 2003, pp. 361-374
Computing the treewidth and the minimum fill-in with the modular decomposition
Hans L. Bodlaender
,
Udi Rotics
Algorithmica
36
(4), 2003, pp. 375-408