N. Rahman, R. Cole, and R. Raman. Optimised predecessor data structures for internal memory. In Proc. 5th Int. Workshop on Algorithm Engineering (WAE), volume 2141, pages 67-78, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cache-Oblivious B-Trees - Bender, Demaine, Farach-Colton (2000) (25 citations) (Correct)
....S consecutive elements in O(1 S=B) memory transfers (instead of the na ve O(S) and updates in O(1 B ) amortized memory transfers. B tree Simpli cation via packed memory structure low height trees [BDIW02, BFJ02] Simpli cation and persistence via exponential structures [RCR01, BCR02] Implicit [FG03a, FG03b] Static search trees Basic layout [Pro99] Experiments [LFN02] Optimal constant factor [BBF 03] Linked lists supporting scans [BCDFC02] Priority queues [ABD 02b, BF02b] Trie layout [ABD 02a, BDFC02] Computational geometry Distribution ....
Naila Rahman, Richard Cole, and Rajeev Raman. Optimised predecessor data structures for internal memory. In Proceedings of the 5th International Workshop on Algorithm Engineering, volume 2141 of Lecture Notes in Computer Science, pages 67-78, Aarhus, Denmark, August 2001.
Efficient Tree Layout in a Multilevel Memory Hierarchy - Alstrup, Bender, Demaine, .. (2002) (Correct)
....the memory hierarchy parameters (block size and memory level size) As a consequence, such algorithms tune automatically to arbitrary memory hierarchies with an arbitrarily many memory levels. Examples of cache oblivious data structures include cache oblivious B trees [6] and its simpli cations [8, 9, 20], cacheoblivious persistent trees [5] cache oblivious priority queues [2] and cache oblivious linked lists [4] However, all of these data structures assume a uniform distribution on operations. Although [17] does not explicitly state its results in the external memory model, its approach ....
Naila Rahman, Richard Cole, and Rajeev Raman. Optimised predecessor data structures for internal memory. In Proceedings of the 5th International Workshop on Algorithm Engineering, volume 2141 of Lecture Notes in Computer Science, pages 67-78, Aarhus, Denmark, August 2001.
The Cost of Cache-Oblivious Searching - Bender, Brodal, Fagerberg, Ge.. (2003) (Correct)
No context found.
N. Rahman, R. Cole, and R. Raman. Optimised predecessor data structures for internal memory. In Proc. 5th Int. Workshop on Algorithm Engineering (WAE), volume 2141, pages 67-78, 2001.
On the Limits of Cache-Obliviousness - Brodal, Fagerberg (2003) (Correct)
No context found.
N. Rahman, R. Cole, and R. Raman. Optimised predecessor data structures for internal memory. In Proc. 5th Int. Workshop on Algorithm Engineering (WAE), volume 2141, pages 67--78. Springer, 2001.
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