Hash table (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hash table" in English language version.

Last modified: 19:16:56, 18 July 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

4622doi.org

2^nd place

3020web.archive.org

1^st place

93cornell.edu

308^th place

253^rd place

71acm.org

1,200^th place

821^st place

65semanticscholar.org

15^th place

8^th place

51princeton.edu

802^nd place

528^th place

43psu.edu

299^th place

159^th place

42archive.org

6^th place

33adsabs.harvard.edu

14^th place

9^th place

22ams.org

434^th place

249^th place

22mit.edu

476^th place

340^th place

22mozilla.org

2,188^th place

2,076^th place

22microsoft.com

263^rd place

259^th place

21utk.edu

5,670^th place

3,534^th place

21concentric.net

low place

21uwaterloo.ca

3,649^th place

2,434^th place

21worldcat.org

4^th place

21northwestern.edu

2,347^th place

1,308^th place

21tvandijk.nl

low place

11arxiv.org

49^th place

31^st place

11mpg.de

1,722^nd place

1,710^th place

11videolectures.net

low place

11sourceforge.net

1,842^nd place

1,520^th place

11zenodo.org

737^th place

426^th place

11jstor.org

23^rd place

15^th place

11crpit.com

low place

11indiana.edu

2,374^th place

1,453^rd place

11clemson.edu

6,422^nd place

3,771^st place

11cmu.edu

2,125^th place

1,347^th place

11ghostarchive.org

64^th place

28^th place

11pjwstk.edu.pl

low place

11linuxjournal.com

8,963^rd place

6,985^th place

11chessprogramming.org

low place

11open-std.org

7,079^th place

5,042^nd place

11go.dev

low place

11oracle.com

2,532^nd place

1,847^th place

11heroku.com

low place

11rust-lang.org

low place

11dotnetperls.com

low place

acm.org (Global: 1,200^th place; English: 821^st place)

dl.acm.org

Knuth, Donald E. (April 24, 1998). The Art of Computer Programming: Volume 3: Sorting and Searching (2nd ed.). Addison-Wesley Professional. ISBN 978-0-201-89685-5.

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Wegman, Mark N.; Carter, J.Lawrence (June 1981). "New hash functions and their use in authentication and set equality". Journal of Computer and System Sciences. 22 (3): 265–279. Bibcode:1981JCoSS..22..265W. doi:10.1016/0022-0000(81)90033-7.
Zhong, Liang; Zheng, Xueqian; Liu, Yong; Wang, Mengting; Cao, Yang (February 2020). "Cache hit ratio maximization in device-to-device communications overlaying cellular networks". China Communications. 17 (2): 232–238. Bibcode:2020CComm..17b.232Z. doi:10.23919/jcc.2020.02.018. S2CID 212649328.
Zhang, Juan; Jia, Yunwei (2020). "Redis rehash optimization based on machine learning". Journal of Physics: Conference Series. 1453 (1): 3. Bibcode:2020JPhCS1453a2048Z. doi:10.1088/1742-6596/1453/1/012048. S2CID 215943738.

ams.org (Global: 434^th place; English: 249^th place)

mathscinet.ams.org

Belazzougui, Djamal; Botelho, Fabiano C.; Dietzfelbinger, Martin (2009). "Hash, displace, and compress" (PDF). Algorithms—ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark, September 7–9, 2009, Proceedings. Lecture Notes in Computer Science. Vol. 5757. Berlin: Springer. pp. 682–693. CiteSeerX 10.1.1.568.130. doi:10.1007/978-3-642-04128-0_61. MR 2557794. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Willard, Dan E. (2000). "Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree". SIAM Journal on Computing. 29 (3): 1030–1049. doi:10.1137/S0097539797322425. MR 1740562..

archive.org (Global: 6^th place; English: 6^th place)

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). "Chapter 11: Hash Tables". Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. pp. 221–252. ISBN 978-0-262-53196-2.
Vitter, Jeffery S.; Chen, Wen-Chin (1987). The design and analysis of coalesced hashing. New York, United States: Oxford University Press. ISBN 978-0-19-504182-8 – via Archive.org.

