skip to content
On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991 Preview this item
ClosePreview this item
Checking...

On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991

Author: Lyle A McGeoch; Daniel Dominic Sleator
Publisher: Providence : American mathematical society ; Baltimore : Maryland, cop. 1992.
Series: DIMACS series in discrete mathematics and theoretical computer science, 7
Edition/Format:   Print book : Conference publication : EnglishView all editions and formats
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

 

Find a copy in the library

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

Details

Material Type: Conference publication
Document Type: Book
All Authors / Contributors: Lyle A McGeoch; Daniel Dominic Sleator
ISBN: 082186596X 9780821865965 0897914651 9780897914659
OCLC Number: 468016105
Notes: Actes de "DIMACS workshop on on-line algorithms", tenu à New Brunswick du 11 au 13 février 1991.
Bibliogr. à la fin de chaque chap.
Description: XII-179 p. : ill. ; 26 cm.
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.
Series Title: DIMACS series in discrete mathematics and theoretical computer science, 7
Responsibility: Lyle A. McGeoch, Daniel D. Sleator, ed.
More information:

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/468016105>
library:oclcnum"468016105"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
rdf:valueUnknown value: cnp
schema:about
schema:about
schema:about
schema:about
schema:author
schema:copyrightYear"op."
schema:datePublished"1992"
schema:editor
schema:editor
schema:exampleOfWork<http://worldcat.org/entity/work/id/866310574>
schema:inLanguage"en"
schema:isPartOf
schema:name"On-line algorithms : proceedings of a DIMACS workshop, February 11-13, 1991"
schema:publication
schema:publisher
schema:publisher
schema:workExample
schema:workExample
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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