scientific article; zbMATH DE number 910869
From MaRDI portal
Publication:4886043
Recommendations
Cited in
(43)- An external-memory depth-first search algorithm for general grid graphs
- A functional approach to external graph algorithms
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
- Efficient external memory algorithms by simulating coarse-grained parallel algorithms
- Heaps and heapsort on secondary storage
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- An external memory data structure for shortest path queries
- The red-blue pebble game on trees and DAGs with large input
- The complexity of flow on fat terrains and its i/o-efficient computation
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- An external-memory algorithm for string graph construction
- Lightweight data indexing and compression in external memory
- Flow decompositions in external memory
- Data-oblivious graph algorithms in outsourced external memory
- External-memory network analysis algorithms for naturally sparse graphs
- An I/O efficient algorithm for minimum spanning trees
- On Trade-Offs in External-Memory Diameter-Approximation
- Semi-external LTL Model Checking
- Cache-Oblivious Red-Blue Line Segment Intersection
- A computational study of external-memory BFS algorithms
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- scientific article; zbMATH DE number 1305093 (Why is no real title available?)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
- Memory requirements for table computations in partial k-tree algorithms
- The buffer tree: A new technique for optimal I/O-algorithms
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
- Permuting and batched geometric lower bounds in the I/O model
- External memory algorithms for finding disjoint paths in undirected graphs
- An input/output efficient algorithm for Hessenberg reduction
- Cache oblivious minimum cut
- Algorithm Theory - SWAT 2004
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
- Certifying induced subgraphs in large graphs
- External-memory algorithms for processing line segments in geographic information systems
- Optimal cache-oblivious mesh layouts
- Certifying induced subgraphs in large graphs
- Optimal offline ORAM with perfect security via simple oblivious priority queues
- I/O-efficient algorithms for graphs of bounded treewidth
- External-memory depth-first search algorithm for solid grid graphs
- Oblivious algorithms for multicores and networks of processors
- Assembling approximately optimal binary search trees efficiently using arithmetics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886043)