arxiv.org (Global: 49^th place; English: 31^st place)

Martin Farach-Colton; Andrew Krapivin; William Kuszmaul. Optimal Bounds for Open Addressing Without Reordering. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2501.02305. doi:10.1109/FOCS61266.2024.00045.

chessprogramming.org (Global: low place; English: low place)

"Transposition Table - Chessprogramming wiki". chessprogramming.org. Archived from the original on February 14, 2021. Retrieved May 1, 2020.

clemson.edu (Global: 6,422^nd place; English: 3,771^st place)

people.computing.clemson.edu

Goddard, Wayne (2021). "Chapter C5: Hash Tables" (PDF). Clemson University. pp. 15–16. Retrieved December 4, 2023.

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cs.cmu.edu

Litwin, Witold (1980). "Linear hashing: A new tool for file and table addressing" (PDF). Proc. 6th Conference on Very Large Databases. Carnegie Mellon University. pp. 212–223. Archived (PDF) from the original on May 6, 2021. Retrieved November 10, 2021 – via cs.cmu.edu.

concentric.net (Global: low place; English: low place)

Wang, Thomas (March 1997). "Prime Double Hash Table". Archived from the original on September 3, 1999. Retrieved May 10, 2015.

cornell.edu (Global: 308^th place; English: 253^rd place)

cs.cornell.edu

Mayers, Andrew (2008). "CS 312: Hash tables and amortized analysis". Cornell University, Department of Computer Science. Archived from the original on April 26, 2021. Retrieved October 26, 2021 – via cs.cornell.edu.
Clarkson, Michael (2014). "Lecture 13: Hash tables". Cornell University, Department of Computer Science. Archived from the original on October 7, 2021. Retrieved November 1, 2021 – via cs.cornell.edu.
Gries, David (2017). "JavaHyperText and Data Structure: Robin Hood Hashing" (PDF). Cornell University, Department of Computer Science. Archived (PDF) from the original on April 26, 2021. Retrieved November 2, 2021 – via cs.cornell.edu.

crpit.com (Global: low place; English: low place)

Askitis, Nikolas (2009). "Fast and Compact Hash Tables for Integer Keys" (PDF). Proceedings of the 32nd Australasian Computer Science Conference (ACSC 2009). Vol. 91. pp. 113–122. ISBN 978-1-920682-72-9. Archived from the original (PDF) on February 16, 2011. Retrieved June 13, 2010.

doi.org (Global: 2^nd place; English: 2^nd place)

