Algorithms — ESA’ 98 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540648482, 9783540685302

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

New Bounds for Oblivious Mesh Routing

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_25 ◽

1998 ◽

pp. 295-306 ◽

Cited By ~ 4

Author(s):

Kazuo Iwama ◽

Yahiko Kambayashi ◽

Eiji Miyano

Download Full-text

Analogs and Duals of the MAST Problem for Sequences and Trees

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_9 ◽

1998 ◽

pp. 103-114 ◽

Cited By ~ 9

Author(s):

Michael Fellows ◽

Michael Hallett ◽

Chantal Korostensky ◽

Ulrike Stege

Keyword(s):

Mast Problem

Download Full-text

Analyzing an Infinite Parallel Job Allocation Process

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_35 ◽

1998 ◽

pp. 417-428 ◽

Cited By ~ 8

Author(s):

Micah Adler ◽

Petra Berenbrink ◽

Klaus Schröder

Keyword(s):

Job Allocation ◽

Allocation Process ◽

Parallel Job

Download Full-text

Finding an Optimal Path without Growing the Tree

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_30 ◽

1998 ◽

pp. 356-367 ◽

Cited By ~ 2

Author(s):

Danny Z. Chen ◽

Ovidiu Daescu ◽

Xiaobo Hu ◽

Jinhui Xu

Keyword(s):

Optimal Path

Download Full-text

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_27 ◽

1998 ◽

pp. 320-331 ◽

Cited By ~ 13

Author(s):

D. Frigioni ◽

A. Marchetti-Spaccamela ◽

U. Nanni

Keyword(s):

Shortest Paths ◽

Negative Cycles ◽

Dynamic Shortest Paths

Download Full-text

Maximizing Job Completions Online

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_20 ◽

1998 ◽

pp. 235-246 ◽

Cited By ~ 14

Author(s):

Bala Kalyanasundaram ◽

Kirk Pruhs

Download Full-text

External Memory Algorithms

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_1 ◽

1998 ◽

pp. 1-25 ◽

Cited By ~ 5

Author(s):

Jeffrey Scott Vitter

Keyword(s):

External Memory ◽

External Memory Algorithms

Download Full-text

Complexity Estimates Depending on Condition and Round-Off Error

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_10 ◽

1998 ◽

pp. 115-126 ◽

Cited By ~ 3

Author(s):

Felipe Cucker ◽

Steve Smale

Download Full-text

A Randomized Algorithm for Two Servers on the Line (Extended Abstract)

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_21 ◽

1998 ◽

pp. 247-258 ◽

Cited By ~ 8

Author(s):

Yair Bartal ◽

Marek Chrobak ◽

Lawrence L. Larmore

Keyword(s):

Randomized Algorithm

Download Full-text

Augmenting Suffix Trees, with Applications

Algorithms — ESA’ 98 - Lecture Notes in Computer Science ◽

10.1007/3-540-68530-8_6 ◽

1998 ◽

pp. 67-78 ◽

Cited By ~ 20

Author(s):

Yossi Matias ◽

S. Muthukrishnan ◽

Süleyman Cenk Sahinalp ◽

Jacob Ziv

Keyword(s):

Suffix Trees

Download Full-text

Algorithms — ESA’ 98 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

New Bounds for Oblivious Mesh Routing

Analogs and Duals of the MAST Problem for Sequences and Trees

Analyzing an Infinite Parallel Job Allocation Process

Finding an Optimal Path without Growing the Tree

Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

Maximizing Job Completions Online

External Memory Algorithms

Complexity Estimates Depending on Condition and Round-Off Error

A Randomized Algorithm for Two Servers on the Line (Extended Abstract)

Augmenting Suffix Trees, with Applications

Algorithms — ESA’ 98 - Lecture Notes in Computer Science
Latest Publications