Roman Dementiev, Lutz Kettner, Jens Mehnert, Peter Sanders  Home/Search
Context
Related
| mpisb.mpg.de/~sanders/pape...veb.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~sanders/pa...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Search tree data structures like van Emde Boas (vEB) trees are a theoretically attractive alternative to comparison based search trees because they have better asymptotic performance for small integer keys and large inputs. This paper studies their practicability using 32 bit keys as an example. While direct implementations of vEB-trees cannot compete with good implementations of comparison based data structures, our tuned data structure signi cantly outperforms comparison based... (Update)
Similar documents based on text: More All
1.0: Engineering a Sorted List Data Structure for 32 Bit Keys - Dementiev, Kettner.. (Correct)
0.2: Engineering an External Memory Minimum Spanning Tree.. - Dementiev, Sanders.. (2004) (Correct)
0.1: Word-based RAM Priority Queues - Liu (2001) (Correct)
BibTeX entry: (Update)
@misc{ dementiev-engineering,
author = "Roman Dementiev and Lutz Kettner and Jens Mehnert and Peter Sanders",
title = "Engineering a Sorted List Data Structure for 32 Bit Keys",
url = "citeseer.ist.psu.edu/695262.html" }
Citations (may not include all citations):375 The LEDA Platform of Combinatorial and Geometric Computing - Mehlhorn, aher - 1999
169 Algorithms for reporting and counting geometric intersection.. (context) - Bentley, Ottmann - 1979
157 The Art of Computer Programming | Sorting and Searching (context) - Knuth - 1998
68 Approximation algorithms for bin packing: A survey (context) - Co, Jr et al. - 1997
41 Fast algorithms for bin packing (context) - Johnson - 1974
20 Generic programming and the STL : using and extending the C+.. (context) - Austern - 2001
15 Bounded ordered dictionaries in O (context) - Mehlhorn, aher - 1990
15 Preserving order in a forest in less than logarithmic time (context) - Boas - 1977
11 Multi-phase algorithms for throughput maximization for real-.. - Berman, DasGupta - 2000
10 IP address lookup made fast and simple - Crescenzi, Dardini et al. - 1999
4 A pragmatic implementation of monotone priority queues (context) - Andersson, Thorup - 1996
3 chapter Algorithms for Hardware Caches and TLB (context) - Rahman, Memory et al. - 2003
2 ur ein beschranktes Universum (context) - Wenzel, orterb - 1992
2 Comparison of search-tree data structures in LEDA (context) - aher
2 chapter Case Study: Memory Conscious Parallel Sorting (context) - Gonzalez, Larriba-Pey et al. - 2003
[Article contains additional citations not shown here]
Documents on the same site (http://www.mpi-sb.mpg.de/~sanders/papers/index.html): More
Better Algorithms for Parallel Backtracking - Sanders (1995) (Correct)
Asynchronous Random Polling Dynamic Load Balancing - Sanders (Correct)
A Parallelization of Dijkstra's Shortest Path Algorithm - Crauser, Mehlhorn, Meyer.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC