Universal hashing

Results: 119



#Item
1Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

Algorithms and Data Structures Winter TermExercises for UnitLet U = {0, 1, . . . , K − 1}, let p ≥ K be a prime number, and let 0 < t < K. For 0 ≤ a, b < p define

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-06 16:06:05
2Why 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
3Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-04-18 04:16:48
4Why 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
5Appears in Advances in Cryptology – Eurocrypt ’02, Lecture Notes in Computer Science, Vol. ????, L. Knudsen, ed., Springer-Verlag. This is the full version. A Block-Cipher Mode of Operation for Parallelizable Message

Appears in Advances in Cryptology – Eurocrypt ’02, Lecture Notes in Computer Science, Vol. ????, L. Knudsen, ed., Springer-Verlag. This is the full version. A Block-Cipher Mode of Operation for Parallelizable Message

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2002-02-15 21:53:00
6CS369N: 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
7Variationally Universal Hashing Ted Krovetz a and Phillip Rogaway b,c a Department of Computer Science, California State University Sacramento CAUSA

Variationally Universal Hashing Ted Krovetz a and Phillip Rogaway b,c a Department of Computer Science, California State University Sacramento CAUSA

Add to Reading List

Source URL: web.cs.ucdavis.edu

Language: English - Date: 2008-07-02 16:14:32
8Microsoft Word - NLA-monographdoc

Microsoft Word - NLA-monographdoc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-06-14 11:43:50
9CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch Tim Roughgarden & Gregory Valiant∗ March 30, 2016

CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch Tim Roughgarden & Gregory Valiant∗ March 30, 2016

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-06-04 09:49:43
10This article is the final version submitted by the authors to the IACR and to Springer-Verlag onThe version published by Springer-Verlag is available at http://dx.doi.orgNew Techn

This article is the final version submitted by the authors to the IACR and to Springer-Verlag onThe version published by Springer-Verlag is available at http://dx.doi.orgNew Techn

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2015-02-21 09:51:42