172 citations
- Courant Institute of Mathematical SciencesUS3 papers
- Cornell UniversityUS2 papers
- The University of TokyoJP2 papers
- University of California, DavisUS2 papers
- University of Illinois Urbana-ChampaignUS2 papers
- University of PisaIT2 papers
- University of WaterlooCA2 papers
- Amsterdam University of the ArtsNL1 paper
- Columbia UniversityUS1 paper
- Fraunhofer-GesellschaftDE1 paper
- Georgia Institute of TechnologyUS1 paper
- Harvard University PressUS1 paper
Showing 2009 · cs.DSShow all
2 papers · 2 filters
cs.DS2009★ 40 cited
Online Stochastic Matching: Beating 1-1/e
Jon Feldman, Aranyak Mehta, Vahab Mirrokni +1
We study the online stochastic bipartite matching problem, in a form motivated by display ad allocation on the Internet. In the online, but adversarial case, the celebrated result…
cs.DS2009★ 1 cited
Optimal cache-aware suffix selection
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
Given string and integer , the {\em suffix selection} problem is to determine the th lexicographically smallest amongst the suffixes , .…