Documents Related by Co-Citation

22 Asynchronous Parallel Disk Sorting – Roman Dementiev, Peter Sanders - 2003
69 I/O-Complexity of Graph Algorithms – Kameshwar Munagala, Abhiram Ranade - 1999
539 The input/output complexity of sorting and related problems – A Aggarwal, J Vitter - 1988
24 On external-memory MST, SSSP and multi-way planar graph separation – Lars Arge, Gerth Stølting Brodal, Laura Toma - 2000
18 A computational study of external-memory BFS algorithms – Deepak Ajwani, Roman Dementiev, Ulrich Meyer - 2006
173 External-Memory Graph Algorithms – Yi-Jen Chiang , Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter - 1995
48 External-memory breadth-first search with sublinear I/O – Kurt Mehlhorn, Ulrich Meyer - 2002
25 Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths – Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh - 2004
89 A Functional Approach to External Graph Algorithms – James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook - 1998
11 From parallel to external list ranking – J F Sibeyn - 1997
37 Computing point-to-point shortest paths from external memory – A V GOLDBERG, R F F WERNECK - 2005
23 Engineering a cache-oblivious sorting algorithm – Gerth Stølting Brodal, Rolf Fagerberg Kristoffer Vinther - 2004
8557 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
21 External memory graph algorithms – Y-J Chiang, M T Goodrich, E F Grove, R Tamasia, D E Vengroff, J S Vitter - 1995
320 External Memory Algorithms and Data Structures – Jeffrey Scott Vitter - 1998
3 Compact Data Structures for Fast Queries – D Blandford
21 Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences – Ricardo Baeza-yates, Ro Salinger, Santiago Chile - 2005
19 Optimal merging of 2 elements with n elements – F K HWANG, S LIN - 1971
36 A Fast Set Intersection Algorithm for Sorted Sequences – R A Baeza-Yates - 2004