Journal Papers
  1. A sharp threshold for a random constraint satisfaction problem, Discrete Mathematics 285/1-3 (2004), 301-305.
    [bibtex]
  2. Efficient communication in an ad-hoc network, Journal of Algorithms 52 (1) (2004), 1-7.
    [Co-authors: A. Frieze and E. Upfal]
    [bibtex]
  3. Strings with maximum numbers of distinct subsequences and substrings, Electronic Journal of Combinatorics 11 (1) (2004), R8.
    [Co-authors: A. Harrow and G. Sorkin]
    [bibtex]
  4. High degree vertices and eigenvalues in the preferential attachment graph, Internet Mathematics, 2 (2005) no. 1, 1-19.
    [Co-authors: T. Fenner and A. Frieze]
    [bibtex]
  5. Embracing the giant component, Random Structures and Algorithms 27 (3) (2005), 277-289.
    [Co-authors: D. Gamarnik and G. Sorkin]
    [bibtex]
  6. 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]
  7. 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]
  8. Expansion and lack thereof in randomly perturbed graphs, Internet Mathematics 4 (2) (2007) 131-147.
    Slides from DIMACS workshop, spring 2007
  9. Maximum matchings in regular graphs of high girth, Electronic Journal of Combinatorics 14 (1) (2007) N1.
    [Co-author: S. Hoory]
  10. 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
  11. The lower tail of the random minimum spanning tree, Electronic Journal of Combinatorics 14 (1) (2007) N3.
  12. A geometric preferential attachment model of networks II, Internet Mathematics 4 (1) (2007) 87-111.
    [Co-authors: A. Frieze and J. Vera]
    Slides for my 25 minute talk at WAW 2007
  13. A geometric preferential attachment model of networks, Internet Mathematics 3 (2) (2007) 187-205.
    [Co-authors: A. Frieze and J. Vera]
    [bibtex]
  14. 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]
  15. Adversarial deletions in a scale free random graph process, Combinatorics, Probability and Computing, 16 (2007) 261-270.
    [Co-authors: A. Frieze and J. Vera]
    [bibtex]
  16. Defending against Sybil attacks via social networks, IEEE/ACM Transactions on Networking 16 (3) (2008) 576-589.
    [Co-authors: Haifeng Yu, M. Kaminsky, P. Gibbons]
  17. A spectral technique for random satisfiable 3CNF formulas, Random Structures and Algorithms, 32 (4) (2008) 519-534.
  18. Clustering with shallow trees, Journal of Statistical Mechanics: Theory and Experiment (JSTAT) P12010.
    [Co-authors: M. Bailly-Bechet, S. Bradde, A. Braunstein, L. Foini, R. Zecchina]
  19. Neonatal, postneonatal, childhood, and under-5 mortality for 187 countries, 1970-2010: a systematic analysis of progress towards Millennium Development Goal 4, The Lancet, Volume 375, Issue 9730 (2010), 1988-2008.
    [Co-authors: J. Rajaratnam, J. Marcus, H. Wang, A. Levin-Rector, L. Dwyer, M. Costa, A. Lopez, C. Murray]
  20. On the diameter of the set of satisfying assignments in random satisfiable k-CNF formulas, to appear in SIAM J of Discrete Math.
    [Co-authors: U. Feige and D. Vilenchik]