summaryrefslogtreecommitdiff
path: root/bibtex.bib
diff options
context:
space:
mode:
authorMartin Hafskjold Thoresen <martinhath@gmail.com>2017-07-01 14:41:56 +0200
committerMartin Hafskjold Thoresen <martinhath@gmail.com>2017-07-01 14:41:56 +0200
commit44fcac21fbc62494c0182a4b8b298eb9100eb0ff (patch)
tree72b0b393f0fa00b91fa464e7b95ec33cbd51b543 /bibtex.bib
parentee90ba5f8020ed80dbda0ac573e5562b688300dc (diff)
downloadads-book-44fcac21fbc62494c0182a4b8b298eb9100eb0ff.tar.gz
ads-book-44fcac21fbc62494c0182a4b8b298eb9100eb0ff.zip
Write Hashing chapter
Diffstat (limited to 'bibtex.bib')
-rw-r--r--bibtex.bib17
1 files changed, 17 insertions, 0 deletions
diff --git a/bibtex.bib b/bibtex.bib
new file mode 100644
index 0000000..fa45d92
--- /dev/null
+++ b/bibtex.bib
@@ -0,0 +1,17 @@
+@inproceedings{Patrascu:2011:PST:1993636.1993638,
+ author = {Patrascu, Mihai and Thorup, Mikkel},
+ title = {The Power of Simple Tabulation Hashing},
+ booktitle = {Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing},
+ series = {STOC '11},
+ year = {2011},
+ isbn = {978-1-4503-0691-1},
+ location = {San Jose, California, USA},
+ pages = {1--10},
+ numpages = {10},
+ url = {http://doi.acm.org/10.1145/1993636.1993638},
+ doi = {10.1145/1993636.1993638},
+ acmid = {1993638},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+ keywords = {concentration bounds, cuckoo hashing, independence, linear probing, minwise independence, tabulation hashing},
+}