Home | Bookmarks | Papers | Blog |

- Cheat Sheet: Chernoff Type Inequalities [full treatment].
- A Simple Algorithm for Maximum Margin Classification, Revisited.
- Computing the $k$ nearest neighbors for all vertices via Dijkstra.
- $\varepsilon$-Nets for Halfspaces Revisited, with Haim Kaplan, Micha Sharir, and Shakhar Smorodinsky.
- A More Intuitive Proof of Chernoff's Inequality?
- Fast Clustering with Lower Bounds: No Customer too Far, No Shop too Small, with with A. Ene and B. Raichel.
- A Simple Proof of the Existence of a Planar Separator.
- Being Fat and Friendly is Not Enough.
- Approximating Spanning Trees with Low Crossing Number.
- Randomized Incremental Construction of Compressed Quadtrees (5-July-09).
- A Note of Fractional Independent Segments.
- Carnival of Samplings: Nets, Approximations, Relative and Sensitive.
- Covering by translated intervals is NP-Hard, with Chandra Chekuri.
- Low Rank Matrix Approximation in Linear Time.
- A Comment on Pseudo-Triangulation in Three Dimensions.
- On the Expected Complexity of Random Convex Hulls.
- On the height of arrangmeent.
- Two randomized incramental algorithms for planar arrangements, with a twist, with P. K. Agarwal.

Last modified: Wed Sep 30 15:49:32 CDT 2015