Martin Farach-Colton; Andrew Krapivin; William Kuszmaul. Optimal Bounds for Open Addressing Without Reordering. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). arXiv:2501.02305. doi:10.1109/FOCS61266.2024.00045.
Mehlhorn, Kurt; Sanders, Peter (2008). "Hash Tables and Associative Arrays" (PDF). Algorithms and Data Structures. Springer. pp. 81–98. doi:10.1007/978-3-540-77978-0_4. ISBN 978-3-540-77977-3.
Konheim, Alan G. (2010). Hashing in Computer Science. doi:10.1002/9780470630617. ISBN 978-0-470-34473-6.
Mehta, Dinesh P.; Mehta, Dinesh P.; Sahni, Sartaj, eds. (2004). Handbook of Data Structures and Applications. doi:10.1201/9781420035179. ISBN 978-0-429-14701-2.
Maurer, W. D.; Lewis, T. G. (March 1975). "Hash Table Methods". ACM Computing Surveys. 7 (1): 5–19. doi:10.1145/356643.356645. S2CID 17874775.
Owolabi, Olumide (February 2003). "Empirical studies of some hashing functions". Information and Software Technology. 45 (2): 109–112. doi:10.1016/S0950-5849(02)00174-X.
Lu, Yi; Prabhakar, Balaji; Bonomi, Flavio (2006). Perfect Hashing for Network Applications. 2006 IEEE International Symposium on Information Theory. pp. 2774–2778. doi:10.1109/ISIT.2006.261567. ISBN 1-4244-0505-X. S2CID 1494710.
Belazzougui, Djamal; Botelho, Fabiano C.; Dietzfelbinger, Martin (2009). "Hash, displace, and compress" (PDF). Algorithms—ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark, September 7–9, 2009, Proceedings. Lecture Notes in Computer Science. Vol. 5757. Berlin: Springer. pp. 682–693. CiteSeerX 10.1.1.568.130. doi:10.1007/978-3-642-04128-0_61. MR 2557794. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Pearson, Karl (1900). "On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling". Philosophical Magazine. Series 5. 50 (302): 157–175. doi:10.1080/14786440009463897.
Plackett, Robin (1983). "Karl Pearson and the Chi-Squared Test". International Statistical Review. 51 (1): 59–72. doi:10.2307/1402731. JSTOR 1402731.
Wegman, Mark N.; Carter, J.Lawrence (June 1981). "New hash functions and their use in authentication and set equality". Journal of Computer and System Sciences. 22 (3): 265–279. Bibcode:1981JCoSS..22..265W. doi:10.1016/0022-0000(81)90033-7.
Culpepper, J. Shane; Moffat, Alistair (2005). "Enhanced Byte Codes with Restricted Prefix Properties". String Processing and Information Retrieval. Lecture Notes in Computer Science. Vol. 3772. pp. 1–12. doi:10.1007/11575832_1. ISBN 978-3-540-29740-6.
Willard, Dan E. (2000). "Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree". SIAM Journal on Computing. 29 (3): 1030–1049. doi:10.1137/S0097539797322425. MR 1740562..
Askitis, Nikolas; Sinha, Ranjan (October 2010). "Engineering scalable, cache and space efficient tries for strings". The VLDB Journal. 19 (5): 633–660. doi:10.1007/s00778-010-0183-9.
Askitis, Nikolas; Zobel, Justin (October 2005). "Cache-conscious Collision Resolution in String Hash Tables". Proceedings of the 12th International Conference, String Processing and Information Retrieval (SPIRE 2005). Vol. 3772/2005. pp. 91–102. doi:10.1007/11575832_11. ISBN 978-3-540-29740-6.
Pagh, Rasmus; Rodler, Flemming Friche (2001). "Cuckoo Hashing". Algorithms — ESA 2001. Lecture Notes in Computer Science. Vol. 2161. pp. 121–133. CiteSeerX 10.1.1.25.4189. doi:10.1007/3-540-44676-1_10. ISBN 978-3-540-42493-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Pagh, Rasmus; Rodler, Flemming Friche (2001). "Cuckoo Hashing". Algorithms — ESA 2001. Lecture Notes in Computer Science. Vol. 2161. pp. 121–133. CiteSeerX 10.1.1.25.4189. doi:10.1007/3-540-44676-1_10. ISBN 978-3-540-42493-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Herlihy, Maurice; Shavit, Nir; Tzafrir, Moran (2008). "Hopscotch Hashing". Distributed Computing. Lecture Notes in Computer Science. Vol. 5218. pp. 350–364. doi:10.1007/978-3-540-87779-0_24. ISBN 978-3-540-87778-3.
Poblete, P. V.; Viola, A. (July 2019). "Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions". Combinatorics, Probability and Computing. 28 (4): 600–617. doi:10.1017/S0963548318000408. S2CID 125374363.
Friedman, Scott; Krishnan, Anand; Leidefrost, Nicholas (March 18, 2003). "Hash Tables for Embedded and Real-time systems" (PDF). All Computer Science and Engineering Research. Washington University in St. Louis. doi:10.7936/K7WD3XXV. Archived (PDF) from the original on June 9, 2021. Retrieved November 9, 2021 – via Northwestern University, Department of Computer Science.
Zhong, Liang; Zheng, Xueqian; Liu, Yong; Wang, Mengting; Cao, Yang (February 2020). "Cache hit ratio maximization in device-to-device communications overlaying cellular networks". China Communications. 17 (2): 232–238. Bibcode:2020CComm..17b.232Z. doi:10.23919/jcc.2020.02.018. S2CID 212649328.
Zhang, Juan; Jia, Yunwei (2020). "Redis rehash optimization based on machine learning". Journal of Physics: Conference Series. 1453 (1): 3. Bibcode:2020JPhCS1453a2048Z. doi:10.1088/1742-6596/1453/1/012048. S2CID 215943738.

