Algorithm Theory - SWAT 2004
From MaRDI portal
(Redirected from Publication:5315399)
Algorithm Theory - SWAT 2004 (scientific article; zbMATH DE number 2203600)
Algorithm Theory - SWAT 2004 (scientific article; zbMATH DE number 2203600)
Recommendations
- Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs
- A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- Automata, Languages and Programming
- scientific article; zbMATH DE number 1979501
Cited in
(14)- A survey on priority queues
- A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
- Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs
- Improving the cache-efficiency of shortest path search
- External memory priority queues with decrease-key and applications to graph algorithms
- Cache oblivious minimum cut
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
- Automata, Languages and Programming
- Optimal cache-oblivious mesh layouts
- External-memory priority queues with optimal insertions
This page was built for publication: Algorithm Theory - SWAT 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315399)
