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=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The contraction method for recursive algorithms
U. Rösler
,
L. Rüschendorf
Algorithmica
29
(1-2), 2001, pp. 3-33
An algorithmic approach to discovering and proving
q
-series identities
G.E. Andrews
,
A. Knopfmacher
Algorithmica
29
(1-2), 2001, pp. 34-43
Transitional behaviors of the average cost of Quicksort with median-of-
(2t+1)
H.-H. Chern
,
H.-K. Hwang
Algorithmica
29
(1-2), 2001, pp. 44-69
Bandwidth packing
E.G., Jr. Coffman
,
A.L. Stolyar
Algorithmica
29
(1-2), 2001, pp. 70-88
An analytic approach to the height of binary search trees
M. Drmota
Algorithmica
29
(1-2), 2001, pp. 89-119
A unified presentation of some Urn models
M. Drmota
,
D. Gardy
,
B. Gittenberger
Algorithmica
29
(1-2), 2001, pp. 120-147
Near-optimal bounded-degree spanning trees
J.C. Hansen
,
E. Schmutz
Algorithmica
29
(1-2), 2001, pp. 148-180
Partial match queries in relaxed multidimensional search trees
C. Martínez
,
A. Panholzer
,
H. Prodinger
Algorithmica
29
(1-2), 2001, pp. 181-204
Smallest components in decomposable structures: Exp-log class
D. Panario
,
B. Richmond
Algorithmica
29
(1-2), 2001, pp. 205-226
Analysis of an adaptive algorithm to find the two nearest neighbors
P.V. Poblete
Algorithmica
29
(1-2), 2001, pp. 227-237
On the analysis of stochastic divide and conquer algorithms
U. Rösler
Algorithmica
29
(1-2), 2001, pp. 238-261
Dynamical sources in information theory: Fundamental intervals and word prefixes
B. Vallée
Algorithmica
29
(1-2), 2001, pp. 262-306
Dynamical sources in information theory: A general analysis of trie structures
J. Clément
,
P. Flajolet
,
B. Vallée
Algorithmica
29
(1-2), 2001, pp. 307-369
Solving some discrepancy problems in
NC
S. Mahajan
,
E.A. Ramos
,
K.V. Subrahmanyam
Algorithmica
29
(3), 2001, pp. 371-395
Static frequency assignment in cellular networks
L. Narayanan
,
S.M. Shende
Algorithmica
29
(3), 2001, pp. 396-409
The dense
k
-subgraph problem
U. Feige
,
G. Kortsarz
,
D. Peleg
Algorithmica
29
(3), 2001, pp. 410-421
Ancient and new algorithms for load balancing in the
l_p
norm
A. Avidor
,
Y. Azar
,
J. Sgall
Algorithmica
29
(3), 2001, pp. 422-441
On two class-constrained versions of the multiple knapsack problem
H. Shachnai
,
T. Tamir
Algorithmica
29
(3), 2001, pp. 442-467
A randomized algorithm for approximate string matching
M.J. Atallah
,
F. Chyzak
,
P. Dumas
Algorithmica
29
(3), 2001, pp. 468-486
Efficient parallel computation of the characteristic polynomial of a sparse, separable matrix
J.H. Reif
Algorithmica
29
(3), 2001, pp. 487-510
Simple algorithms for multimessage multicasting with forwarding
T.F. Gonzalez
Algorithmica
29
(4), 2001, pp. 511-533
Parallel algorithms for series parallel graphs and graphs with treewidth two
H.L. Bodlaender
,
B. van Antwerpen-de Fluiter
Algorithmica
29
(4), 2001, pp. 534-559
Algorithms for the on-line Travelling Salesman
G. Ausiello
,
E. Feuerstein
,
S. Leonardi
,
L. Stougie
,
M. Talamo
Algorithmica
29
(4), 2001, pp. 560-581
Equivalence of
\varepsilon
-approximate separation and optimization in fixed dimensions
S.N. Kabadi
,
Y.P. Aneja
Algorithmica
29
(4), 2001, pp. 582-594
Efficient algorithms for integer programs with two variables per constraint
R. Bar-Yehuda
,
D. Rawitz
Algorithmica
29
(4), 2001, pp. 595-609
Seiten 1
2
>