Find a copy online
Links to this item
Find a copy in the library
Finding libraries that hold this item...
|Additional Physical Format:||Online version:
Providence, R.I. : American Mathematical Society ; Baltimore, Md. : Association for Computing Machinery, ©1992
|Material Type:||Internet resource|
|Document Type:||Book, Internet Resource|
|All Authors / Contributors:||
Lyle A McGeoch; Daniel D Sleator; DIMACS (Group)
|ISBN:||082186596X 9780821865965 0897914651 9780897914659|
|Notes:||"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."|
|Description:||xii, 179 pages : illustrations ; 27 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, v. 7.|
|Responsibility:||Lyle A. McGeoch, Daniel D. Sleator, editors.|
- Computer algorithms.
- Online data processing.
- mathématique discrète.
- analyse algorithmique.
- structure donnée.
- coloration graphe.
- théorie ordonnancement.
- théorie file attente.
- théorie graphe.
- théorie jeu.
- système conversationnel.
- Algorithmes -- Informatique.
- Computer algorithms
- On-line data processing
- Online data processing