Random walks on weighted graphs and applications to on-line algorithms
- 1 July 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (3) , 421-453
- https://doi.org/10.1145/174130.174131
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Competitive paging algorithmsJournal of Algorithms, 1991
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- Memory versus randomization in on-line algorithmsPublished by Springer Nature ,1989
- Editor's foreword special issue on parallel and distributed computing, Part IAlgorithmica, 1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Random Walks and Electric NetworksPublished by American Mathematical Society (AMS) ,1984
- An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecologyBulletin of the American Mathematical Society, 1967
- An Extension of a Network TheoremIRE Transactions on Circuit Theory, 1961
- On the algebra of networksTransactions of the American Mathematical Society, 1953