Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
JCT
2008
favorite
Email
discuss
report
85
views
more
JCT 2008
»
A bound on the size of separating hash families
13 years 11 months ago
Download
www.cacr.math.uwaterloo.ca
Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinso
Real-time Traffic
JCT 2008
|
claim paper
Related Content
»
Bounds for separating hash families
»
Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
»
Balls and Bins Smaller Hash Families and Faster Evaluation
»
The Parazoa Family Generalizing the Sponge Hash Functions
»
The PHOTON Family of Lightweight Hash Functions
»
New Bounds on the OBDDSize of Integer Multiplication via Universal Hashing
»
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
»
Foundations of Security for Hash Chains in Ad Hoc Networks
»
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class The Case of Large Universe...
more »
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2008
Where
JCT
Authors
Simon R. Blackburn, Tuvi Etzion, Douglas R. Stinson, Gregory M. Zaverucha
Comments
(0)
Researcher Info
JCT 2008 Study Group
Computer Vision