-
Algorithms for Random 3-SAT, extended version of chapter in Encyclopedia of Algorithms (2008) 742-744.
-
A spectral technique for random satisfiable 3CNF formulas, Random Structures and Algorithms, 32 (4) (2008) 519-534.
-
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem, Combinatorics, Probability, and Computing 16 (2007) 713-732.
[Co-authors: A. M. Frieze and J. Vera]
Slides from my talk at STOC 2005
-
The lower tail of the random minimum spanning tree, Electronic Journal of Combinatorics 14 (1) (2007) N3.
-
The diameter of a randomly perturbed digraph and some applications, Random Structures and Algorithms 30 (2007), 484-504.
[Co-author: A. Frieze]
Slides from RANDOM 2004 talk
[bibtex]
-
First-passage percolation on a width-2 strip and the path cost in a VCG auction, Proc. of the 2nd International Workshop on Internet and Network Economics (WINE) (2006) 99-111.
[Co-authors: D. Gamarnik and G. B. Sorkin]
Slides from talk at CanaDAM 2007
[bibtex]
-
Randomly coloring sparse random graphs with fewer colors than the maximum degree, Random Structures and Algorithms 29, (2006) 450-465.
[Co-authors: M. Dyer, A. Frieze, and E. Vigoda]
[bibtex]
-
Average-case analysis for combinatorial problems, Ph.D. Thesis, Dept. of Mathematical Sciences, Carnegie Mellon University (2006).
-
On the random 2-stage minimum spanning tree, Random Structures and Algorithms, 28 (1) (2006) 24-36.
[Co-authors: A. Freize and M. Krivelevich]
Slides from my post-doc job talk on medium density subset sum and random minimum spanning trees
[bibtex]
-
On the random 2-stage minimum spanning tree, Proc. of the 16th Symposium on Discrete Algorithms (SODA) (2005) 287-292 (see also journal version above).
[Co-authors: A. Freize and M. Krivelevich]
Slides from my post-doc job talk on medium density subset sum and random minimum spanning trees
[bibtex]
-
Solving medium density subset sum problems in expected polynomial time, Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (2005) 305-314.
[Co-author: B. Przydatek]
Slides from my post-doc job talk on medium density subset sum and random minimum spanning trees
[bibtex]
-
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem, Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC) (2005) 441-449 (see also journal version above).
[Co-authors: A. M. Frieze and J. Vera]
Slides from my talk at STOC 2005
-
Embracing the giant component, Random Structures and Algorithms 27 (3) (2005), 277-289.
[Co-authors: D. Gamarnik and G. Sorkin]
[bibtex]
-
Embracing the giant component, Proc. of the 6th Conference of Latin American Theoretical Informatics (2004) 69-79 (see also journal version above).
[Co-authors: D. Gamarnik and G. Sorkin]
[bibtex]
-
A sharp threshold for a random constraint satisfaction problem, Discrete Mathematics 285/1-3 (2004), 301-305.
[bibtex]
-
The diameter of a randomly perturbed digraph and some applications, Proc. of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 8th International Workshop on Randomization and Computation (2004) 345-356 (see also journal version above).
[Co-author: A. Frieze]
Slides from RANDOM 2004 talk
[bibtex]
-
Efficient communication in an ad-hoc network, Journal of Algorithms 52 (1) (2004), 1-7.
[Co-authors: A. Frieze and E. Upfal]
[bibtex]
-
A spectral technique for random satisfiable 3CNF formulas, Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, (2003), 357-363.
[bibtex]