skip to content
On-line algorithms : Workshop : Papers.
ClosePreview this item
Checking...

On-line algorithms : Workshop : Papers.

Author: Lyle A McGeoch; Daniel D Sleator; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
Publisher: Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, ©1992.
Edition/Format:   Article : Conference publication : Government publication : English
Database:WorldCat
Summary:

Contains the proceedings of the Workshop on On-line Algorithms held at the DIMACS Center at Rutgers University in February 1991. This work examines the ways in which randomization can be used to  Read more...

Rating:

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

Subjects
More like this

 

&AllPage.SpinnerRetrieving;

Find a copy in the library

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

Details

Material Type: Conference publication, Government publication
Document Type: Article
All Authors / Contributors: Lyle A McGeoch; Daniel D Sleator; NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
ISBN: 082186596X 9780821865965 0897914651 9780897914659
OCLC Number: 846541488
Contents: A graph-theoretic game and its application to the $k$-server problem (extended abstract) by N. Alon, R. M. Karp, D. Peleg, and D. West The server problem and on-line games by M. Chrobak and L. L. Larmore The harmonic online $K$-server algorithm is competitive by E. F. Grove The $K$-server dual and loose competitiveness for paging by N. Young A statistical adversary for on-line algorithms by P. Raghavan On-line graph coloring by H. A. Kierstead and W. T. Trotter Online weighted matching by B. Kalyanasundaram and K. Pruhs On the competitiveness of splay trees: Relations to the union-find problem by J. M. Lucas Competitive group testing by D. Z. Du and F. K. Hwang Randomized algorithms for multiprocessor page migration by J. Westbrook Navigating in unfamiliar geometric terrain (extended summary) by A. Blum, P. Raghavan, and B. Schieber Visual searching and mapping by B. Kalyanasundaram and K. Pruhs Scheduling parallel machines on-line by D. B. Shmoys, J. Wein, and D. P. Williamson Competitive paging with locality of reference (brief summary) by A. Borodin, S. Irani, P. Raghavan, and B. Schieber Lower bounds for on-line graph coloring by M. M. Halldorsson and M. Szegedy.

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/846541488>
library:oclcnum"846541488"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/846541488>
rdf:typeschema:Article
schema:contributor
schema:contributor
<http://viaf.org/viaf/160155122>
rdf:typeschema:Organization
schema:name"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science."
schema:contributor
schema:copyrightYear"1992"
schema:datePublished"1992"
schema:exampleOfWork<http://worldcat.org/entity/work/id/1356287988>
schema:inLanguage"en"
schema:name"On-line algorithms : Workshop : Papers."@en
schema:publisher
schema:publisher
schema:url
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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