J. R. Black, C. U. Martel, and H. Qi, Graph and hashing algorithms for modern architectures: design and performance, Proc. 2nd Workshop on Algorithm Eng. WAE 98, Max-Planck Inst. fur Informatik, 1998, in TR MPI-I-98-1-019, pp. 37-- 48. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Algorithms and Experiments: The New (and Old) Methodology - Moret, Shapiro (Correct)
.... alter the predictions of asymptotic analysis; a classic example is hashing: most textbook on data structures still advocate using double hashing in preference to linear probing, whereas experimental data clearly indicates that linear probing is the faster method, thanks to its good locality (see [BMQ98] Pioneering studies by Ladner and his coworkers [LL96, LL97] established that cache optimization was feasible, algorithmically interesting, and worthwhile, even for such old friends as sorting algorithms [ACVW01, LL97, RR99, XZK00] and priority queues [LL96, San00] indeed, even matrix ....
J. R. Black, C. U. Martel, and H. Qi, Graph and hashing algorithms for modern architectures: design and performance, Proc. 2nd Workshop on Algorithm Eng. WAE 98, Max-Planck Inst. fur Informatik, 1998, in TR MPI-I-98-1-019, pp. 37-- 48.
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