Show simple item record

dc.contributor.authorPugh, William W.en_US
dc.date.accessioned2007-04-23T17:19:29Z
dc.date.available2007-04-23T17:19:29Z
dc.date.issued1987-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-831en_US
dc.identifier.urihttps://hdl.handle.net/1813/6671
dc.description.abstractA new approach for providing an efficient implementation of concatenable ordered lists is discussed. The structures described have an equivalence to search trees. In balanced search trees the tree is continually modified to maintain certain balance properties; with our structure the tree is guaranteed to be structured randomly and with very high probability is relatively balanced. We thus avoid the overhead associated with explicitly maintaining the balance. Because of this property, the structures described are referred to as guaranteed-random trees.en_US
dc.format.extent1615219 bytes
dc.format.extent461532 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleEfficient Concatenable Ordered Listsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics