727 citations
- University of California, Santa BarbaraUS18 papers
- University of California, BerkeleyUS10 papers
- California Institute of TechnologyUS6 papers
- ETH ZurichCH5 papers
- University of Maryland, College ParkUS5 papers
- Board of the Swiss Federal Institutes of TechnologyCH4 papers
- Microsoft Research (United Kingdom)GB4 papers
- Princeton UniversityUS4 papers
- University of British ColumbiaCA4 papers
- University of California, Los AngelesUS4 papers
- Courant Institute of Mathematical SciencesUS3 papers
- Eindhoven University of TechnologyNL3 papers
Showing 2008 · cs.DSShow all
3 papers · 2 filters
cs.DS2008★ 1 cited
Finding Sparse Cuts Locally Using Evolving Sets
Reid Andersen, Yuval Peres
A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph , starting from a spe…
cs.DS2008★ 43 cited
Multi-Armed Bandits in Metric Spaces
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the…
cs.DS2008★ 5 cited
Bloomier Filters: A second look
Denis Charles, Kumar Chellapilla
A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A Bloomier fil…