Faster Coupon Collecting via Replication with Applications in Gossiping

DOI10.1007/978-3-642-22993-0_10zbMath1343.60003OpenAlexW169878834WikidataQ59202519 ScholiaQ59202519MaRDI QIDQ3088030

Tom Friedetzky, Thomas Sauerwald, Lars Nagel, Petra Berenbrink, Robert Elsässer

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_10

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Combinatorial probability (60C05) Randomized algorithms (68W20)

Related Items (1)

Two poisson limit theorems for the coupon collector’s problem with group drawings

This page was built for publication: Faster Coupon Collecting via Replication with Applications in Gossiping