Open Access
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
Gerth Stølting Brodal,Rolf Fagerberg,Ulrich Meyer,Norbert Zeh,Torben Hagerup,Jyrki Katajainen +5 more
- pp 480-492
TLDR
This work presents improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights and removes the performance gap between the currently best cache-aware algorithms for these problems.About:
The article was published on 2004-01-01 and is currently open access. It has received 38 citations till now. The article focuses on the topics: Cache-oblivious algorithm & Breadth-first search.read more
Citations
More filters
Book ChapterDOI
Optimal strategies in priced timed game automata
TL;DR: In this article, the authors prove that the optimal cost for winning a timed game is computable under conditions concerning the non-zenoness of cost, and under stronger conditions (strictness of constraints) they prove that in case an optimal strategy exists, they can compute a state-based winning optimal strategy.
Journal ArticleDOI
A functional correspondence between call-by-need evaluators and lazy abstract machines
TL;DR: This article derives a lazy abstract machine from an ordinary call-by-need evaluator that threads a heap of updatable cells, using closure conversion, transformation into continuation-passing style, and defunctionalization of continuations.
Book ChapterDOI
Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks
TL;DR: The concept of zero-knowledge (ZK) has become of fundamental importance in cryptography as mentioned in this paper, and it has become one of the most important concepts in cryptography in the quantum setting.
Journal IssueDOI
STXXL: standard template library for XXL data sets
TL;DR: The software library STXXL is presented, an implementation of the C++ standard template library (STL) for processing huge data sets that can fit only on hard disks, and it is the first I-O-efficient algorithm library that supports the pipelining technique that can save more than half of the I-Os.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Proceedings ArticleDOI
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
TL;DR: The structure, Fibonacci heaps (abbreviated F-heaps), extends the binomial queues proposed by Vuillemin and studied further by Brown to obtain improved running times for several network optimization algorithms.
Journal ArticleDOI
The input/output complexity of sorting and related problems
Alok Aggarwal,S. Vitter Jeffrey +1 more
TL;DR: Tight upper and lower bounds are provided for the number of inputs and outputs (I/OS) between internal memory and secondary storage required for five sorting-related problems: sorting, the fast Fourier transform (FFT), permutation networks, permuting, and matrix transposition.
Journal ArticleDOI
External memory algorithms and data structures: dealing with massive data
TL;DR: The state of the art in the design and analysis of external memory algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs is surveyed.
Book ChapterDOI
Cache-oblivious algorithms
TL;DR: It is proved that an optimal cache-oblivious algorithm designed for two levels of memory is also optimal across a multilevel cache hierarchy, and it is shown that the assumption of optimal replacement made by the ideal-cache model can be simulated efficiently by LRU replacement.