dotnetperls.com (Global: low place; English: low place)

"VB.NET HashSet Example". Dot Net Perls.

ghostarchive.org (Global: 64^th place; English: 28^th place)

Lech Banachowski. "Indexes and external sorting". pl:Polsko-Japońska Akademia Technik Komputerowych. Archived from the original on March 26, 2022. Retrieved March 26, 2022.

go.dev (Global: low place; English: low place)

"The Go Programming Language Specification". go.dev. Retrieved January 1, 2023.

heroku.com (Global: low place; English: low place)

blog.heroku.com

Jonan Scheffler (December 25, 2016). "Ruby 2.4 Released: Faster Hashes, Unified Integers and Better Rounding". heroku.com. Archived from the original on July 3, 2019. Retrieved July 3, 2019.

indiana.edu (Global: 2,374^th place; English: 1,453^rd place)

legacy.cs.indiana.edu

Celis, Pedro (March 28, 1988). External Robin Hood Hashing (PDF) (Technical report). Bloomington, Indiana: Indiana University, Department of Computer Science. 246. Archived (PDF) from the original on November 3, 2021. Retrieved November 2, 2021.

jstor.org (Global: 23^rd place; English: 15^th place)

Plackett, Robin (1983). "Karl Pearson and the Chi-Squared Test". International Statistical Review. 51 (1): 59–72. doi:10.2307/1402731. JSTOR 1402731.

linuxjournal.com (Global: 8,963^rd place; English: 6,985^th place)

Bottommley, James (January 1, 2004). "Understanding Caching". Linux Journal. Archived from the original on December 4, 2020. Retrieved April 16, 2022.

microsoft.com (Global: 263^rd place; English: 259^th place)

learn.microsoft.com

"HashSet Class (System.Collections.Generic)". learn.microsoft.com. Retrieved July 1, 2023.
dotnet-bot. "Dictionary Class (System.Collections.Generic)". learn.microsoft.com. Retrieved January 16, 2024.

mit.edu (Global: 476^th place; English: 340^th place)

courses.csail.mit.edu

Demaine, Erik; Lind, Jeff (Spring 2003). "Lecture 2" (PDF). 6.897: Advanced Data Structures. MIT Computer Science and Artificial Intelligence Laboratory. Archived (PDF) from the original on June 15, 2010. Retrieved June 30, 2008.
Devadas, Srini; Demaine, Erik (February 25, 2011). "Intro to Algorithms: Resizing Hash Tables" (PDF). Massachusetts Institute of Technology, Department of Computer Science. Archived (PDF) from the original on May 7, 2021. Retrieved November 9, 2021 – via MIT OpenCourseWare.

mozilla.org (Global: 2,188^th place; English: 2,076^th place)

developer.mozilla.org

"JavaScript data types and data structures - JavaScript | MDN". developer.mozilla.org. Retrieved July 24, 2022.
"Map - JavaScript | MDN". developer.mozilla.org. June 20, 2023. Retrieved July 15, 2023.

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

people.mpi-inf.mpg.de

