Pages that link to "Item:Q5233463"

The following pages link to 2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) (Q5233463):

Displayed 10 items.

• Exact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications (Q5233464) ‎ (← links)
• Distance-Sensitive Bloom Filters (Q5233465) ‎ (← links)
• Implementation and Experiments with an Algorithm for Parallel Scheduling of Complex Dags under Uncertainty (Q5233466) ‎ (← links)
• Using Markov Chains To Design Algorithms For Bounded-Space On-Line Bin Cover (Q5233467) ‎ (← links)
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover (Q5233468) ‎ (← links)
• Compact Routing on Power Law Graphs with Additive Stretch (Q5233469) ‎ (← links)
• Reach for <i>A</i>*: Efficient Point-to-Point Shortest Path Algorithms (Q5233470) ‎ (← links)
• Distributed Routing in Small-World Networks (Q5233471) ‎ (← links)
• Engineering Multi-Level Overlay Graphs for Shortest-Path Queries (Q5233472) ‎ (← links)
• Optimal Incremental Sorting (Q5233473) ‎ (← links)