skip to content
An [Omega](n log n) lower bound for a restricted form of on-line labeling algorithm Preview this item
ClosePreview this item
Checking...

An [Omega](n log n) lower bound for a restricted form of on-line labeling algorithm

Author: J Zhang; Paul Frederick Dietz; Joel Irvin Seiferas
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: "Under the Normalization Assumption on the algorithms, the labeling problem has a lower bound [Omega](n log n). This is proved by a mechanism dividing the label intervals into lists of collections whose corresponding costs are bounded from below by a suitably chosen function."
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: J Zhang; Paul Frederick Dietz; Joel Irvin Seiferas
OCLC Number: 21913871
Notes: "March 1989"--Cover.
Description: 6 leaves ; 28 cm.
Series Title: University of Rochester.; Department of Computer Science.; Technical report
Responsibility: Ju Zhang, Paul Dietz and Joel Seiferas.

Abstract:

Abstract: "Under the Normalization Assumption on the algorithms, the labeling problem has a lower bound [Omega](n log n). This is proved by a mechanism dividing the label intervals into lists of collections whose corresponding costs are bounded from below by a suitably chosen function."

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/21913871>
library:oclcnum"21913871"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/21913871>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "Under the Normalization Assumption on the algorithms, the labeling problem has a lower bound [Omega](n log n). This is proved by a mechanism dividing the label intervals into lists of collections whose corresponding costs are bounded from below by a suitably chosen function.""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/23122901>
schema:inLanguage"en"
schema:name"An [Omega](n log n) lower bound for a restricted form of on-line labeling 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.