A Randomized Data Structure for Ordered Sets
Name
MIT-LCS-TM-297.pdf
Size
2.82 MB
Format
Adobe PDF
Checksum (MD5)
a0b78c9b6c9264feee53c60516431994
Author(s)
Bentley, Jon L.
Leighton Frank Thomson
Lepley, Margaret
Stanat, Donald F.
Steele, J. Michael
Date Issued
May 1986
Series/Report no.
MIT-LCS-TM-297
Abstract
In this paper, we consider a simple randomized data structure for representing ordered sets, and give a precise combinatorial analysis of the time required to perform various operations. In addition to a practical data structure, this work provides new and nontrivial proabilistic lower bounds and an instance of a practical problem whose randomized complexity is provably less than its deterministic complexity.
Persistent DSpace Link
