20 citations · 26 across the 2 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013
An Optimal Randomized Online Algorithm for Reordering Buffer Management
Noa Avigdor-elgrabli, Yuval Rabani
We give an -competitive randomized online algorithm for reordering buffer management, where is the buffer size. Our bound matches the lower bound of Adamaszek et…
cs.DS2011★ 6 cited
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
Howard Karloff, Flip Korn, Konstantin Makarychev +1
This paper studies the "explanation problem" for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensional tre…
cs.DS2010★ 20 cited
Rademacher Chaos, Random Eulerian Graphs and The Sparse Johnson-Lindenstrauss Transform
Vladimir Braverman, Rafail Ostrovsky, Yuval Rabani
The celebrated dimension reduction lemma of Johnson and Lindenstrauss has numerous computational and other applications. Due to its application in practice, speeding up the computa…