A Randomized Data Structure for Ordered Sets
| dc.contributor.author | Bentley, Jon L. | en_US |
| dc.contributor.author | Leighton Frank Thomson | en_US |
| dc.contributor.author | Lepley, Margaret | en_US |
| dc.contributor.author | Stanat, Donald F. | en_US |
| dc.contributor.author | Steele, J. Michael | en_US |
| dc.date.accessioned | 2023-03-29T14:27:39Z | |
| dc.date.available | 2023-03-29T14:27:39Z | |
| dc.date.issued | 1986-05 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149106 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-297 | |
| dc.title | A Randomized Data Structure for Ordered Sets | en_US |