Mehlhorn, Kurt; Sanders, Peter (2008). "Hash Tables and Associative Arrays" (PDF). Algorithms and Data Structures. Springer. pp. 81–98. doi:10.1007/978-3-540-77978-0_4. ISBN 978-3-540-77977-3.

northwestern.edu (Global: 2,347^th place; English: 1,308^th place)

users.cs.northwestern.edu

Friedman, Scott; Krishnan, Anand; Leidefrost, Nicholas (March 18, 2003). "Hash Tables for Embedded and Real-time systems" (PDF). All Computer Science and Engineering Research. Washington University in St. Louis. doi:10.7936/K7WD3XXV. Archived (PDF) from the original on June 9, 2021. Retrieved November 9, 2021 – via Northwestern University, Department of Computer Science.

open-std.org (Global: 7,079^th place; English: 5,042^nd place)

"Programming language C++ - Technical Specification" (PDF). International Organization for Standardization. pp. 812–813. Archived from the original (PDF) on January 21, 2022. Retrieved February 8, 2022.

oracle.com (Global: 2,532^nd place; English: 1,847^th place)

docs.oracle.com

"Lesson: Implementations (The Java™ Tutorials > Collections)". docs.oracle.com. Archived from the original on January 18, 2017. Retrieved April 27, 2018.

pjwstk.edu.pl (Global: low place; English: low place)

edux.pjwstk.edu.pl

Lech Banachowski. "Indexes and external sorting". pl:Polsko-Japońska Akademia Technik Komputerowych. Archived from the original on March 26, 2022. Retrieved March 26, 2022.

princeton.edu (Global: 802^nd place; English: 528^th place)

algs4.cs.princeton.edu

Sedgewick, Robert; Wayne, Kevin (2011). Algorithms. Vol. 1 (4 ed.). Addison-Wesley Professional – via Princeton University, Department of Computer Science.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Belazzougui, Djamal; Botelho, Fabiano C.; Dietzfelbinger, Martin (2009). "Hash, displace, and compress" (PDF). Algorithms—ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark, September 7–9, 2009, Proceedings. Lecture Notes in Computer Science. Vol. 5757. Berlin: Springer. pp. 682–693. CiteSeerX 10.1.1.568.130. doi:10.1007/978-3-642-04128-0_61. MR 2557794. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Pagh, Rasmus; Rodler, Flemming Friche (2001). "Cuckoo Hashing". Algorithms — ESA 2001. Lecture Notes in Computer Science. Vol. 2161. pp. 121–133. CiteSeerX 10.1.1.25.4189. doi:10.1007/3-540-44676-1_10. ISBN 978-3-540-42493-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Pagh, Rasmus; Rodler, Flemming Friche (2001). "Cuckoo Hashing". Algorithms — ESA 2001. Lecture Notes in Computer Science. Vol. 2161. pp. 121–133. CiteSeerX 10.1.1.25.4189. doi:10.1007/3-540-44676-1_10. ISBN 978-3-540-42493-2. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

rust-lang.org (Global: low place; English: low place)

doc.rust-lang.org

"doc.rust-lang.org". Archived from the original on December 8, 2022. Retrieved December 14, 2022.

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Maurer, W. D.; Lewis, T. G. (March 1975). "Hash Table Methods". ACM Computing Surveys. 7 (1): 5–19. doi:10.1145/356643.356645. S2CID 17874775.
Lu, Yi; Prabhakar, Balaji; Bonomi, Flavio (2006). Perfect Hashing for Network Applications. 2006 IEEE International Symposium on Information Theory. pp. 2774–2778. doi:10.1109/ISIT.2006.261567. ISBN 1-4244-0505-X. S2CID 1494710.
Poblete, P. V.; Viola, A. (July 2019). "Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions". Combinatorics, Probability and Computing. 28 (4): 600–617. doi:10.1017/S0963548318000408. S2CID 125374363.
Zhong, Liang; Zheng, Xueqian; Liu, Yong; Wang, Mengting; Cao, Yang (February 2020). "Cache hit ratio maximization in device-to-device communications overlaying cellular networks". China Communications. 17 (2): 232–238. Bibcode:2020CComm..17b.232Z. doi:10.23919/jcc.2020.02.018. S2CID 212649328.
Zhang, Juan; Jia, Yunwei (2020). "Redis rehash optimization based on machine learning". Journal of Physics: Conference Series. 1453 (1): 3. Bibcode:2020JPhCS1453a2048Z. doi:10.1088/1742-6596/1453/1/012048. S2CID 215943738.

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

