skip to content
Optimal algorithms for list indexing and subset rank Preview this item
ClosePreview this item
Checking...

Optimal algorithms for list indexing and subset rank

Author: Paul Frederick Dietz
Publisher: Rochester, N.Y. : University of Rochester, Dept. of Computer Science, 1989.
Series: University of Rochester.; Department of Computer Science.; Technical report
Edition/Format:   Book : English
Database:WorldCat
Summary:
Abstract: "Fredman and Saks [1] have proved a [Omega](log n/log log n) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size."
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: Paul Frederick Dietz
OCLC Number: 22104135
Notes: Cover title.
"June 1989."
Description: 9 leaves ; 28 cm.
Series Title: University of Rochester.; Department of Computer Science.; Technical report
Responsibility: Paul F. Dietz.

Abstract:

Abstract: "Fredman and Saks [1] have proved a [Omega](log n/log log n) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size."

Reviews

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

Tags

Be the first.

Similar Items

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/22104135>
library:oclcnum"22104135"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "Fredman and Saks [1] have proved a [Omega](log n/log log n) amortized time lower bound for two problems, List Indexing and Subset Rank, in the cell probe model with logarithmic word size. This paper gives algorithms for both problems that achieve the lower bound on a RAM with logarithmic word size.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/22947796>
schema:inLanguage"en"
schema:isPartOf
schema:name"Optimal algorithms for list indexing and subset rank"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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