Pages that link to "Item:Q1333432"
From MaRDI portal
The following pages link to Algorithms for parallel memory, I: Two-level memories (Q1333432):
Displayed 23 items.
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Efficient out-of-core sorting algorithms for the parallel disks model (Q645818) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Dynamic dictionary matching in external memory (Q1275745) (← links)
- Algorithms for parallel memory. II: Hierarchical multilevel memories (Q1333433) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep (Q1384210) (← links)
- An efficient external sorting algorithm (Q1607058) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- Analysis of simple randomized buffer management for parallel I/O (Q2390215) (← links)
- External matrix multiplication and all-pairs shortest path (Q2390290) (← links)
- On the importance of cache tuning in a cache-aware algorithm: a case study (Q2458690) (← links)
- A comparison of sequential Delaunay triangulation algorithms. (Q2482895) (← links)
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS (Q4682170) (← links)
- Congruent Number Theta Coefficients to 1012 (Q4931649) (← links)
- Worst-case efficient external-memory priority queues (Q5054847) (← links)
- The buffer tree: A new technique for optimal I/O-algorithms (Q5057446) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep (Q5057447) (← links)
- An Input/Output Efficient Algorithm for Hessenberg Reduction (Q5207035) (← links)
- (Q5743422) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- External-memory algorithms for processing line segments in geographic information systems (Q6102308) (← links)