6 citations · 13 across the 4 of their papers we have counts for
6 papers
Competitive Data-Structure Dynamization
Claire Mathieu, Rajmohan Rajaraman, Neal E. Young +1
Data-structure dynamization is a general approach for making static data structures dynamic. It is used extensively in geometric settings and in the guise of so-called merge (or co…
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration
Rafail Ostrovsky, Yuval Rabani, Arman Yousefi
Osborne's iteration is a method for balancing matrices which is widely used in linear algebra packages, as balancing preserves eigenvalues and stabilizes their numeral…
Matrix Balancing in Lp Norms: A New Analysis of Osborne's Iteration
Rafail Ostrovsky, Yuval Rabani, Arman Yousefi
We study an iterative matrix conditioning algorithm due to Osborne (1960). The goal of the algorithm is to convert a square matrix into a balanced matrix where every row and corres…
Bigtable Merge Compaction
Claire Mathieu, Carl Staelin, Neal E. Young +1
NoSQL databases are widely used for massive data storage and real-time web applications. Yet important aspects of these data structures are not well understood. For example, NoSQL…
Improved Approximation Algorithms for Earth-Mover Distance in Data Streams
Arman Yousefi, Rafail Ostrovsky
For two multisets and of points in , such that , the earth-mover distance (EMD) between and is the minimum cost of a perfect bipartite matching…
On a Linear Program for Minimum-Weight Triangulation
Arman Yousefi, Neal E. Young
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for ma…