AAAAAA
Results: 1-25/389
Authors:
MOORE D
SMYTH WF
MILLER D
Citation: D. Moore et al., COUNTING DISTINCT STRINGS, Algorithmica, 23(1), 1999, pp. 1-13
Authors:
DENG X
KOUTSOUPIAS E
MACKENZIE P
Citation: X. Deng et al., COMPETITIVE IMPLEMENTATION OF PARALLEL PROGRAMS, Algorithmica, 23(1), 1999, pp. 14-30
Authors:
KRISHNAN P
LONG PM
VITTER JS
Citation: P. Krishnan et al., ADAPTIVE DISK SPINDOWN VIA OPTIMAL RENT-TO-BUY IN PROBABILISTIC ENVIRONMENTS, Algorithmica, 23(1), 1999, pp. 31-56
Authors:
DJIDJEV HN
GILBERT JR
Citation: Hn. Djidjev et Jr. Gilbert, SEPARATORS IN GRAPHS WITH NEGATIVE AND MULTIPLE VERTEX WEIGHTS, Algorithmica, 23(1), 1999, pp. 57-71
Authors:
NARAYANAN L
OPATRNY J
Citation: L. Narayanan et J. Opatrny, COMPACT ROUTING ON CHORDAL RINGS OF DEGREE-4, Algorithmica, 23(1), 1999, pp. 72-96
Authors:
PRODINGER H
SZPANKOWSKI W
Citation: H. Prodinger et W. Szpankowski, CASE ANALYSIS OF ALGORITHMS - PREFACE, Algorithmica, 22(4), 1998, pp. 363-365
Authors:
PRODINGER H
SZPANKOWSKI W
Citation: H. Prodinger et W. Szpankowski, FLAJOLET,PHILIPPE RESEARCH IN ANALYSIS OF ALGORITHMS AND COMBINATORICS, Algorithmica, 22(4), 1998, pp. 366-387
Authors:
ALDOUS D
Citation: D. Aldous, A METROPOLIS-TYPE OPTIMIZATION ALGORITHM ON THE INFINITE TREE, Algorithmica, 22(4), 1998, pp. 388-412
Authors:
BRUSS FT
DRMOTA M
LOUCHARD G
Citation: Ft. Bruss et al., THE COMPLETE SOLUTION OF THE COMPETITIVE RANK SELECTION PROBLEM, Algorithmica, 22(4), 1998, pp. 413-447
Authors:
COFFMAN EG
FLATTO L
JELENKOVIC P
POONEN B
Citation: Eg. Coffman et al., PACKING RANDOM INTERVALS ONLINE, Algorithmica, 22(4), 1998, pp. 448-476
Authors:
DEVROYE L
MUCKE EP
ZHU BH
Citation: L. Devroye et al., A NOTE ON POINT LOCATION IN DELAUNAY TRIANGULATIONS OF RANDOM POINTS, Algorithmica, 22(4), 1998, pp. 477-482
Authors:
DELAVEGA WF
FRIEZE AM
SANTHA M
Citation: Wf. Delavega et al., AVERAGE-CASE ANALYSIS OF THE MERGING ALGORITHM OF HWANG AND LIN, Algorithmica, 22(4), 1998, pp. 483-489
Authors:
FLAJOLET P
POBLETE P
VIOLA A
Citation: P. Flajolet et al., ON THE ANALYSIS OF LINEAR PROBING HASHING, Algorithmica, 22(4), 1998, pp. 490-515
Authors:
HOFRI M
JACQUET P
Citation: M. Hofri et P. Jacquet, SADDLE-POINTS IN RANDOM MATRICES - ANALYSIS OF KNUTH SEARCH ALGORITHMS, Algorithmica, 22(4), 1998, pp. 516-528
Authors:
HWANG HK
Citation: Hk. Hwang, ASYMPTOTICS OF DIVIDE-AND-CONQUER RECURRENCES - BATCHERS SORTING ALGORITHM AND A MINIMUM EUCLIDEAN MATCHING HEURISTIC, Algorithmica, 22(4), 1998, pp. 529-546
Authors:
KNESSL C
Citation: C. Knessl, A NOTE ON THE ASYMPTOTIC-BEHAVIOR OF THE DEPTH OF TRIES, Algorithmica, 22(4), 1998, pp. 547-560
Authors:
KNUTH DE
Citation: De. Knuth, LINEAR PROBING AND GRAPHS, Algorithmica, 22(4), 1998, pp. 561-568
Authors:
MAHMOUD HM
SMYTHE RT
Citation: Hm. Mahmoud et Rt. Smythe, PROBABILISTIC ANALYSIS OF MULTIPLE QUICK SELECT, Algorithmica, 22(4), 1998, pp. 569-584
Authors:
MERLINI D
SPRUGNOLI R
VERRI MC
Citation: D. Merlini et al., AVERAGE-CASE ANALYSIS FOR A SIMPLE COMPRESSION ALGORITHM, Algorithmica, 22(4), 1998, pp. 585-599
Authors:
PANHOLZER A
PRODINGER N
Citation: A. Panholzer et N. Prodinger, AVERAGE-CASE ANALYSIS OF PRIORITY TREES - A STRUCTURE FOR PRIORITY QUEUE ADMINISTRATION, Algorithmica, 22(4), 1998, pp. 600-630
Authors:
REGNIER M
SZPANKOWSKI W
Citation: M. Regnier et W. Szpankowski, ON PATTERN FREQUENCY OCCURRENCES IN A MARKOVIAN SEQUENCE, Algorithmica, 22(4), 1998, pp. 631-649
Authors:
SHACHNAI H
HOFRI M
Citation: H. Shachnai et M. Hofri, THE LIST UPDATE PROBLEM - IMPROVED BOUNDS FOR THE COUNTER SCHEME, Algorithmica, 22(4), 1998, pp. 650-659
Authors:
VALLEE B
Citation: B. Vallee, DYNAMICS OF THE BINARY EUCLIDEAN ALGORITHM - FUNCTIONAL-ANALYSIS AND OPERATORS, Algorithmica, 22(4), 1998, pp. 660-685
Authors:
EPPSTEIN D
Citation: D. Eppstein, GUEST EDITORS FOREWORD, Algorithmica, 22(3), 1998, pp. 233-234
Authors:
KLEIN PN
SUBRAMANIAN S
Citation: Pn. Klein et S. Subramanian, A FULLY DYNAMIC APPROXIMATION SCHEME FOR SHORTEST PATHS IN PLANAR GRAPHS, Algorithmica, 22(3), 1998, pp. 235-249