Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics

Front Cover
Rajeev Raman, Robert Sedgewick, Matthias F. Stallmann
SIAM, 2006 M01 1 - 281 pages
The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

An Experimental Study of Point Location in General Planar Arrangements
16
Summarizing Spatial Data Streams Using ClusterHulls
26
DistanceSensitive Bloom Filters
41
An Experimental Study of Old and New Depth Measures
51
The Art of Proximity Searching
65
Using Markov Chains to Design Algorithms for BoundedSpace OnLine Bin Cover
75
8o Data Reduction Exact and Heuristic Algorithms for Clique Cover
86
Fast Reconfiguration of Data Placement in Parallel Disks
95
I85 Deterministic Random Walks
185
Binary Trees Left and Right Paths WKB Expansions and Painlevé Transcendents
198
On the Variance of Quickselect
205
Semirandom Models as Benchmarks for Coloring Algorithms
211
New Results and Open Problems for Deletion Channels
222
Distinct Values Estimators for Power Law Distributions
230
A RandomSurfer WebGraph Model
238
Asymptotic Optimality of the Static Frequency Caching in the Presence of Correlated Requests
247

i08 ForceDirected Approaches to Sensor Localization
108
I19 Compact Routing on Power Law Graphs with Additive Stretch
119
Efficient PointtoPoint Shortest Path Algorithms
129
I44 Distributed Routing in SmallWorld Networks
144
Engineering MultiLevel Overlay Graphs for ShortestPath Queries
156
I7 Optimal Incremental Sorting
171
Exploring the Average Values of Boolean Functions via Asymptotics and Experimentation
253
A Transfer Matrix Approach
263
Random Partitions with Parts in the Range of a Polynomial
273
28 Author Index
281
Copyright

Common terms and phrases

Bibliographic information