Compressed full-text indexes
Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …
of these indexes has traditionally been their space consumption. A recent trend is to develop …
Undirected single-source shortest paths with positive integer weights in linear time
M Thorup - Journal of the ACM (JACM), 1999 - dl.acm.org
The single-source shortest paths problem (SSSP) is one of the classic problems in
algorithmic graph theory: given a positively weighted graph G with a source vertex s, find the …
algorithmic graph theory: given a positively weighted graph G with a source vertex s, find the …
[BOOK][B] Spanning trees and optimization problems
The design of approximation algorithms for spanning tree problems has become an exciting
and important area of theoretical computer science and also plays a significant role in …
and important area of theoretical computer science and also plays a significant role in …
Δ-step**: a parallelizable shortest path algorithm
The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …
[BOOK][B] Handbook of data structures and applications
Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …
until now there was no book that focused exclusively on the wide variety of data structures …
A reliable randomized algorithm for the closest-pair problem
The following two computational problems are studied: Duplicate grou**: Assume
thatnitems are given, each of which is labeled by an integer key from the set {0,…, U− 1} …
thatnitems are given, each of which is labeled by an integer key from the set {0,…, U− 1} …
[PDF][PDF] Sorting in linear time?
A Andersson, T Hagerup, S Nilsson… - Proceedings of the twenty …, 1995 - dl.acm.org
We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O..
2W–1 in O (n log log n) time, for arbitrary wz log n, a significant improvement over the bound …
2W–1 in O (n log log n) time, for arbitrary wz log n, a significant improvement over the bound …
Sorting and searching on the word RAM
T Hagerup - STACS 98: 15th Annual Symposium on Theoretical …, 1998 - Springer
A word RAM is a unit-cost random-access machine with a word length of w bits, for some w,
and with an instruction repertoire similar to that found in present-day computers. The simple …
and with an instruction repertoire similar to that found in present-day computers. The simple …
Deterministic sorting in O(nlog log n) time and linear space
Y Han - Proceedings of the thiry-fourth annual ACM symposium …, 2002 - dl.acm.org
We present a fast deterministic algorithm for integer sorting in linear space. Our algorithm
sorts n integers in the range {0, 1, 2,…, m—1} in linear space in O (n log log n) time. This …
sorts n integers in the range {0, 1, 2,…, m—1} in linear space in O (n log log n) time. This …
Integer priority queues with decrease key in constant time and the single source shortest paths problem
M Thorup - Proceedings of the thirty-fifth annual ACM symposium …, 2003 - dl.acm.org
We consider Fibonacci heap style integer priority queues supporting insert and decrease
key operations in constant time. We present a deterministic linear space solution that with n …
key operations in constant time. We present a deterministic linear space solution that with n …