First Page | Document Content | |
---|---|---|
Date: 2014-12-17 20:04:41Applied mathematics Hashing Randomized algorithm Method of conditional probabilities Universal hashing Chernoff bound Tabulation hashing Random walk Algorithm Search algorithms Mathematics Theoretical computer science | Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04Add to Reading ListSource URL: cs-www.cs.yale.eduDownload Document from Source WebsiteFile Size: 1,75 MBShare Document on Facebook |
Algorithmic Construction of Low-Discrepancy Point Sets via Dependent Randomized Rounding Benjamin Doerra , Michael Gnewuchb , Magnus Wahlstr¨oma a Max-Planck-Institut f¨DocID: 1k85r - View Document | |
Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04DocID: 19BEM - View Document | |
Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04DocID: 19kZK - View Document | |
Learning Influence Probabilities In Social Networks Amit Goyal Francesco Bonchi Laks V. S. LakshmananDocID: 140Rb - View Document | |
Deriving greedy algorithms and Lagrangian-relaxation algorithms Neal E. Young February 16, 2007DocID: 12oUZ - View Document |