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
[2]
Hilfe
Suche: Journal=Algorithmica AND Volume=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Saddle points in random matrices: Analysis of Knuth search algorithms
M. Hofri
,
P. Jacquet
Algorithmica
22
(4), 1998, pp. 516-528
Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic
H.-Kwang Hwang
Algorithmica
22
(4), 1998, pp. 529-546
A note on the asymptotic behavior of the depth of tries
C. Knessl
Algorithmica
22
(4), 1998, pp. 547-560
Linear probing and graphs
D.E. Knuth
Algorithmica
22
(4), 1998, pp. 561-568
Probabilistic analysis of MULTIPLE QUICK SELECT
H.M. Mahmoud
,
R.T. Smythe
Algorithmica
22
(4), 1998, pp. 569-584
Average-case analysis for a simple compression algorithm
D. Merlini
,
R. Sprugnoli
,
M.C. Verri
Algorithmica
22
(4), 1998, pp. 585-599
Average-case analysis of priority trees: A structure for priority queue administration
A. Panholzer
,
H. Prodinger
Algorithmica
22
(4), 1998, pp. 600-630
On pattern frequency occurrences in a Markovian sequence
M. Régnier
,
W. Szpankowski
Algorithmica
22
(4), 1998, pp. 631-649
The list update problem: Improved bounds for the counter scheme
H. Shachnai
,
M. Hofri
Algorithmica
22
(4), 1998, pp. 650-659
Dynamics of the binary Euclidean algorithm: Functional analysis and operators
B. Vallée
Algorithmica
22
(4), 1998, pp. 660-685
Seiten
<
1
2