Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-Reports 2004 Copyright 2004 Universität Bonn, Institut für Informatik, Abt. V
85258

23.07.2004

A Note on Traversing Skew Merkle Trees
Marek Karpinski and Yakov Nekrich
[Download PostScript] [Download PDF]

We consider the problem of traversing skew ( unbalanced ) Merkle trees and design an algorithm for traversing a skew Merkle tree in time O(log n/h) and space O(log n (2h/h)). This algorithm can be of special use in situations when exact number of items to be identified is not known in advance.

Last Change: 07/23/04 at 14:46:39
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope