|
3
|
Design and Analysis of Hashing Algorithms with Cache Effects
– Hongbin Qi, Charles U. Martel
- 1998
|
|
19
|
High-Performance Algorithm Engineering for Computational Phylogenetics
– Bernard M. E. Moret, David A. Bader, Tandy Warnow
- 2002
|
|
8
|
Algorithms and Experiments: The New (and Old) Methodology
– Bernard M. E. Moret, Henry D. Shapiro
- 2001
|
|
33
|
Towards A Discipline Of Experimental Algorithmics
– Bernard M. E. Moret
|
|
67
|
Nonlinear Array Layouts for Hierarchical Memory Systems
– Siddhartha Chatterjee, Vibhor V. Jain, Alvin R. Lebeck, Shyam Mundhra, Mithuna Thottethodi
- 1999
|
|
|
Redesigning the String Hash Table, Burst Trie, and BST to Exploit Cache
– Nikolas Askitis, JUSTIN ZOBEL
- 2011
|
|
21
|
A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation
– Richard E. Ladner, Ray Fortna, Bao-Hoang Nguyen
- 2002
|
|
164
|
Cache-Conscious Structure Layout
– Trishul M. Chilimbi , Mark D. Hill, James R. Larus
- 1999
|
|
29
|
Scanning and traversing: maintaining data for traversals in a memory hierarchy
– Michael A. Bender, Richard Cole, Erik D. Demaine
- 2002
|
|
43
|
Towards a Theory of Cache-Efficient Algorithms
– Sandeep Sen, Siddhartha Chatterjee, Neeraj Dumir
- 1999
|
|
25
|
Cache Performance Analysis of Traversals and Random Accesses
– Richard E. Ladner, James D. Fix, Anthony Lamarca
- 1999
|
|
1
|
Priority Queues and Dijkstra’s Algorithm ∗
– Mo Chen, Rezaul Alam, Chowdhury Vijaya Ramach, David Lan, Roche Lingling Tong
- 2007
|
|
13
|
Adapting Radix Sort to the Memory Hierarchy
– Naila Rahman, Rajeev Raman
- 2000
|
|
|
A Novel In-Place Sorting Algorithm with O(n log z) Comparisons and O(n log z) Moves
– Hanan Ahmed Hosni Mahmoud, Nadia Al-Ghreimil
- 2006
|
|
6
|
Optimum Binary Search Trees On The Hierarchical Memory Model
– Shripad Thite
- 2001
|
|
|
MACHINE LEARNING TECHNIQUES FOR CODE GENERATION AND OPTIMIZATION
– Xiaoming Li
- 2006
|
|
7
|
Cache-oblivious algorithms and data structures
– Gerth Stølting Brodal
- 2004
|
|
1
|
An Experimental Study of Sorting and Branch Prediction
– Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg
|
|
46
|
Fast Priority Queues for Cached Memory
– Peter Sanders
- 1999
|