skip to content
A lower bound framework for binary search trees with rotations Preview this item
ClosePreview this item
Checking...

A lower bound framework for binary search trees with rotations

Author: Jonathan Derryberry; Daniel D Sleator; Chengwen Chris Wang
Publisher: Pittsburgh, Pa. : School of Computer Science, Carnegie Mellon University, [2005].
Series: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-05-187.
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary search tree algorithm, including self-adjusting and offline ones. This new framework can be used to derive two previously known lower bounds."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Jonathan Derryberry; Daniel D Sleator; Chengwen Chris Wang
OCLC Number: 246976717
Notes: "November 22, 2005."
Description: 9 p. : ill. ; 28 cm.
Series Title: Research paper (Carnegie Mellon University. School of Computer Science), CMU-CS-05-187.
Responsibility: Jonathan Derryberry, Daniel Dominic Sleator, Chengwen Chris Wang.

Abstract:

Abstract: "This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary search tree algorithm, including self-adjusting and offline ones. This new framework can be used to derive two previously known lower bounds."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/246976717>
library:oclcnum"246976717"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/246976717>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"2005"
schema:description"Abstract: "This paper considers the problem of bounding below the cost of accessing a sequence of keys in a binary search tree. We develop a lower bound framework for this problem that applies to any binary search tree algorithm, including self-adjusting and offline ones. This new framework can be used to derive two previously known lower bounds.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/144085848>
schema:inLanguage"en"
schema:name"A lower bound framework for binary search trees with rotations"
schema:numberOfPages"9"
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.