default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSriram V. Pemmaraju
Person information
- affiliation: University of Iowa, Iowa City, IA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c76]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. ITCS 2024: 41:1-41:26- [c75]Hongyan Ji
, Sriram V. Pemmaraju:
Towards Singular Optimality in the Presence of Local Initial Knowledge. SIROCCO 2024: 300-317 - [i25]Hongyan Ji, Sriram V. Pemmaraju:
Towards singular optimality in the presence of local initial knowledge. CoRR abs/2402.14221 (2024) - 2023
- [c74]Hankyu Jang, Andrew Fu, Jiaming Cui, Methun Kamruzzaman, B. Aditya Prakash, Anil Vullikanti, Bijaya Adhikari, Sriram V. Pemmaraju:
Detecting Sources of Healthcare Associated Infections. AAAI 2023: 4347-4355 - [c73]Pratik Maitra, Masahiro Kiji, Talal Riaz, Philip M. Polgreen, Alberto M. Segre, Sriram V. Pemmaraju, Bijaya Adhikari:
Cad2graph: Automated Extraction of Spatial Graphs from Architectural Drawings. ECML/PKDD (7) 2023: 315-319 - [c72]Sriram V. Pemmaraju, Joshua Z. Sobel:
Exact Distributed Sampling. SIROCCO 2023: 558-575 - [i24]Sriram V. Pemmaraju, Joshua Z. Sobel:
Exact Distributed Sampling. CoRR abs/2303.02714 (2023) - [i23]Hankyu Jang, Sulyun Lee, D. M. Hasibul Hasan, Philip M. Polgreen, Sriram V. Pemmaraju, Bijaya Adhikari:
Dynamic Healthcare Embeddings for Improving Patient Care. CoRR abs/2303.11563 (2023) - [i22]Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
The Message Complexity of Distributed Graph Optimization. CoRR abs/2311.14811 (2023) - 2022
- [j28]Hankyu Jang, Shreyas Pai, Bijaya Adhikari, Sriram V. Pemmaraju:
Risk-aware temporal cascade reconstruction to detect asymptomatic cases. Knowl. Inf. Syst. 64(12): 3373-3399 (2022) - [j27]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju:
Near-optimal clustering in the k-machine model. Theor. Comput. Sci. 899: 80-97 (2022) - [c71]Hankyu Jang, Sulyun Lee, D. M. Hasibul Hasan, Philip M. Polgreen, Sriram V. Pemmaraju, Bijaya Adhikari:
Dynamic Healthcare Embeddings for Improving Patient Care. ASONAM 2022: 52-59 - [c70]Masahiro Kiji, D. M. Hasibul Hasan, Alberto M. Segre, Sriram V. Pemmaraju, Bijaya Adhikari:
Near-Optimal Spectral Disease Mitigation in Healthcare Facilities. ICDM 2022: 999-1004 - [c69]Shreyas Pai, Sriram V. Pemmaraju:
Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets. PODC 2022: 366-368 - [i21]Shreyas Pai, Sriram V. Pemmaraju:
Deterministic Massively Parallel Algorithms for Ruling Sets. CoRR abs/2205.12686 (2022) - 2021
- [j26]Hankyu Jang, Philip M. Polgreen, Alberto M. Segre, Sriram V. Pemmaraju:
COVID-19 modeling and non-pharmaceutical interventions in an outpatient dialysis unit. PLoS Comput. Biol. 17(7) (2021) - [c68]Hankyu Jang, Shreyas Pai, Bijaya Adhikari, Sriram V. Pemmaraju:
Risk-aware Temporal Cascade Reconstruction to Detect Asymptomatic Cases : For the CDC MInD Healthcare Network. ICDM 2021: 240-249 - [c67]D. M. Hasibul Hasan, Alex Rohwer, Hankyu Jang, Ted Herman, Philip M. Polgreen, Daniel K. Sewell, Bijaya Adhikari, Sriram V. Pemmaraju:
Modeling and Evaluation of Clustering Patient Care into Bubbles. ICHI 2021: 73-82 - [c66]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? PODC 2021: 247-257 - [i20]Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
The Complexity of Symmetry Breaking in Massive Graphs. CoRR abs/2105.01833 (2021) - [i19]D. M. Hasibul Hasan, Alex Rohwer, Hankyu Jang, Ted Herman, Philip M. Polgreen, Daniel K. Sewell, Bijaya Adhikari, Sriram V. Pemmaraju:
Modeling and Evaluation of Clustering Patient Care into Bubbles. CoRR abs/2105.06278 (2021) - [i18]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Peter Robinson:
Can We Break Symmetry with o(m) Communication? CoRR abs/2105.08917 (2021) - 2020
- [c65]Kishore Kothapalli, Shreyas Pai, Sriram V. Pemmaraju:
Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model. FSTTCS 2020: 28:1-28:18 - [c64]Shreyas Pai, Sriram V. Pemmaraju:
Connectivity Lower Bounds in Broadcast Congested Clique. FSTTCS 2020: 32:1-32:17 - [c63]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. PODC 2020: 501-510 - [e2]Nandini Mukherjee, Sriram V. Pemmaraju:
ICDCN 2020: 21st International Conference on Distributed Computing and Networking, Kolkata, India, January 4-7, 2020. ACM 2020, ISBN 978-1-4503-7751-5 [contents] - [i17]Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju:
Distributed Approximation on Power Graphs. CoRR abs/2006.03746 (2020) - [i16]Kishore Kothapalli, Shreyas Pai, Sriram V. Pemmaraju:
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model. CoRR abs/2009.12477 (2020)
2010 – 2019
- 2019
- [c62]Hankyu Jang, Samuel Justice, Philip M. Polgreen, Alberto M. Segre, Daniel K. Sewell, Sriram V. Pemmaraju:
Evaluating architectural changes to alter pathogen dynamics in a dialysis unit: for the CDC MInD-healthcare group. ASONAM 2019: 961-968 - [c61]Shreyas Pai, Sriram V. Pemmaraju:
Connectivity Lower Bounds in Broadcast Congested Clique. PODC 2019: 256-258 - [c60]Christian Konrad, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
The Complexity of Symmetry Breaking in Massive Graphs. DISC 2019: 26:1-26:18 - [i15]Shreyas Pai, Sriram V. Pemmaraju:
Connectivity Lower Bounds in Broadcast Congested Clique. CoRR abs/1905.09016 (2019) - 2018
- [c59]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju:
Near-Optimal Clustering in the k-machine model. ICDCN 2018: 15:1-15:10 - [c58]Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju:
Large-Scale Distributed Algorithms for Facility Location with Outliers. OPODIS 2018: 5:1-5:16 - [i14]Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju:
Large-Scale Distributed Algorithms for Facility Location with Outliers. CoRR abs/1811.06494 (2018) - 2017
- [c57]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets. PODC 2017: 207-209 - [c56]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. DISC 2017: 38:1-38:16 - [i13]Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, Talal Riaz, Peter Robinson:
Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets. CoRR abs/1705.07861 (2017) - [i12]Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Sriram V. Pemmaraju:
Near-Optimal Clustering in the k-machine model. CoRR abs/1710.08381 (2017) - 2016
- [c55]Sriram V. Pemmaraju, Vivek B. Sardeshmukh:
Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages. FSTTCS 2016: 47:1-47:15 - [c54]Sriram V. Pemmaraju, Talal Riaz:
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm. OPODIS 2016: 9:1-9:17 - [c53]Sriram V. Pemmaraju, Talal Riaz:
Brief Announcement: Using Read-k Inequalities to Analyze a Distributed MIS Algorithm. PODC 2016: 483-485 - [i11]Sriram V. Pemmaraju, Talal Riaz:
Using Read-k Inequalities to Analyze a Distributed MIS Algorithm. CoRR abs/1605.06486 (2016) - [i10]Sriram V. Pemmaraju, Vivek B. Sardeshmukh:
Super-fast MST Algorithms in the Congested Clique using o(m) Messages. CoRR abs/1610.03897 (2016) - 2015
- [j25]James W. Hegeman, Sriram V. Pemmaraju:
Sub-logarithmic distributed algorithms for metric facility location. Distributed Comput. 28(5): 351-374 (2015) - [j24]James W. Hegeman, Sriram V. Pemmaraju:
Lessons from the Congested Clique applied to MapReduce. Theor. Comput. Sci. 608: 268-281 (2015) - [c52]Mauricio Monsalve, Sriram V. Pemmaraju, Sarah Johnson, Philip M. Polgreen:
Improving Risk Prediction of Clostridium Difficile Infection Using Temporal Event-Pairs. ICHI 2015: 140-149 - [c51]James W. Hegeman, Gopal Pandurangan, Sriram V. Pemmaraju, Vivek B. Sardeshmukh, Michele Scquizzato:
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST. PODC 2015: 91-100 - 2014
- [c50]Tushar Bisht, Kishore Kothapalli, Sriram V. Pemmaraju:
Brief announcement: Super-fast t-ruling sets. PODC 2014: 379-381 - [c49]James W. Hegeman, Sriram V. Pemmaraju:
Lessons from the Congested Clique Applied to MapReduce. SIROCCO 2014: 149-164 - [c48]James W. Hegeman, Sriram V. Pemmaraju, Vivek Sardeshmukh:
Near-Constant-Time Distributed Algorithms on a Congested Clique. DISC 2014: 514-530 - [i9]James Hegeman, Sriram V. Pemmaraju:
Lessons from the Congested Clique Applied to MapReduce. CoRR abs/1405.4356 (2014) - [i8]James W. Hegeman, Sriram V. Pemmaraju, Vivek Sardeshmukh:
Near-Constant-Time Distributed Algorithms on a Congested Clique. CoRR abs/1408.2071 (2014) - [i7]Sriram V. Pemmaraju, Vivek B. Sardeshmukh:
Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique. CoRR abs/1412.2333 (2014) - 2013
- [j23]Andrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju:
Building self-stabilizing overlay networks with the transitive closure framework. Theor. Comput. Sci. 512: 2-14 (2013) - [c47]Kishore Kothapalli, Sriram V. Pemmaraju, Vivek Sardeshmukh:
On the Analysis of a Label Propagation Algorithm for Community Detection. ICDCN 2013: 255-269 - [c46]James Hegeman, Sriram V. Pemmaraju:
A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location. DISC 2013: 522-536 - [c45]Mauricio Monsalve, Sriram V. Pemmaraju, Philip Polgreen:
Interactions in an intensive care unit: experiences pre-processing sensor network data. Wireless Health 2013: 5:1-5:8 - [i6]Andrew Berns, James Hegeman, Sriram V. Pemmaraju:
Super-Fast Distributed Algorithms for Metric Facility Location. CoRR abs/1308.2473 (2013) - [i5]James Hegeman, Sriram V. Pemmaraju:
A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location. CoRR abs/1308.2694 (2013) - 2012
- [c44]Kishore Kothapalli, Sriram V. Pemmaraju:
Super-Fast 3-Ruling Sets. FSTTCS 2012: 136-147 - [c43]Andrew Berns, James Hegeman, Sriram V. Pemmaraju:
Super-Fast Distributed Algorithms for Metric Facility Location. ICALP (2) 2012: 428-439 - [c42]Ted Herman, Mauricio Monsalve, Sriram V. Pemmaraju, Philip Polgreen, Alberto Maria Segre, Deepti Sharma, Geb Thomas:
Inferring Realistic Intra-hospital Contact Networks Using Link Prediction and Computer Logins. SocialCom/PASSAT 2012: 572-578 - [i4]Kishore Kothapalli, Sriram V. Pemmaraju:
Super-Fast 3-Ruling Sets. CoRR abs/1207.3099 (2012) - [i3]Kishore Kothapalli, Sriram V. Pemmaraju, Vivek Sardeshmukh:
On the Analysis of a Label Propagation Algorithm for Community Detection. CoRR abs/1210.3735 (2012) - 2011
- [j22]Sriram V. Pemmaraju, Imran A. Pirwani:
Good Quality Virtual Realization of Unit Disk Graphs. J. Comput. Geom. 2(1): 69-91 (2011) - [j21]Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Max-coloring and online coloring with bandwidths on interval graphs. ACM Trans. Algorithms 7(3): 35:1-35:21 (2011) - [c41]Kishore Kothapalli, Sriram V. Pemmaraju:
Distributed graph coloring in a few rounds. PODC 2011: 31-40 - [c40]Andrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju:
Building Self-stabilizing Overlay Networks with the Transitive Closure Framework. SSS 2011: 62-76 - 2010
- [j20]Mirela Damian, Sriram V. Pemmaraju:
Localized Spanners for Ad Hoc Wireless Networks. Ad Hoc Sens. Wirel. Networks 9(3-4): 305-328 (2010) - [j19]Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-Coloring and Hypo-Coloring Interval Graphs. Discret. Math. Algorithms Appl. 2(3): 331-346 (2010) - [c39]Donald Ephraim Curtis, Sriram V. Pemmaraju, Philip Polgreen:
Budgeted Maximum Coverage with Overlapping Costs: Monitoring the Emerging Infections Network. ALENEX 2010: 112-123 - [c38]Donald Ephraim Curtis, Christopher S. Hlady, Sriram V. Pemmaraju, Philip Polgreen, Alberto M. Segre:
Modeling and estimating the spatial distribution of healthcare workers. IHI 2010: 287-296 - [c37]Saurav Pandit, Sriram V. Pemmaraju:
Rapid randomized pruning for fast greedy distributed algorithms. PODC 2010: 325-334 - [c36]Andrew Berns, Sukumar Ghosh, Sriram V. Pemmaraju:
Brief announcement: a framework for building self-stabilizing overlay networks. PODC 2010: 398-399 - [e1]Krishna Kant, Sriram V. Pemmaraju, Krishna M. Sivalingam, Jie Wu:
Distributed Computing and Networking, 11th International Conference, ICDCN 2010, Kolkata, India, January 3-6, 2010. Proceedings. Lecture Notes in Computer Science 5935, Springer 2010, ISBN 978-3-642-11321-5 [contents]
2000 – 2009
- 2009
- [c35]Saurav Pandit, Sriram V. Pemmaraju, Kasturi R. Varadarajan:
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs. APPROX-RANDOM 2009: 312-325 - [c34]Saurav Pandit, Sriram V. Pemmaraju:
Finding Facilities Fast. ICDCN 2009: 11-24 - [c33]Roland Flury, Sriram V. Pemmaraju, Roger Wattenhofer:
Greedy Routing with Bounded Stretch. INFOCOM 2009: 1737-1745 - [c32]Saurav Pandit, Sriram V. Pemmaraju:
Return of the primal-dual: distributed metric facility location. PODC 2009: 180-189 - [c31]Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman:
Sub-coloring and Hypo-coloring Interval Graphs. WG 2009: 122-132 - 2008
- [j18]Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pirwani:
Topology Control and Geographic Routing in Realistic Wireless Networks. Ad Hoc Sens. Wirel. Networks 6(3-4): 265-297 (2008) - [j17]Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
An experimental study of different approaches to solve the market equilibrium problem. ACM J. Exp. Algorithmics 12: 3.3:1-3.3:21 (2008) - [c30]Sriram V. Pemmaraju, Aravind Srinivasan:
The Randomized Coloring Procedure with Symmetry-Breaking. ICALP (1) 2008: 306-319 - [c29]Kevin M. Lillis, Sriram V. Pemmaraju:
On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. WEA 2008: 69-86 - [i2]Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Local Approximation Schemes for Topology Control. CoRR abs/0803.2174 (2008) - [i1]Mirela Damian, Sriram V. Pemmaraju:
Localized Spanners for Wireless Networks. CoRR abs/0806.4221 (2008) - 2007
- [j16]Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju:
Fault-containing self-stabilizing distributed protocols. Distributed Comput. 20(1): 53-73 (2007) - [c28]Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pirwani:
Topology Control and Geographic Routing in Realistic Wireless Networks. ADHOC-NOW 2007: 15-31 - [c27]Sriram V. Pemmaraju, Imran A. Pirwani:
Good Quality Virtual Realization of Unit Ball Graphs. ESA 2007: 311-322 - [c26]Ted Herman, Sriram V. Pemmaraju, Laurence Pilard, Morten Mjelde:
Temporal Partition in Sensor Networks. SSS 2007: 325-339 - 2006
- [j15]Mirela Damian, Sriram V. Pemmaraju:
APX-hardness of domination problems in circle graphs. Inf. Process. Lett. 97(6): 231-237 (2006) - [c25]Sriram V. Pemmaraju, Imran A. Pirwani:
Energy conservation via domatic partitions. MobiHoc 2006: 143-154 - [c24]Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Distributed Spanner Construction in Doubling Metric Spaces. OPODIS 2006: 157-171 - [c23]Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju:
Local approximation schemes for topology control. PODC 2006: 208-217 - 2005
- [j14]Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
Approximating interval coloring and max-coloring in chordal graphs. ACM J. Exp. Algorithmics 10 (2005) - [j13]Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju:
On Equitable Coloring of d-Degenerate Graphs. SIAM J. Discret. Math. 19(1): 83-95 (2005) - [c22]Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
An Experimental Study of Different Approaches to Solve the Market Equilibrium Problem. ALENEX/ANALCO 2005: 167-179 - [c21]Sriram V. Pemmaraju, Rajiv Raman:
Approximation Algorithms for the Max-coloring Problem. ICALP 2005: 1064-1075 - [c20]Kevin M. Lillis, Sriram V. Pemmaraju:
Topology Control with Limited Geometric Information. OPODIS 2005: 427-442 - [c19]Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan:
On the polynomial time computation of equilibria for certain exchange economies. SODA 2005: 72-81 - 2004
- [j12]Mirela Damian, Sriram V. Pemmaraju:
Computing Optimal Diameter-Bounded Polygon Partitions. Algorithmica 40(1): 1-14 (2004) - [j11]Bruno Codenotti, Sriram V. Pemmaraju, Kasturi R. Varadarajan:
The computation of market equilibria. SIGACT News 35(4): 23-37 (2004) - [c18]Sukumar Ghosh, Kevin M. Lillis, Saurav Pandit, Sriram V. Pemmaraju:
Robust Topology Control Protocols. OPODIS 2004: 94-109 - [c17]Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan:
Buffer minimization using max-coloring. SODA 2004: 562-571 - [c16]Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman:
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. WEA 2004: 399-416 - 2003
- [c15]Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka:
Equitable colorings with constant number of colors. SODA 2003: 458-459 - 2002
- [j10]Mirela Damian-Iordache, Sriram V. Pemmaraju:
A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs. J. Algorithms 42(2): 255-276 (2002) - 2001
- [c14]Sriram V. Pemmaraju:
Equitable Coloring Extends Chernoff-Hoeffding Bounds. RANDOM-APPROX 2001: 285-296 - [c13]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Computing optimal alpha-fat and alpha-small decompositions. SODA 2001: 338-339 - [c12]Sriram V. Pemmaraju:
Equitable colorings extend Chernoff-Hoeffding bounds. SODA 2001: 924-925 - 2000
- [j9]Ted Herman, Sriram V. Pemmaraju:
Error-detecting codes and fault-containing self-stabilization. Inf. Process. Lett. 73(1-2): 41-46 (2000) - [c11]Mirela Damian-Iordache, Sriram V. Pemmaraju:
A (2 + epsilon)-approximation scheme for minimum domination on circle graphs. SODA 2000: 672-679
1990 – 1999
- 1999
- [j8]Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk:
Stack and Queue Layouts of Directed Acyclic Graphs: Part I. SIAM J. Comput. 28(4): 1510-1539 (1999) - [j7]Lenwood S. Heath, Sriram V. Pemmaraju:
Stack and Queue Layouts of Directed Acyclic Graphs: Part II. SIAM J. Comput. 28(5): 1588-1626 (1999) - [j6]Steven C. Bruell, Sukumar Ghosh, Mehmet Hakan Karaata, Sriram V. Pemmaraju:
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees. SIAM J. Comput. 29(2): 600-614 (1999) - [c10]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Hardness of Approximating Independent Domination in Circle Graphs. ISAAC 1999: 56-69 - [c9]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs. ISAAC 1999: 70-82 - 1997
- [j5]Teodor Rus, Sriram V. Pemmaraju:
Using Graph Coloring in an Algebraic Compiler. Acta Informatica 34(3): 191-209 (1997) - [j4]Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju:
A Self-Stabilizing Algorithm for the Maximum Flow Problem. Distributed Comput. 10(4): 167-180 (1997) - [j3]Lenwood S. Heath, Sriram V. Pemmaraju:
Stack and Queue Layouts of Posets. SIAM J. Discret. Math. 10(4): 599-625 (1997) - [c8]Mirela Damian-Iordache, Sriram V. Pemmaraju:
Automatic Data Decomposition for Message-Passing Machines. LCPC 1997: 64-78 - [c7]Sukumar Ghosh, Sriram V. Pemmaraju:
Trade-offs in Fault-Containing Self-Stabilization. PODC 1997: 289 - [c6]Sukumar Ghosh, Arobinda Gupta, Sriram V. Pemmaraju:
Fault-containing network protocols. SAC 1997: 431-437 - [c5]Sukumar Ghosh, Sriram V. Pemmaraju:
Tradeoffs in fault-containing self-stabilization. WSS 1997: 157-169 - 1996
- [c4]Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju:
Fault-Containing Self-Stabilizing Algorithms. PODC 1996: 45-54 - 1995
- [c3]Lenwood S. Heath, Sriram V. Pemmaraju:
Recognizing Leveled-Planar Dags in Linear Time. GD 1995: 300-311 - 1994
- [j2]Lenwood S. Heath, Sriram V. Pemmaraju:
New Results for the Minimum Weight Triangulation Problem. Algorithmica 12(6): 533-552 (1994) - [j1]Sriram V. Pemmaraju, Clifford A. Shaffer:
Analysis of the Worst Case Space Complexity of a PR Quadtree. Inf. Process. Lett. 49(5): 263-267 (1994) - [c2]Mehmet Hakan Karaata, Sriram V. Pemmaraju, Steven C. Bruell, Sukumar Ghosh:
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees. PODC 1994: 374 - 1991
- [c1]Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk:
Stack and Queue Layouts of Directed Planar Graphs. Planar Graphs 1991: 5-11
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
