Record
- Authors
- Karger, D.; Lehman, E.; Leighton, T.; Levine, M.; Lewin, D.; Panigrahy, R.
- Year
- 1997
- Title
- Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
- Published in
- Proceedings of the 29th ACM Symposium on Theory of Computing (STOC 1997)
- Pages
- 654–663
- Type
- Conference paper
- Our note
- none yet
- Verification
- matched-by-title: found by title in an open index (same title, year and first author) (checked against OpenAlex, 2026-11-14).
Identifiers found: OpenAlex W2020765652 · DOI 10.1145/258533.258660 - Id
karger-1997-consistent-hashing-random-trees-distributed-caching
Cited on
- Distributed Crawling and Connectivity Servers read status: not stated
As cited
The pages cite this work in one form.
-
Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., and Panigrahy, R. (1997). Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th ACM Symposium on Theory of Computing (STOC 1997), 654–663.
BibLaTeX
@inproceedings{karger-1997-consistent-hashing-random-trees-distributed-caching,
author = {Karger, D. and Lehman, E. and Leighton, T. and Levine, M. and Lewin, D. and Panigrahy, R.},
title = {{Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web}},
booktitle = {Proceedings of the 29th ACM Symposium on Theory of Computing (STOC 1997)},
date = {1997},
pages = {654--663}
}