cmph.sourceforge.net

Belazzougui, Djamal; Botelho, Fabiano C.; Dietzfelbinger, Martin (2009). "Hash, displace, and compress" (PDF). Algorithms—ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark, September 7–9, 2009, Proceedings. Lecture Notes in Computer Science. Vol. 5757. Berlin: Springer. pp. 682–693. CiteSeerX 10.1.1.568.130. doi:10.1007/978-3-642-04128-0_61. MR 2557794. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)

tvandijk.nl (Global: low place; English: low place)

Dijk, Tom Van (2010). "Analysing and Improving Hash Table Performance" (PDF). Netherlands: University of Twente. Archived (PDF) from the original on November 6, 2021. Retrieved December 31, 2021.

utk.edu (Global: 5,670^th place; English: 3,534^th place)

web.eecs.utk.edu

James S. Plank and Brad Vander Zanden. "CS140 Lecture notes -- Hashing".

uwaterloo.ca (Global: 3,649^th place; English: 2,434^th place)

cs.uwaterloo.ca

Celis, Pedro (1986). Robin Hood Hashing (PDF). Ontario, Canada: University of Waterloo, Dept. of Computer Science. ISBN 978-0-315-29700-5. OCLC 14083698. Archived (PDF) from the original on November 1, 2021. Retrieved November 2, 2021.

videolectures.net (Global: low place; English: low place)

Leiserson, Charles E. (Fall 2005). "Lecture 13: Amortized Algorithms, Table Doubling, Potential Method". course MIT 6.046J/18.410J Introduction to Algorithms. Archived from the original on August 7, 2009.

web.archive.org (Global: 1^st place; English: 1^st place)

