FLOYD, R. W. Permuting information in idealized two-level storage. In Complexity of Computer Calculations (1972), pp. 105--109. R. Miller and J. Thatcher, Eds. Plenum, New York. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Optimal Deterministic Sorting on Parallel Disks - Nodine, Vitter (1992) (6 citations) (Correct)
Reducing I/O Complexity by Simulating Coarse.. - Dehne, Dittrich.. (1999) (Correct)
Towards a Theory of Cache-Efficient Algorithms - Sen, Chatterjee, Dumir (1999) (13 citations) (Correct)
Efficient External-Memory Data Structures and Applications - Arge (1996) (32 citations) (Correct)
Simple Randomized Mergesort on Parallel Disks - Rakesh Barve Dept (1996) (41 citations) (Correct)
Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
Cache-Efficient Matrix Transposition - Chatterjee, Sen (2000) (5 citations) (Correct)
Optimal Parallel Sorting in Multi-Level Storage - Alok Aggarwal Ibm (1994) (21 citations) (Correct)
Efficient External-Memory Data Structures and Applications - Arge (1996) (32 citations) (Correct)
Cache-Efficient Matrix Transposition - Chatterjee, Sen (2000) (5 citations) (Correct)
Minimizing the Input/Output Bottleneck - Nodine (1992) (Correct)
Towards a Theory of Cache-Efficient Algorithms (Extended Abstract) - Sen, al. (Correct)
Simple Randomized Mergesort on Parallel Disks - Barve, Grove, Vitter (1996) (41 citations) (Correct)
Early Experiences in Implementing the Buffer Tree - Hutchinson, Maheshwari.. (1997) (5 citations) (Correct)
New Coding Techniques for Improved Bandwidth Utilization - Adler (1998) (5 citations) (Correct)
Towards an Optimal Bit-Reversal Permutation Program - Carter, Gatlin (1998) (6 citations) (Correct)
Simple Randomized Mergesort on Parallel Disks - Barve, Grove, Vitter (1996) (41 citations) (Correct)
Rectilinear Steiner Tree Minimization on a Workstation - Thomborson, Alpern, Carter (1992) (4 citations) (Correct)
Reducing I/O Complexity by Simulating - Coarse Grained Parallel (Correct)
Reducing I/O Complexity by Simulating Coarse.. - Dehne, Hutchinson, .. (1999) (Correct)
Reducing I/O Complexity by Simulating Coarse.. - Dehne, Hutchinson, .. (1999) (Correct)
Bulk Synchronous Parallel Algorithms for the.. - Dehne, Dittrich.. (2002) (2 citations) (Correct)
Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (1999) (Correct)
Towards a Theory of Cache-Efficient Algorithms - Sen, Chatterjee (1999) (13 citations) (Correct)
Reducing I/O Complexity by Simulating Coarse.. - Dehne.. (1999) (Correct)
First 50 documents
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