Cited in
(26)- Processing Huge Graphs with Stxxl
- A computational study of external-memory BFS algorithms
- Bidirectional Text Compression in External Memory
- On sorting, heaps, and minimum spanning trees
- Inducing suffix and LCP arrays in external memory
- LCP array construction in external memory
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- Fast construction of compressed web graphs
- Mechanisms with monitoring for truthful RAM allocation
- Flash memory efficient LTL model checking
- TPIE
- MCSTL
- BEEM
- GPUTeraSort
- Terracost
- Algorithm 360
- BUbiNG
- PCM
- GraphChi
- TopoTxR
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
- Terracost: computing least-cost-path surfaces for massive grid terrains
- Sequential and parallel algorithms and data structures. The basic toolbox
- Parallel and I/O-efficient randomisation of massive networks using global curveball trades
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
This page was built for software: STXXL
