STXXL
From MaRDI portal
Software:18898
swMATH6824MaRDI QIDQ18898FDOQ18898
Author name not available (Why is that?)
Cited In (16)
- 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
- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking
- Terracost
- Sequential and Parallel Algorithms and Data Structures
- Title not available (Why is that?)
- Flash memory efficient LTL model checking
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
- Mechanisms with Monitoring for Truthful RAM Allocation
- Inducing Suffix and LCP Arrays in External Memory
- LCP Array Construction in External Memory
- Fast Construction of Compressed Web Graphs
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
This page was built for software: STXXL
