Publications
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.
2010. Random sampling for estimating the performance of fast summations. Technical Reports of the Computer Science Department.
2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
2010. Fast matrix-vector product based fgmres for kernel machines. Copper Mountain Conference on Iterative Methods. 2
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.
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.
2008. Budgeted Allocations in the Full-Information Setting. Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 5171:247-253.
1997. A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :636-643.
2010. Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. SIGACT News. 41(1):28-30.
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.
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.
2007. Appendix to CMod: Modular Information Hiding and Type-Safe Linking for C. Technical Reports of the Computer Science Department.
2018. Characterization of the Microbiome at the World’s Largest Potable Water Reuse Facility. Frontiers in Microbiology.
2009. Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence. Computing in Science Engineering. 11(2):52-59.
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
2008. Confluent Volumetric Visualization of Gyrokinetic Turbulence. Plasma Science, IEEE Transactions on. 36(4):1112-1113.