Leiserson, Charles E. (Fall 2005). "Lecture 13: Amortized Algorithms, Table Doubling, Potential Method". course MIT 6.046J/18.410J Introduction to Algorithms. Archived from the original on August 7, 2009.
Mayers, Andrew (2008). "CS 312: Hash tables and amortized analysis". Cornell University, Department of Computer Science. Archived from the original on April 26, 2021. Retrieved October 26, 2021 – via cs.cornell.edu.
Wang, Thomas (March 1997). "Prime Double Hash Table". Archived from the original on September 3, 1999. Retrieved May 10, 2015.
Demaine, Erik; Lind, Jeff (Spring 2003). "Lecture 2" (PDF). 6.897: Advanced Data Structures. MIT Computer Science and Artificial Intelligence Laboratory. Archived (PDF) from the original on June 15, 2010. Retrieved June 30, 2008.
Askitis, Nikolas (2009). "Fast and Compact Hash Tables for Integer Keys" (PDF). Proceedings of the 32nd Australasian Computer Science Conference (ACSC 2009). Vol. 91. pp. 113–122. ISBN 978-1-920682-72-9. Archived from the original (PDF) on February 16, 2011. Retrieved June 13, 2010.
Celis, Pedro (1986). Robin Hood Hashing (PDF). Ontario, Canada: University of Waterloo, Dept. of Computer Science. ISBN 978-0-315-29700-5. OCLC 14083698. Archived (PDF) from the original on November 1, 2021. Retrieved November 2, 2021.
Clarkson, Michael (2014). "Lecture 13: Hash tables". Cornell University, Department of Computer Science. Archived from the original on October 7, 2021. Retrieved November 1, 2021 – via cs.cornell.edu.
Gries, David (2017). "JavaHyperText and Data Structure: Robin Hood Hashing" (PDF). Cornell University, Department of Computer Science. Archived (PDF) from the original on April 26, 2021. Retrieved November 2, 2021 – via cs.cornell.edu.
Celis, Pedro (March 28, 1988). External Robin Hood Hashing (PDF) (Technical report). Bloomington, Indiana: Indiana University, Department of Computer Science. 246. Archived (PDF) from the original on November 3, 2021. Retrieved November 2, 2021.
Devadas, Srini; Demaine, Erik (February 25, 2011). "Intro to Algorithms: Resizing Hash Tables" (PDF). Massachusetts Institute of Technology, Department of Computer Science. Archived (PDF) from the original on May 7, 2021. Retrieved November 9, 2021 – via MIT OpenCourseWare.
Friedman, Scott; Krishnan, Anand; Leidefrost, Nicholas (March 18, 2003). "Hash Tables for Embedded and Real-time systems" (PDF). All Computer Science and Engineering Research. Washington University in St. Louis. doi:10.7936/K7WD3XXV. Archived (PDF) from the original on June 9, 2021. Retrieved November 9, 2021 – via Northwestern University, Department of Computer Science.
Litwin, Witold (1980). "Linear hashing: A new tool for file and table addressing" (PDF). Proc. 6th Conference on Very Large Databases. Carnegie Mellon University. pp. 212–223. Archived (PDF) from the original on May 6, 2021. Retrieved November 10, 2021 – via cs.cmu.edu.
Dijk, Tom Van (2010). "Analysing and Improving Hash Table Performance" (PDF). Netherlands: University of Twente. Archived (PDF) from the original on November 6, 2021. Retrieved December 31, 2021.
Bottommley, James (January 1, 2004). "Understanding Caching". Linux Journal. Archived from the original on December 4, 2020. Retrieved April 16, 2022.
Jill Seaman (2014). "Set & Hash Tables" (PDF). Texas State University. Archived from the original on April 1, 2022. Retrieved March 26, 2022.{{cite web}}: CS1 maint: bot: original URL status unknown (link)
"Transposition Table - Chessprogramming wiki". chessprogramming.org. Archived from the original on February 14, 2021. Retrieved May 1, 2020.
"Programming language C++ - Technical Specification" (PDF). International Organization for Standardization. pp. 812–813. Archived from the original (PDF) on January 21, 2022. Retrieved February 8, 2022.
"Lesson: Implementations (The Java™ Tutorials > Collections)". docs.oracle.com. Archived from the original on January 18, 2017. Retrieved April 27, 2018.
Jonan Scheffler (December 25, 2016). "Ruby 2.4 Released: Faster Hashes, Unified Integers and Better Rounding". heroku.com. Archived from the original on July 3, 2019. Retrieved July 3, 2019.
"doc.rust-lang.org". Archived from the original on December 8, 2022. Retrieved December 14, 2022.

worldcat.org (Global: 4^th place; English: 4^th place)

search.worldcat.org

Celis, Pedro (1986). Robin Hood Hashing (PDF). Ontario, Canada: University of Waterloo, Dept. of Computer Science. ISBN 978-0-315-29700-5. OCLC 14083698. Archived (PDF) from the original on November 1, 2021. Retrieved November 2, 2021.

zenodo.org (Global: 737^th place; English: 426^th place)

Pearson, Karl (1900). "On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling". Philosophical Magazine. Series 5. 50 (302): 157–175. doi:10.1080/14786440009463897.

Hash table (English Wikipedia)

acm.org (Global: 1,200th place; English: 821st place)

dl.acm.org

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

ams.org (Global: 434th place; English: 249th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 49th place; English: 31st place)

