Universal hashing (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Universal hashing" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

3arxiv.org

69^th place

59^th place

2books.google.com

3^rd place

1web.archive.org

1^st place

1au.dk

8,222^nd place

8,022^nd place

1mit.edu

415^th place

327^th place

1semanticscholar.org

11^th place

8^th place

1diku.dk

low place

1mybiasedcoin.blogspot.com

low place

1psu.edu

207^th place

136^th place

1ucdavis.edu

1,873^rd place

1,347^th place

1huji.ac.il

3,903^rd place

3,632^nd place

1serve.net

low place

1strchr.com

low place

1yorku.ca

3,576^th place

2,563^rd place

1archive.org

6^th place

1oracle.com

1,514^th place

1,024^th place

archive.org

Kernighan; Ritchie (1988). "6". The C Programming Language (2nd ed.). Prentice Hall. pp. 118. ISBN 0-13-110362-8.{{cite book}}: CS1 maint: multiple names: authors list (link)

arxiv.org

Thorup, Mikkel (2015). "High Speed Hashing for Integers and Strings". arXiv:1504.06804 [cs.DS].
Pătraşcu, Mihai; Thorup, Mikkel (2011). The power of simple tabulation hashing. Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC '11). pp. 1–10. arXiv:1011.5200. doi:10.1145/1993636.1993638. ISBN 9781450306911.
Kaser, Owen; Lemire, Daniel (2013). "Strongly universal string hashing is fast". Computer Journal. 57 (11). Oxford University Press: 1624–1638. arXiv:1202.4961. doi:10.1093/comjnl/bxt070.

au.dk

daimi.au.dk

Miltersen, Peter Bro. "Universal Hashing" (PDF). Archived from the original (PDF) on 24 May 2011. Retrieved 24 June 2009.

books.google.com

David Wagner, ed. "Advances in Cryptology - CRYPTO 2008". p. 145.
Jean-Philippe Aumasson, Willi Meier, Raphael Phan, Luca Henzen. "The Hash Function BLAKE". 2014. p. 10.

diku.dk

Dietzfelbinger, Martin; Hagerup, Torben; Katajainen, Jyrki; Penttonen, Martti (1997). "A Reliable Randomized Algorithm for the Closest-Pair Problem" (Postscript). Journal of Algorithms. 25 (1): 19–51. doi:10.1006/jagm.1997.0873. Retrieved 10 February 2011.

doi.org

Carter, Larry; Wegman, Mark N. (1979). "Universal Classes of Hash Functions". Journal of Computer and System Sciences. 18 (2): 143–154. doi:10.1016/0022-0000(79)90044-8. Conference version in STOC'77.
Baran, Ilya; Demaine, Erik D.; Pătraşcu, Mihai (2008). "Subquadratic Algorithms for 3SUM" (PDF). Algorithmica. 50 (4): 584–596. doi:10.1007/s00453-007-9036-3. S2CID 9855995.
Dietzfelbinger, Martin; Hagerup, Torben; Katajainen, Jyrki; Penttonen, Martti (1997). "A Reliable Randomized Algorithm for the Closest-Pair Problem" (Postscript). Journal of Algorithms. 25 (1): 19–51. doi:10.1006/jagm.1997.0873. Retrieved 10 February 2011.
Woelfel, Philipp (1999). Efficient Strongly Universal and Optimally Universal Hashing. Mathematical Foundations of Computer Science 1999. LNCS. Vol. 1672. pp. 262–272. doi:10.1007/3-540-48340-3_24.
Thorup, Mikkel (2009). String hashing for linear probing. Proc. 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 655–664. CiteSeerX 10.1.1.215.4253. doi:10.1137/1.9781611973068.72. ISBN 978-0-89871-680-1., section 5.3
Pătraşcu, Mihai; Thorup, Mikkel (2011). The power of simple tabulation hashing. Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC '11). pp. 1–10. arXiv:1011.5200. doi:10.1145/1993636.1993638. ISBN 9781450306911.
Kaser, Owen; Lemire, Daniel (2013). "Strongly universal string hashing is fast". Computer Journal. 57 (11). Oxford University Press: 1624–1638. arXiv:1202.4961. doi:10.1093/comjnl/bxt070.

huji.ac.il

cs.huji.ac.il

"Hebrew University Course Slides" (PDF).

mit.edu

people.csail.mit.edu

Baran, Ilya; Demaine, Erik D.; Pătraşcu, Mihai (2008). "Subquadratic Algorithms for 3SUM" (PDF). Algorithmica. 50 (4): 584–596. doi:10.1007/s00453-007-9036-3. S2CID 9855995.

mybiasedcoin.blogspot.com

Thorup, Mikkel (18 December 2009). "Text-book algorithms at SODA".

oracle.com

docs.oracle.com

"String (Java Platform SE 6)". docs.oracle.com. Retrieved 2015-06-10.

psu.edu

citeseerx.ist.psu.edu

Thorup, Mikkel (2009). String hashing for linear probing. Proc. 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 655–664. CiteSeerX 10.1.1.215.4253. doi:10.1137/1.9781611973068.72. ISBN 978-0-89871-680-1., section 5.3

semanticscholar.org

api.semanticscholar.org

Baran, Ilya; Demaine, Erik D.; Pătraşcu, Mihai (2008). "Subquadratic Algorithms for 3SUM" (PDF). Algorithmica. 50 (4): 584–596. doi:10.1007/s00453-007-9036-3. S2CID 9855995.

serve.net

Robert Uzgalis. "Library Hash Functions". 1996.

strchr.com

Kankowsk, Peter. "Hash functions: An empirical comparison".

ucdavis.edu

cs.ucdavis.edu

Black, J.; Halevi, S.; Krawczyk, H.; Krovetz, T. (1999). UMAC: Fast and Secure Message Authentication (PDF). Advances in Cryptology (CRYPTO '99)., Equation 1

web.archive.org

Miltersen, Peter Bro. "Universal Hashing" (PDF). Archived from the original (PDF) on 24 May 2011. Retrieved 24 June 2009.

yorku.ca

cse.yorku.ca

Yigit, Ozan. "String hash functions".