Carola Doerr

most citedQuasi-Random Rumor Spreading: Reducing Randomness Can Be Costly

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2013

Improved Approximation Algorithms for the Min-Max Selecting Items Problem

Benjamin Doerr

We give a simple deterministic $O (lo g K / lo g lo g K)$ approximation algorithm for the Min-Max Selecting Items problem, where $K$ is the number of scenarios. While our main goal i…

cs.DS2012★ 1 cited

Black-Box Complexity: Breaking the $O (n lo g n)$ Barrier of LeadingOnes

Benjamin Doerr, Carola Winzen

We show that the unrestricted black-box complexity of the $n$ -dimensional XOR- and permutation-invariant LeadingOnes function class is $O (n lo g (n) / lo g lo g n)$ . This shows tha…

cs.DS2010★ 1 cited

Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly

Benjamin Doerr, Mahmoud Fouz

We give a time-randomness tradeoff for the quasi-random rumor spreading protocol proposed by Doerr, Friedrich and Sauerwald [SODA 2008] on complete graphs. In this protocol, the go…

Improved Approximation Algorithms for the Min-Max Selecting Items Problem

Black-Box Complexity: Breaking the O(nlogn) Barrier of LeadingOnes

Quasi-Random Rumor Spreading: Reducing Randomness Can Be Costly

Black-Box Complexity: Breaking the $O (n lo g n)$ Barrier of LeadingOnes