The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
The Power of Two Random Choices: A Survey of Techniques and Results
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Markov Processes: Characterization and Convergence.
Abakuks, A., Ethier, S. N., & Kurtz, T. G. (1987) · Biometrics · doi:10.2307/2531839 · Cited by 4,233
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
Leighton, F. T. (1991) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,460
Stochastic orders and their applications
Shaked, M., & Shanthikumar, J. G. (1994) · Cited by 2,125
The power of two choices in randomized load balancing
Mitzenmacher, M. (2001) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.963420 · Cited by 1,399
Self-citationScheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (1999) · Journal of the ACM · doi:10.1145/324133.324234 · Cited by 1,336
Lectures on the Coupling Method
Lindvall, T. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,096
Solutions of ordinary differential equations as limits of pure jump markov processes
Kurtz, T. G. (1970) · Journal of Applied Probability · doi:10.1017/s0021900200026929 · Cited by 947
Adaptive load sharing in homogeneous distributed systems
Eager, D. L., Lazowska, E. D., & Zahorjan, J. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312961 · Cited by 926
Cited by
ViNEYard: Virtual Network Embedding Algorithms With Coordinated Node and Link Mapping
Chowdhury, M., Rahman, M. R., & Boutaba, R. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2159308 · Cited by 818
Cuckoo Filter: Practically Better Than Bloom
Fan, B., Andersen, D. G., Kaminsky, M., & Mitzenmacher, M. D. (2014) · Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies · doi:10.1145/2674005.2674994 · Cited by 737
Self-citationSparrow: distributed, low latency scheduling
Ousterhout, K., Wendell, P., Zaharia, M., & Stoica, I. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522716 · Cited by 586
CacheRoute: Planned Prefix-Affinity Routing for Large-Scale LLM Serving
Cheng, H. (2026) · arXiv · doi:10.48550/arxiv.2608.19677
“During the control interval, admitted traffic chooses the least-loaded member of its fixed T ( b ); other traffic uses power-of-two choices across the fleet [Mitzenmacher et al.(2001)].”
Metadata
- Authors
- Mitzenmacher, M., Richa, A. W., & Sitaraman, R.
- Venue
- Combinatorial Optimization
- Publisher
- Springer US
- Published
- 2001
- Pages
- 255-312
- ISSN
- 1388-3011 (ISSN-L)
- OpenAlex
- W1678178911
- Cited by
- 431
- References
- 26
- FWCI
- 37.55
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Power of Two Random Choices: A Survey of Techniques and Results. https://app.cochat.ai/papers/10.1007/978-1-4615-0013-1_9
- The paper
- Mitzenmacher, M., Richa, A. W., & Sitaraman, R. (2001). The Power of Two Random Choices: A Survey of Techniques and Results. Combinatorial Optimization. https://doi.org/10.1007/978-1-4615-0013-1_9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
