Publications

Export 7151 results:
Author [ Title(Desc)] Type Year
Filters: Filter is   [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
Gandhi R, Khuller S, Srinivasan A, Wang N.  2006.  Approximation algorithms for channel allocation problems in broadcast networks. Networks. 47(4):225-236.
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.
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.
Guha S, Khuller S.  1998.  Approximation algorithms for connected dominating sets. Algorithmica. 20(4):374-387.
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.
Khuller S, Thurimella R.  1993.  Approximation Algorithms for Graph Augmentation. Journal of Algorithms. 14(2):214-225.
Arya S, Cheng S-W, Mount D.  1998.  Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.
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.  2004.  Approximation algorithms for partial covering problems. Journal of Algorithms. 53(1):55-84.
Gandhi R, Khuller S, Srinivasan A.  2001.  Approximation algorithms for partial covering problems. Automata, Languages and Programming. :225-236.
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.
Guttmann-Beck N, Hassin R, Khuller S, Raghavachari B.  2000.  Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica. 28(4):422-437.
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.
Wu Y, Raschid L.  2009.  ApproxRank: Estimating Rank for a Subgraph. IEEE 25th International Conference on Data Engineering, 2009. ICDE '09. :54-65.
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.
Huq A, Grim CJ, Colwell RR.  2011.  Aquatic Realm and Cholera. Epidemiological and Molecular Aspects on Cholera. :311-339.
Sayeed A, Elsayed T, Garera N, Alexander D, Xu T, Oard D, Yarowsky D, Piatko C.  2009.  Arabic Cross-Document Coreference Resolution. Proceedings of the ACL-IJCNLP 2009 Conference Short Papers$}$. :357-360.
Schlesinger JD, O'Leary DP, Conroy JM.  2008.  Arabic/English Multi-document Summarization with CLASSYThe Past and the Future. Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919. :568-581.
Balkan AO, Qu G, Vishkin U.  2004.  Arbitrate-and-move primitives for high throughput on-chip interconnection networks. Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on. 2:II-441-4Vol.2-II-441-4Vol.2.
Haft DH, Payne SH, Selengut JD.  2012.  Archaeosortases and exosortases are widely distributed systems linking membrane transit with posttranslational modification.. J Bacteriol. 194(1):36-48.
Rosenfeld SN, Rus I, Cukier M.  2007.  Archetypal behavior in computer security. Journal of Systems and Software. 80(10):1594-1606.

Pages