Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Consistent hashing and random trees
Home
Publications
Consistent hashing and random trees
Consistent hashing and random trees
Authors:
DK
David Karger
David Karger
EL
Eric Lehman
Eric Lehman
TL
Tom Leighton
Tom Leighton
RP
Rina Panigrahy
Rina Panigrahy
ML
Matthew Levine
Matthew Levine
DL
Daniel Lewin
Daniel Lewin
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Open Access
Publisher website
Google Scholar
1 January 1997
conference paper
Published by
Association for Computing Machinery (ACM)
p.
654-663
DOI:
10.1145/258533.258660
Abstract
No abstract available
Keywords
HOT SPOT
RANDOM TREE
WORLD WIDE WEB
LINEAR PROGRAMMING
HASH FUNCTION
RANDOMIZED ROUNDING
RANDOMIZED ALGORITHMS
APPROXIMATION ALGORITHMS
Cited
Cited by 1328 articles
Scroll to top