69 search results - page 1 / 14 » Merkle Tree Traversal in Log Space and Time |
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
CTRSA
2003
Springer
13 years 10 months ago
2003
Springer
We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For...
MPC
1992
Springer
13 years 9 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...
ENTCS
2002
13 years 4 months ago
2002
Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the tree...
ESOP
2009
Springer
13 years 8 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...