☰

Sriram Pemmaraju - Publications

Affiliations: 
Computer Science University of Iowa, Iowa City, IA 
Area:
Computer Science, Epidemiology
Tree Info Similar researchers PubMed Report error

40 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2015 Hegeman JW, Pemmaraju SV. Sub-logarithmic distributed algorithms for metric facility location Distributed Computing. 28: 351-374. DOI: 10.1007/s00446-015-0243-x  0.36
2015 Pemmaraju SV. Equitable coloring extends chernoff-hoeffding bounds Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2129: 285-296.  0.311
2014 Hegeman JW, Pemmaraju SV. Lessons from the Congested Clique applied to MapReduce Theoretical Computer Science. DOI: 10.1016/j.tcs.2015.09.029  0.31
2014 Hegeman JW, Pemmaraju SV, Sardeshmukh VB. Near-constant-time distributed algorithms on a congested clique Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8784: 514-530.  0.415
2013 Hegeman J, Pemmaraju SV. A super-fast distributed algorithm for bipartite metric facility location Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8205: 522-536. DOI: 10.1007/978-3-642-41527-2_36  0.342
2012 Kothapalli K, Pemmaraju S. Super-fast 3-ruling sets Leibniz International Proceedings in Informatics, Lipics. 18: 136-147. DOI: 10.4230/LIPIcs.FSTTCS.2012.136  0.484
2012 Berns A, Hegeman J, Pemmaraju SV. Super-fast distributed algorithms for metric facility location Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7392: 428-439. DOI: 10.1007/978-3-642-31585-5-39  0.43
2011 Kothapalli K, Pemmaraju S. Distributed graph coloring in a few rounds Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 31-40. DOI: 10.1145/1993806.1993812  0.332
2011 Pemmaraju SV, Raman R, Varadarajan K. Max-coloring and online coloring with bandwidths on interval graphs Acm Transactions On Algorithms. 7. DOI: 10.1145/1978782.1978790  0.6
2010 Pandit S, Pemmaraju SV. Rapid randomized pruning for fast greedy distributed algorithms Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 325-334. DOI: 10.1145/1835698.1835777  0.521
2010 Damian M, Pemmaraju SV. Localized spanners for ad hoc wireless networks Ad-Hoc and Sensor Wireless Networks. 9: 305-328.  0.32
2009 Pandit S, Pemmaraju S. Return of the primal-dual: Distributed metric facility location Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 180-189. DOI: 10.1145/1582716.1582747  0.59
2009 Flury R, Pemmaraju SV, Wattenhofer R. Greedy routing with bounded stretch Proceedings - Ieee Infocom. 1737-1745. DOI: 10.1109/INFCOM.2009.5062093  0.431
2009 Pandit S, Pemmaraju SV, Varadarajan K. Approximation algorithms for domatic partitions of unit disk graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 312-325. DOI: 10.1007/978-3-642-03685-9_24  0.414
2009 Pandit S, Pemmaraju SV. Finding facilities fast Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5408: 11-24. DOI: 10.1007/978-3-540-92295-7_5  0.644
2008 Codenotti B, McCune B, Pemmaraju S, Raman R, Varadarajan K. An experimental study of different approaches to solve the market equilibrium problem Journal of Experimental Algorithmics. 12. DOI: 10.1145/1227161.1402295  0.531
2008 Anil Kumar VS, Marathe MV, Pemmaraju SV, Pirwani IA. On the complexity of minimum partition of frequency-agile radio networks 2008 Ieee Symposium On New Frontiers in Dynamic Spectrum Access Networks, Dyspan 2008. 345-354. DOI: 10.1109/DYSPAN.2008.43  0.785
2008 Lillis KM, Pemmaraju SV. On the efficiency of a local iterative algorithm to compute delaunay realizations Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5038: 69-86. DOI: 10.1007/978-3-540-68552-4_6  0.771
2007 Pemmaraju SV, Pirwani IA. Good quality virtual realization of unit ball graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4698: 311-322.  0.759
2007 Lillis KM, Pemmaraju SV, Pirwani IA. Topology control and geographic routing in realistic wireless networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4686: 15-31.  0.706
2006 Damian M, Pemmaraju SV. APX-hardness of domination problems in circle graphs Information Processing Letters. 97: 231-237. DOI: 10.1016/j.ipl.2005.11.007  0.495
2006 Herman T, Pemmaraju S, Pirwani I. Oriented edge colorings and link scheduling in sensor networks First International Conference On Communication System Software and Middleware, Comsware 2006. 2006.  0.357
2006 Pemmaraju SV, Pirwani IA. Energy conservation via domatic partitions Proceedings of the International Symposium On Mobile Ad Hoc Networking and Computing (Mobihoc). 2006: 143-154.  0.788
2005 Kostochka AV, Nakprasit K, Pemmaraju SV. On equitable coloring of d-degenerate graphs Siam Journal On Discrete Mathematics. 19: 83-95. DOI: 10.1137/S0895480103436505  0.367
2005 Pemmaraju SV, Raman R. Approximation algorithms for the max-coloring problem Lecture Notes in Computer Science. 3580: 1064-1075.  0.463
2004 Pemmaraju SV, Penumatcha S, Raman R. Approximating Interval Coloring and Max-Coloring in Chordal Graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3059: 399-416. DOI: 10.1145/1064546.1180619  0.618
2004 Damian M, Pemmaraju SV. Computing optimal diameter-bounded polygon partitions Algorithmica (New York). 40: 1-14. DOI: 10.1007/s00453-004-1092-3  0.382
2004 Pemmaraju SV, Raman R, Varadarajan K. Buffer Minimization using Max-Coloring Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 555-564.  0.42
2002 Damian-Iordache M, Pemmaraju SV. A (2 + ε)-approximation scheme for minimum domination on circle graphs Journal of Algorithms. 42: 255-276. DOI: 10.1006/jagm.2001.1206  0.777
2001 Damian-Iordache M, Pemmaraju SV. Computing optimal &agr;-fat and &agr;-small decompositions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 338-339.  0.688
1999 Heath LS, Pemmaraju SV. Stack and queue layouts of directed acyclic graphs: Part II Siam Journal On Computing. 28: 1588-1626. DOI: 10.1137/S0097539795280287  0.487
1999 Damian-Iordache M, Pemmaraju SV. Constant-factor approximation algorithms for domination problems on circle graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1741: 70-82. DOI: 10.1007/3-540-46632-0_8  0.774
1999 Damian-Iordache M, Pemmaraju SV. Hardness of approximating independent domination in circle graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1741: 56-69. DOI: 10.1007/3-540-46632-0_7  0.763
1999 Bruell SC, Ghosh S, Karaata MH, Pemmaraju SV. Self-stabilizing algorithms for finding centers and medians of trees Siam Journal On Computing. 29: 600-614.  0.376
1999 Heath LS, Pemmaraju SV. Stack and queue layouts of directed acyclic graphs: Part II Siam Journal On Computing. 28: 1588-1626.  0.487
1998 Damian-Iordache M, Pemmaraju SV. Automatic data decomposition for message-passing machines Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1366: 64-78. DOI: 10.1007/BFb0032684  0.734
1997 Heath LS, Pemmaraju SV. Stack and queue layouts of posets Siam Journal On Discrete Mathematics. 10: 599-625. DOI: 10.1137/S0895480193252380  0.348
1997 Rus T, Pemmaraju S. Using graph coloring in an algebraic compiler Acta Informatica. 34: 191-209. DOI: 10.1007/S002360050079  0.354
1997 Ghosh S, Gupta A, Pemmaraju SV. A self-stabilizing algorithm for the maximum flow problem Distributed Computing. 10: 167-180.  0.358
1994 Heath LS, Pemmaraju SV. New results for the minimum weight triangulation problem Algorithmica. 12: 533-552. DOI: 10.1007/Bf01188718  0.349
Show low-probability matches.