First Page | Document Content | |
---|---|---|
Date: 2017-09-14 15:31:47Computational complexity theory Randomized algorithms Analysis of algorithms With high probability PP IP RP P Freivalds' algorithm | COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin ThalerAdd to Reading ListSource URL: people.cs.georgetown.eduDownload Document from Source WebsiteFile Size: 146,75 KBShare Document on Facebook |
Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph LenzenDocID: 1qUdZ - View Document | |
Rumor Spreading with Bounded In-Degree∗ Sebastian Daum, Fabian Kuhn, and Yannic Maus Deptartment of Computer Science, University of FreiburgFreiburg, Germany , {kuhn, yannic.maus}@cs.uni-DocID: 1qTXs - View Document | |
arXiv:1402.2701v1 [cs.DS] 12 Feb 2014DocID: 1qcDs - View Document | |
Brief Announcement: TheToolkit for Building Your Own Balls-into-Bins Algorithm Pierre Bertrand1 and Christoph Lenzen2 1 Ecole Normale Suprieure CachanDocID: 1q0nQ - View Document | |
Tight Bounds for Parallel Randomized Load Balancing Christoph Lenzen, Roger Wattenhofer {lenzen,wattenhofer}@tik.ee.ethz.ch arXiv:1102.5425v1 [cs.CC] 26 Feb 2011DocID: 1p7SC - View Document |