Lower and upper bounds on obtaining history independence☆
Under an Elsevier user license
open archive
Keywords
History independent data-structures
Lower bounds
Privacy
The heap data-structure
The queue data-structure
Cited by (0)
Copyright © 2005 Elsevier Inc. All rights reserved.