Next:
The Input/Output Complexity of
Up:
Online Library of Jeff
Previous:
Algorithms and Data Structures
PARALLEL ALGORITHMS AND SCIENTIFIC COMPUTING
The Input/Output Complexity of Sorting and Related Problems
I/O Overhead and Parallel VLSI Architectures for Lattice Computations
Parallel Transitive Closure and Point Location in Planar Structures
Optimal Algorithms for Parallel Memory I: Two-Level Memories
Optimal Algorithms for Parallel Memory I: Two-Level Memories
Large-Scale Sorting in Uniform Memory Hierarchies
Optimal Deterministic Sorting on Parallel Disks
Optimal Deterministic Sorting on Parallel Processors and Parallel Memory Hierarchies
Learning in Parallel
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding
Optimal Cooperative Search in Fractional Cascaded Data Structures
A Divide and Conquer Approach to Shortest Paths in Planar Layered Graphs
TPIE: Transparent Parallel I/O Programming Environment
I/O-Efficient Scientific Computation using TPIE
Simple Randomized Mergesort on Parallel Disks
Modeling and optimizing I/O throughput of multiple disks on a bus
Online Data Structures in External Memory
Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings
External Memory Algorithms and Data Structures: Dealing with Massive Data
Distribution Sort with Randomized Cycling
Duality Between Prefetching and Queued Writing with Parallel Disks
Jeff Vitter
2009-11-23
