| Matching with couples revisited | ||||
| Itai Ashalgi, Mark Braverman, Avinatan Hassidim | ||||
| Working paper | [pdf] | |||
| The rate of convergence of the Walk on Spheres Algorithm | ||||
| Ilia Binder, Mark Braverman | ||||
| Geometric and Functional Analysis, accepted | [pdf] | |||
| Phylogenetic Reconstruction with Insertions and Deletions | ||||
| Alex Andoni, Mark Braverman, Avinatan Hassidim | ||||
| Working paper | [pdf] | |||
| Sorting from Noisy Information | ||||
| Mark Braverman, Elchanan Mossel | ||||
| Submitted | [arXiv] [bib] | |||
| Approximate Nash equilibria under stability conditions | ||||
| Nina Balcan, Mark Braverman | ||||
| Working paper | [arXiv] | |||
| Finding low error clusterings | ||||
| Nina Balcan, Mark Braverman | ||||
| COLT 2009 | [pdf] [bib] | |||
| The complexity of simulating Brownian Motion | ||||
| Ilia Binder, Mark Braverman | ||||
| SODA 2009 | [pdf] [bib] | |||
| Noisy Sorting Without Resampling | ||||
| Mark Braverman, Elchanan Mossel | ||||
| SODA 2008 | [arXiv] [bib] | |||
| Mafia : A Theoretical Study of Players and Coalitions in a Partial Information Environment | ||||
| Mark Braverman, Omid Etesami, Elchanan Mossel | ||||
| Annals of Appl. Prob. 18(3), 2008 | [arXiv] [bib] | |||
| On ad hoc routing with guaranteed delivery | ||||
| Mark Braverman | ||||
| Brief announcement, PODC 2008 | [arXiv][bib] | |||
| Derandomizing Euclidean random walks | ||||
| Ilia Binder, Mark Braverman | ||||
| RANDOM 2007 | [pdf] [bib] | |||
| Termination of Integer Linear Programs | ||||
| Mark Braverman | ||||
| CAV (Computer-Aided Verification) 2006 | [pdf] [bib] | |||