CIAC
2000
Springer
13 years 8 months ago
2000
Springer
We present an efficient algorithm for the approximate median selection problem. The algorithm works in-place; it is fast and easy to implement. For a large array it returns, with ...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
CIAC
2000
Springer
13 years 9 months ago
2000
Springer
CIAC
2000
Springer
13 years 9 months ago
2000
Springer