85 citations · 897 across the 89 of their papers we have counts for
Showing 2012 · cs.DSShow all
3 papers · 2 filters
cs.DS2012★ 1 cited
Black-Box Complexity: Breaking the Barrier of LeadingOnes
Benjamin Doerr, Carola Winzen
We show that the unrestricted black-box complexity of the -dimensional XOR- and permutation-invariant LeadingOnes function class is . This shows tha…
cs.DS2012★ 7 cited
Simple and Optimal Randomized Fault-Tolerant Rumor Spreading
Benjamin Doerr, Carola Doerr, Shay Moran +1
We revisit the classic problem of spreading a piece of information in a group of fully connected processors. By suitably adding a small dose of randomness to the protocol of Ga…
cs.DS2012★ 13 cited
Playing Mastermind with Many Colors
Benjamin Doerr, Carola Doerr, Reto Spöhel +1
We analyze the general version of the classic guessing game Mastermind with positions and colors. Since the case , a constant, is w…