SIGN IN
SIGN UP
Random walks on weighted graphs and applications to on-line algorithms
Full Text:
PDF
Buy this Article
Authors:
Don Coppersmith
IBM T. J. Watson Research Center, Yorktown Heights, New York
Peter Doyle
AT&T Bell Laboratories, Marray Hill, New Jersey
Prabhakar Raghavan
IBM T. J. Watson Research Center, Yorktown Heights, New York
Marc Snir
IBM T. J. Watson Research Center, Yorktown Heights, New York
1993 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 18
· Downloads (cumulative): 959
· Citation Count: 17
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 40 Issue 3, July 1993
Pages 421-453
ACM
New York, NY
, USA
table of contents
doi>
10.1145/174130.174131
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
graph algorithms
metrical tasks
probabilistic algorithms
server problem
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder