Publications
]
2011. Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
1999. A survey of the role of multicommodity flow and randomization in network design and routing. American Mathematical Society, Series in Discrete Mathematics and Theoretical Computer Science. 43:271-302.
2008. Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
2001. Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
2007. Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
1999. Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
2010. Efficient kriging for real-time spatio-temporal interpolation. Proceedings of the 20 th Conference on Probability and Statistics in the Atmospheric Sciences. :228-235.
2008. A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
1996. An extension of the Lovász Local Lemma, and its applications to integer programming. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms. :6-15.
1995. Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
2010. GPUML: Graphical processors for speeding up kernel machines. Workshop on High Performance Analytics-Algorithms, Implementations, and Applications.
2000. Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS. 70:67-76.
1997. Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :692-701.
2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
1991. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1):1-21.
2011. A partial least squares framework for speaker recognition. Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on. :5276-5279.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
1999. Approximation algorithms via randomized rounding: a survey. Lectures on Approximation and Randomized Algorithms (M. Karonski and HJ Promel, editors), Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN. :9-71.
2007. Randomized Algorithms and Probabilistic Analysis in Wireless Networking. Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications. 4665:54-57.
2001. New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.
1993. Techniques for probabilistic analysis and randomness-efficient computation. Computer Science Technical Reports, Cornell University.
2009. Efficient subset selection via the kernelized Rényi distance. Computer Vision, 2009 IEEE 12th International Conference on. :1081-1088.
2011. Kernel partial least squares for speaker recognition. Twelfth Annual Conference of the International Speech Communication Association.