Linear hashing

Results: 71



#Item
1Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream∗ Michael Mitzenmacher† Salil Vadhan‡ School of Engineering & Applied Sciences Harvard University

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2007-11-16 13:42:30
2Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2014-11-14 13:01:16
3Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 15, 2011 Problem Set 2 Solutions

Introduction to Algorithms: 6.006 Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis February 15, 2011 Problem Set 2 Solutions

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-03-08 02:53:29
4Backyard 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
5Cuckoo Filter: Practically Better Than Bloom Bin Fan, David G. Andersen, Michael Kaminsky† , Michael D. Mitzenmacher‡ Carnegie Mellon University, † Intel Labs, ‡ Harvard University {binfan,dga}@cs.cmu.edu, michae

Cuckoo Filter: Practically Better Than Bloom Bin Fan, David G. Andersen, Michael Kaminsky† , Michael D. Mitzenmacher‡ Carnegie Mellon University, † Intel Labs, ‡ Harvard University {binfan,dga}@cs.cmu.edu, michae

Add to Reading List

Source URL: conferences2.sigcomm.org

Language: English - Date: 2014-12-01 16:58:59
6Hybrid Use of Hashing Techniques for Spatial Data Wayne A. Davis Department of Computing Science The University of Alberta Edmonton, Alberta, Canada T6G 2H1

Hybrid Use of Hashing Techniques for Spatial Data Wayne A. Davis Department of Computing Science The University of Alberta Edmonton, Alberta, Canada T6G 2H1

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-30 01:13:26
7CS369N: Beyond Worst-Case Analysis Lecture #6: Pseudorandom Data and Universal Hashing∗ Tim Roughgarden† April 14,

CS369N: Beyond Worst-Case Analysis Lecture #6: Pseudorandom Data and Universal Hashing∗ Tim Roughgarden† April 14,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-14 21:12:34
8CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S

CS168: The Modern Algorithmic Toolbox Lecture #19: Expander Codes Tim Roughgarden & Gregory Valiant∗ June 1, 2016 In the first lecture of CS168, we talked about modern techniques in data storage (consistent hashing). S

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-06-04 09:49:43
9HIERARCHICAL GRID STRUCTURES FOR STATIC GEOGRAPHIC DATA BASES Andreas Kleiner and Kurt E. Brassel Department of Geography University of Zurich Winterthurerstr. 190

HIERARCHICAL GRID STRUCTURES FOR STATIC GEOGRAPHIC DATA BASES Andreas Kleiner and Kurt E. Brassel Department of Geography University of Zurich Winterthurerstr. 190

Add to Reading List

Source URL: mapcontext.com

Language: English - Date: 2008-08-30 01:13:21
10Microsoft PowerPoint - lecture7_HashingIII.pptx

Microsoft PowerPoint - lecture7_HashingIII.pptx

Add to Reading List

Source URL: courses.csail.mit.edu

Language: English - Date: 2011-03-31 12:24:54