The following is a collection of results/observations/etc and from
some reason they were written down. There are no plans to publish
those results anywhere. If you refer to them, pleaee refer to this
webpage (or even better - the arxiv version if it is available).
A simple algorithm for
computing a cycle separator, with A. Nayyeri.
Approximately: Independence Implies Vertex Cover.
Two (known) results about graphs with
no short odd cycles, with R. Saladi.
A Proof of Dudley's Convex
Approximation, with M. Jones.
LSH on the Hypercube Revisited,
with S. Mahabadi.
Sheet: Chernoff Type Inequalities
[ full treatment].
A Simple Algorithm for Maximum Margin Classification,
Computing the $k$ nearest neighbors for all
vertices via Dijkstra.
$\varepsilon$-Nets for Halfspaces
Micha Sharir, and
A More Intuitive Proof of Chernoff's
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
Being Fat and Friendly is Not
Approximating Spanning Trees with Low
Crossing Number. Randomized Incremental
Construction of Compressed Quadtrees (5-July-09).
A Note of Fractional
Carnival of Samplings: Nets,
Approximations, Relative and Sensitive.
Covering by translated
intervals is NP-Hard, with Chandra Chekuri.
Low Rank Matrix Approximation in
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