chessprogramming.org (Global: low place; English: low place)

clemson.edu (Global: 6,422nd place; English: 3,771st place)

people.computing.clemson.edu

cmu.edu (Global: 2,125th place; English: 1,347th place)

cs.cmu.edu

concentric.net (Global: low place; English: low place)

cornell.edu (Global: 308th place; English: 253rd place)

cs.cornell.edu

crpit.com (Global: low place; English: low place)

doi.org (Global: 2nd place; English: 2nd place)

dotnetperls.com (Global: low place; English: low place)

ghostarchive.org (Global: 64th place; English: 28th place)

go.dev (Global: low place; English: low place)

heroku.com (Global: low place; English: low place)

blog.heroku.com

indiana.edu (Global: 2,374th place; English: 1,453rd place)

legacy.cs.indiana.edu

jstor.org (Global: 23rd place; English: 15th place)

linuxjournal.com (Global: 8,963rd place; English: 6,985th place)

microsoft.com (Global: 263rd place; English: 259th place)

learn.microsoft.com

mit.edu (Global: 476th place; English: 340th place)

courses.csail.mit.edu

mozilla.org (Global: 2,188th place; English: 2,076th place)

developer.mozilla.org

mpg.de (Global: 1,722nd place; English: 1,710th place)

people.mpi-inf.mpg.de

northwestern.edu (Global: 2,347th place; English: 1,308th place)

users.cs.northwestern.edu

open-std.org (Global: 7,079th place; English: 5,042nd place)

oracle.com (Global: 2,532nd place; English: 1,847th place)

docs.oracle.com

pjwstk.edu.pl (Global: low place; English: low place)

edux.pjwstk.edu.pl

princeton.edu (Global: 802nd place; English: 528th place)

algs4.cs.princeton.edu

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

rust-lang.org (Global: low place; English: low place)

doc.rust-lang.org

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

sourceforge.net (Global: 1,842nd place; English: 1,520th place)

cmph.sourceforge.net

tvandijk.nl (Global: low place; English: low place)

utk.edu (Global: 5,670th place; English: 3,534th place)

web.eecs.utk.edu

uwaterloo.ca (Global: 3,649th place; English: 2,434th place)

cs.uwaterloo.ca

videolectures.net (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 4th place; English: 4th place)

search.worldcat.org

zenodo.org (Global: 737th place; English: 426th place)

acm.org (Global: 1,200^th place; English: 821^st place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ams.org (Global: 434^th place; English: 249^th place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

clemson.edu (Global: 6,422^nd place; English: 3,771^st place)

cmu.edu (Global: 2,125^th place; English: 1,347^th place)

cornell.edu (Global: 308^th place; English: 253^rd place)

doi.org (Global: 2^nd place; English: 2^nd place)

ghostarchive.org (Global: 64^th place; English: 28^th place)

indiana.edu (Global: 2,374^th place; English: 1,453^rd place)

jstor.org (Global: 23^rd place; English: 15^th place)

linuxjournal.com (Global: 8,963^rd place; English: 6,985^th place)

microsoft.com (Global: 263^rd place; English: 259^th place)

mit.edu (Global: 476^th place; English: 340^th place)

mozilla.org (Global: 2,188^th place; English: 2,076^th place)

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

northwestern.edu (Global: 2,347^th place; English: 1,308^th place)

open-std.org (Global: 7,079^th place; English: 5,042^nd place)

oracle.com (Global: 2,532^nd place; English: 1,847^th place)

princeton.edu (Global: 802^nd place; English: 528^th place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

sourceforge.net (Global: 1,842^nd place; English: 1,520^th place)

utk.edu (Global: 5,670^th place; English: 3,534^th place)

uwaterloo.ca (Global: 3,649^th place; English: 2,434^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 4^th place; English: 4^th place)

zenodo.org (Global: 737^th place; English: 426^th place)