2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972863

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Compact Routing on Power Law Graphs with Additive Stretch

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.12 ◽

2006 ◽

Cited By ~ 24

Author(s):

Arthur Brady ◽

Lenore Cowen

Keyword(s):

Power Law ◽

Compact Routing ◽

Additive Stretch

Download Full-text

Optimal Incremental Sorting

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.16 ◽

2006 ◽

Cited By ~ 7

Author(s):

Rodrigo Paredes ◽

Gonzalo Navarro

Keyword(s):

Incremental Sorting

Download Full-text

Distributed Routing in Small-World Networks

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.14 ◽

2006 ◽

Cited By ~ 21

Author(s):

Oskar Sandberg

Keyword(s):

Small World ◽

Small World Networks ◽

Distributed Routing

Download Full-text

Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.7 ◽

2006 ◽

Cited By ~ 2

Author(s):

Grzegorz Malewicz

Keyword(s):

Parallel Scheduling

Download Full-text

An Experimental Study of Old and New Depth Measures

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.5 ◽

2006 ◽

Cited By ~ 13

Author(s):

John Hugg ◽

Eynat Rafalin ◽

Kathryn Seyboth ◽

Diane Souvaine

Keyword(s):

Experimental Study

Download Full-text

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.13 ◽

2006 ◽

Cited By ~ 88

Author(s):

Andrew V. Goldberg ◽

Haim Kaplan ◽

Renato F. Werneck

Keyword(s):

Shortest Path ◽

Efficient Point ◽

Shortest Path Algorithms ◽

Point To Point

Download Full-text

Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.8 ◽

2006 ◽

Cited By ~ 3

Author(s):

Eyjolfur Asgeirsson ◽

Cliff Stein

Keyword(s):

Markov Chains ◽

On Line ◽

Bounded Space ◽

Design Algorithms

Download Full-text

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.9 ◽

2006 ◽

Cited By ~ 16

Author(s):

Jens Gramm ◽

Jiong Guo ◽

Falk Hüffner ◽

Rolf Niedermeier

Keyword(s):

Data Reduction ◽

Heuristic Algorithms

Download Full-text

Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.6 ◽

2006 ◽

Author(s):

David Mount

Download Full-text

Fast Reconfiguration of Data Placement in Parallel Disks

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) ◽

10.1137/1.9781611972863.10 ◽

2006 ◽

Cited By ~ 11

Author(s):

Srinivas Kashyap ◽

Samir Khuller ◽

Yung-Chun (Justin) Wan ◽

Leana Golubchik

Keyword(s):

Data Placement ◽

Parallel Disks

Download Full-text

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Compact Routing on Power Law Graphs with Additive Stretch

Optimal Incremental Sorting

Distributed Routing in Small-World Networks

Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty

An Experimental Study of Old and New Depth Measures

Reach for A*: Efficient Point-to-Point Shortest Path Algorithms

Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching

Fast Reconfiguration of Data Placement in Parallel Disks

2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX)
Latest Publications