Perfect hash function

Results: 41



#Item
1SILT: A Memory-Efficient, High-Performance Key-Value Store

SILT: A Memory-Efficient, High-Performance Key-Value Store

Add to Reading List

Source URL: www.sigops.org

Language: English - Date: 2011-09-20 03:36:42
2Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation Yuriy Arbitman∗ Moni Naor†

Add to Reading List

Source URL: www.wisdom.weizmann.ac.il

Language: English - Date: 2010-04-08 04:06:04
3Microsoft Word - NLA-monographdoc

Microsoft Word - NLA-monographdoc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-06-14 11:43:50
4Optimal Hashing Schemes for Entity Matching Nilesh Dalvi Vibhor Rastogi  Anirban Dasgupta

Optimal Hashing Schemes for Entity Matching Nilesh Dalvi Vibhor Rastogi Anirban Dasgupta

Add to Reading List

Source URL: www2013.wwwconference.org

Language: English - Date: 2014-07-21 08:47:06
5Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen, Denmark

Cache-Oblivious Hashing∗ Rasmus Pagh IT University of Copenhagen Copenhagen, Denmark

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2010-04-07 23:39:13
6Algorithms  Lecture 12: Hash Tables [Fa’13] Insanity is repeating the same mistakes and expecting different results. — Narcotics Anonymous (1981)

Algorithms Lecture 12: Hash Tables [Fa’13] Insanity is repeating the same mistakes and expecting different results. — Narcotics Anonymous (1981)

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:37
7COMPUTNVG PRACTICES Using only a few simple and commonplace instructions, this algorithm efficiently maps variable-length text strings on to small integers.

COMPUTNVG PRACTICES Using only a few simple and commonplace instructions, this algorithm efficiently maps variable-length text strings on to small integers.

Add to Reading List

Source URL: epaperpress.com

Language: English - Date: 2011-12-28 10:41:56
8Previously on COMS31900. . . Advanced Algorithms – COMS31900 Hashing with chaining  Instead of a linked list, throw colliding

Previously on COMS31900. . . Advanced Algorithms – COMS31900 Hashing with chaining Instead of a linked list, throw colliding

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:18
9Dictionaries and Hashing recap  A dynamic dictionary stores (key, value)-pairs and supports: add(key, value), lookup(key) (which returns value) and delete(key) Advanced Algorithms – COMS31900

Dictionaries and Hashing recap  A dynamic dictionary stores (key, value)-pairs and supports: add(key, value), lookup(key) (which returns value) and delete(key) Advanced Algorithms – COMS31900

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-03-11 09:18:18
10Theory and Practice of Monotone Minimal Perfect Hashing DJAMAL BELAZZOUGUI Université Paris Diderot–Paris 7, France PAOLO BOLDI Università degli Studi di Milano, Italy RASMUS PAGH

Theory and Practice of Monotone Minimal Perfect Hashing DJAMAL BELAZZOUGUI Université Paris Diderot–Paris 7, France PAOLO BOLDI Università degli Studi di Milano, Italy RASMUS PAGH

Add to Reading List

Source URL: vigna.di.unimi.it

Language: English - Date: 2011-11-04 10:29:52