Publications
2007. Plasma Turbulence Simulation and Visualization on Graphics Processors: Efficient Parallel Computing on the Desktop. Bulletin of the American Physical Society. Volume 52, Number 11
2018. Characterization of the Microbiome at the World’s Largest Potable Water Reuse Facility. Frontiers in Microbiology.
2007. Appendix to CMod: Modular Information Hiding and Type-Safe Linking for C. Technical Reports of the Computer Science Department.
2010. SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING. IEEE Transactions on Pattern Analysis and Machine Intelligence. 32(4):0162-8828.
2008. Modular Information Hiding and Type-Safe Linking for C. IEEE Transactions on Software Engineering. 34(3):357-376.
2001. Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
2011. A partial least squares framework for speaker recognition. Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on. :5276-5279.
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.
2008. A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
2010. Partial least squares on graphical processor for efficient pattern recognition. Technical Reports of the Computer Science Department.
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.
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.
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.
1991. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1):1-21.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.