In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive orâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

Hashing is a basic tool for dimensionality reduction employed in several aspects of machine learning. However, the perfomanceâ€¦Â (More)

Is this relevant?

2016

2016

The power of two choices is a classic paradigm used for assigning m balls to n bins. When placing a ball we pick two binsâ€¦Â (More)

Is this relevant?

2014

2014

- SÃ¸ren Dahlgaard, Mikkel Thorup
- SWAT
- 2014

A random hash function h is Îµ-minwise if for any set S, |S| â€œ n, and element x P S, Prrhpxq â€œ minhpSqs â€œ p1 Ì† Îµq{n. Minwise hashâ€¦Â (More)

Is this relevant?

2013

2013

- Mikkel Thorup
- 2013 IEEE 54th Annual Symposium on Foundations ofâ€¦
- 2013

Simple tabulation dates back to Zobrist in 1970 who used it for game playing programs. Keys are viewed as consisting of câ€¦Â (More)

Is this relevant?

2013

Highly Cited

2011

Highly Cited

2011

- Mihai Patrascu, Mikkel Thorup
- STOC
- 2011

Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoreticalâ€¦Â (More)

Is this relevant?

2005

2005

- Edward Z. Yang, Katherine Fang, Benjamin Y. Lee
- 2005

In the last lecture, we finished up talking about memory hierarchies and linked cache-oblivious data structures with geometricâ€¦Â (More)

Is this relevant?

Review

2000

Review

2000

- J. van Leeuwen, Giancarlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi, Jan van Leeuwen
- Lecture Notes in Computer Science
- 2000

Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilisticâ€¦Â (More)

Is this relevant?