Publications

Search
Export 3363 results:
Author [ Title(Desc)] Type Year
Filters: First Letter Of Last Name is S  [Clear All Filters]
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 
A
Das R, Hwang YS, Uysal M, Saltz J, Sussman A.  1993.  Applying the CHAOS/PARTI library to irregular problems in computational chemistry and computational aerodynamics. Scalable Parallel Libraries Conference, 1993., Proceedings of the. :45-56.
Tanin E, Samet H.  2002.  APPOINT: an Approach for Peer-to-Peer Offloading the INTernet. Proceedings of the 2002 annual national conference on Digital government research. :1-7.
Srinivasan A.  2003.  On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
Shirdhonkar S, Jacobs DW.  2008.  Approximate earth mover's distance in linear time. Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on. :1-8.
Auer P, Long PM, Srinivasan A.  1997.  Approximating hyper-rectangles: learning and pseudo-random sets. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :314-323.
Mount D, Kanungo T, Netanyahu NS, Piatko C, Silverman R, Wu AY.  2001.  Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
Kanungo T, Mount D, Netanyahu NS, Piatko C, Silverman R, Wu AY.  1998.  Approximating large convolutions in digital images. PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING. :216-227.
Baveja A, Srinivasan A.  2000.  Approximating low-congestion routing and column-restricted packing problems. Information Processing Letters. 74(1–2):19-25.
Feige U, Halldórsson MM, Kortsarz G, Srinivasan A.  2003.  Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.
Gandhi R, Khuller S, Srinivasan A, Wang N.  2003.  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 2764:821-826.
Gandhi R, Khuller S, Srinivasan A, Wang N.  2003.  Approximation Algorithms for Channel Allocation Problems in Broadcast Networks. Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 2764:821-826.
Gandhi R, Khuller S, Srinivasan A, Wang N.  2006.  Approximation algorithms for channel allocation problems in broadcast networks. Networks. 47(4):225-236.
Chafekar D, Kumart VSA, Marathe MV, Parthasarathy S, Srinivasan A.  2008.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. IEEE INFOCOM 2008. The 27th Conference on Computer Communications. :1166-1174.
Baveja A, Srinivasan A.  2000.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems. Mathematics of Operations ResearchMathematics of Operations Research. 25(2):255-280.
Chekuri C, Hajiaghayi MT, Kortsarz G, Salavatipour MR.  2010.  Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design. SIAM Journal on Computing. 39(5):1772-1798.
Gandhi R, Khuller S, Srinivasan A.  2001.  Approximation algorithms for partial covering problems. Automata, Languages and Programming. :225-236.
Gandhi R, Khuller S, Srinivasan A.  2004.  Approximation algorithms for partial covering problems. Journal of Algorithms. 53(1):55-84.
Srinivasan A.  2007.  Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
Konjevod G, Ravi R, Srinivasan A.  2002.  Approximation algorithms for the covering Steiner problem. Random Structures & Algorithms. 20(3):465-482.
Pei G, Anil Kumar VS, Parthasarathy S, Srinivasan A.  2011.  Approximation algorithms for throughput maximization in wireless networks with delay constraints. 2011 Proceedings IEEE INFOCOM. :1116-1124.
Srinivasan A.  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.
Zhang Y, Manister E, Kraus S, V.S. Subrahmanian.  2005.  Approximation results for probabilistic survivability. Multi-Agent Security and Survivability, 2005 IEEE 2nd Symposium on. :1-10.
Ren Y, Bakken DE, Courtney T, Cukier M, Karr DA, Rubel P, Sabnis C, Sanders WH, Schantz RE, Seri M.  2003.  AQuA: an adaptive architecture that provides dependable distributed objects. Computers, IEEE Transactions on. 52(1):31-50.
Ren Y, Bakken DE, Courtney T, Cukier M, Karr DA, Rubel P, Sabnis C, Sanders WH, Schantz RE, Seri M.  2003.  AQuA: an adaptive architecture that provides dependable distributed objects. Computers, IEEE Transactions on. 52(1):31-50.
Cukier M, Ren J, Sabnis C, Henke D, Pistole J, Sanders WH, Bakken DE, Berman ME, Karr DA, Schantz RE.  1998.  AQuA: an adaptive architecture that provides dependable distributed objects. Seventeenth IEEE Symposium on Reliable Distributed Systems. :245-253.

Pages