skip to content
Elimination of amortization from Breu's algorithm Preview this item
ClosePreview this item
Checking...

Elimination of amortization from Breu's algorithm

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 : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "Breu [1] has given an algorithm for finding the maximum value between two pointers moving unidirectionally through an array. His algorithm achieves O(1) amortized time per operation. This paper describes how to eliminate the amortization from his algorithm, achieving O(1) worst-case time per operation."
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: 22587091
Notes: "September 1989."Cover.
Description: 5 pages ; 28 cm.
Series Title: University of Rochester.; Department of Computer Science.; Technical report
Responsibility: Paul F. Dietz.

Abstract:

Abstract: "Breu [1] has given an algorithm for finding the maximum value between two pointers moving unidirectionally through an array. His algorithm achieves O(1) amortized time per operation. This paper describes how to eliminate the amortization from his algorithm, achieving O(1) worst-case time per operation."

Reviews

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

Tags

Be the first.

Similar Items

Related Subjects:(1)

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/22587091>
library:oclcnum"22587091"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/22587091>
rdf:typeschema:Book
schema:about
schema:about
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "Breu [1] has given an algorithm for finding the maximum value between two pointers moving unidirectionally through an array. His algorithm achieves O(1) amortized time per operation. This paper describes how to eliminate the amortization from his algorithm, achieving O(1) worst-case time per operation.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/24436422>
schema:inLanguage"en"
schema:name"Elimination of amortization from Breu's algorithm"@en
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.