Random walks on weighted graphs, and applications to on-line algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: D. Coppersmith IBM T.J. Watson Research Center, Yorktown Heights, NY
P. Doyle AT&T Bell Laboratories, Murray Hill, NJ
P. Raghavan IBM T.J. Watson Research Center, Yorktown Heights, NY
M. Snir IBM T.J. Watson Research Center, Yorktown Heights, NY
Random walks on weighted graphs, and applications to on-line algorithms Published by ACM 1990 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 19
· Downloads (cumulative): 404
· Citation Count: 19

Published in:
· Proceeding
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Pages 369-378
ACM New York, NY, USA ©1990
table of contents ISBN:0-89791-361-2 doi>10.1145/100216.100266

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder