Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
S
Stantchev G, Juba D, Dorland W, Varshney A.  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
Stamps BW, Leddy MB, Plumlee MH, Hasan NA, Colwell RR, Spear JR.  2018.  Characterization of the Microbiome at the World’s Largest Potable Water Reuse Facility. Frontiers in Microbiology.
Stallmann M, Cleaveland R, Hebbar P.  1991.  Gdr: A visualization tool for graph algorithms.
Srivastava S, Gulwani S, Foster JS.  2010.  From program verification to program synthesis. ACM SIGPLAN Notices. 45:313-326.
Srivastava S, Hicks MW, Foster JS, Jenkins P.  2008.  Modular Information Hiding and Type-Safe Linking for C. IEEE Transactions on Software Engineering. 34(3):357-376.
Srivastava A, Damon JN, Dryden IL, Jermyn IH, Das S, Vaswani N, Huckemann S, Hotz T, Munk A, Lin Z et al..  2010.  SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING. IEEE Transactions on Pattern Analysis and Machine Intelligence. 32(4):0162-8828.
Srivastava S, Hicks MW, Foster JS.  2007.  Appendix to CMod: Modular Information Hiding and Type-Safe Linking for C. Technical Reports of the Computer Science Department.
Sriram S, Bhattacharyya SS.  2000.  Embedded multiprocessors: Scheduling and synchronization. 3
Srinivasan A.  2011.  Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
Srinivasan A.  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.
Srinivasan A.  2008.  Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
Srinivasan A.  2007.  Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
Srinivasan B V, Schwartz W R, Duraiswami R, Davis LS.  2010.  Partial least squares on graphical processor for efficient pattern recognition. Technical Reports of the Computer Science Department.
Srinivasan A.  2006.  Review of "The Random Projection Method by Santosh Vempala". SIGACT News. 37(4):41-43.
Srinivasan A.  1999.  Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
Srinivasan BV, Duraiswami R, Murtugudde R.  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.
Srinivasan A.  2008.  A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
Srinivasan A.  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.
Srinivasan A.  1995.  Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
Srinivasan BV, Hu Q, Duraiswami R.  2010.  GPUML: Graphical processors for speeding up kernel machines. Workshop on High Performance Analytics-Algorithms, Implementations, and Applications.
Srinivasan A.  2000.  Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS. 70:67-76.
Srinivasan A.  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.
Srinivasan A.  1992.  A Generalization of Brooks' Theorem. Computer Science Technical Reports.
Srinivasan A.  2003.  On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.

Pages