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=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting distinct strings
D. Moore
,
W.F. Smyth
,
D. Miller
Algorithmica
23
(1), 1999, pp. 1-13
Competitive implementation of parallel programs
X. Deng
,
E. Koutsoupias
,
P. MacKenzie
Algorithmica
23
(1), 1999, pp. 14-30
Adaptive disk spindown via optimal rent-to-buy in probabilistic environments
P. Krishnan
,
P.M. Long
,
J.S. Vitter
Algorithmica
23
(1), 1999, pp. 31-56
Separators in graphs with negative and multiple vertex weights
H.N. Djidjev
,
J.R. Gilbert
Algorithmica
23
(1), 1999, pp. 57-71
Compact routing on chordal rings of degree 4
L. Narayanan
,
J. Opatrny
Algorithmica
23
(1), 1999, pp. 72-96
A note on the expected time for finding maxima by list algorithms
L. Devroye
Algorithmica
23
(2), 1999, pp. 97-108
On the sum coloring problem in interval graphs
S. Nicoloso
,
M. Sarrafzadeh
,
X. Song
Algorithmica
23
(2), 1999, pp. 109-126
Faster approximate string matching
R. Baeza-Yates
,
G. Navarro
Algorithmica
23
(2), 1999, pp. 127-158
Upper and lower bounds on the makespan of schedules for tree dags on linear arrays
K. Kalpakis
,
Y. Yesha
Algorithmica
23
(2), 1999, pp. 159-179
LRU is better than FIFO
M. Chrobak
,
J. Noga
Algorithmica
23
(2), 1999, pp. 180-185
Two-way and multiway partitioning of a set of intervals for clique-width maximization
A.H. Farrahi
,
D.-T. Lee
,
M. Sarrafzadeh
Algorithmica
23
(3), 1999, pp. 187-210
Algorithms for a class of isotonic regression problems
P.M. Pardalos
,
G. Xue
Algorithmica
23
(3), 1999, pp. 211-222
A linear-time algorithm for the feasibility of pebble motion on trees
V. Auletta
,
A. Monti
,
M. Parente
,
P. Persiano
Algorithmica
23
(3), 1999, pp. 223-245
Suffix trees on words
A. Andersson
,
N.J. Larsson
,
K. Swanson
Algorithmica
23
(3), 1999, pp. 246-260
Solving systems of difference constraints incrementally
G. Ramalingam
,
J. Song
,
L. Joskowicz
,
R.E. Miller
Algorithmica
23
(3), 1999, pp. 261-275
Improved bounds for on-line load balancing
M. Andrews
,
M.X. Goemans
,
L. Zhang
Algorithmica
23
(4), 1999, pp. 278-301
Output-sensitive reporting of disjoint paths
G. di Battista
,
R. Tamassia
,
L. Vismara
Algorithmica
23
(4), 1999, pp. 302-340
Harmonic analysis, real approximation, and the communication complexity of Boolean functions
V. Grolmusz
Algorithmica
23
(4), 1999, pp. 341-353
An
O(n \log n)
average time algorithm for computing the shortest network under a given toplogy
G. Xue
,
D.-Z. Du
Algorithmica
23
(4), 1999, pp. 354-362
Reductions do not preserve fast convergence rates in average time
J. Belanger
,
A. Pavan
,
J. Wang
Algorithmica
23
(4), 1999, pp. 363-373