69 search results - page 7 / 14 » Merkle Tree Traversal in Log Space and Time |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, ...
COMPGEOM
1992
ACM
13 years 12 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
MST
2006
13 years 7 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
DEXA
2008
Springer
13 years 9 months ago
2008
Springer
Information filtering systems constitute a critical component in modern information seeking applications. As the number of users grows and the information available becomes even bi...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...