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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16
search results - page 4 / 4
»
Pseudorandom Generators and Typically-Correct Derandomizatio...
Sort
relevance
views
votes
recent
update
View
thumb
title
140
click to vote
ECCC
2011
207
views
ECommerce
»
more
ECCC 2011
»
Balls and Bins: Smaller Hash Families and Faster Evaluation
14 years 11 months ago
Download
research.microsoft.com
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
claim paper
Read More »
« Prev
« First
page 4 / 4
Last »
Next »