default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrinivasan Parthasarathy 0002
Person information
- affiliation: IBM Watson Research Center
- affiliation: University of Maryland, College Park, MD, USA
Other persons with the same name
- Srinivasan Parthasarathy 0001
![[0000-0002-6062-6449]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-6062-6449")
— Ohio State University, OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c31]Sachin Ashok, Vipul Harsh, Brighten Godfrey, Radhika Mittal, Srinivasan Parthasarathy, Larisa Shwartz:
TraceWeaver: Distributed Request Tracing for Microservices Without Application Modification. SIGCOMM 2024: 828-842- [c30]Mert Toslali, Edward C. Snible, Jing Chen, Alan Cha, Sandeep Singh, Michael H. Kalantar, Srinivasan Parthasarathy:
AgraBOT: Accelerating Third-Party Security Risk Management in Enterprise Setting through Generative AI. SIGSOFT FSE Companion 2024: 74-79 - 2021
- [j14]Lisa Hellerstein, Devorah Kletenik, Srinivasan Parthasarathy:
A Tight Bound for Stochastic Submodular Cover. J. Artif. Intell. Res. 71: 347-370 (2021) - [i6]Lisa Hellerstein, Devorah Kletenik, Srinivasan Parthasarathy:
A Tight Bound for Stochastic Submodular Cover. CoRR abs/2102.01149 (2021) - 2020
- [c29]Srinivasan Parthasarathy:
Adaptive Submodular Maximization under Stochastic Item Costs. COLT 2020: 3133-3151
2010 – 2019
- 2019
- [c28]Djallel Bouneffouf, Srinivasan Parthasarathy, Horst Samulowitz, Martin Wistuba:
Optimal Exploitation of Clustering and History Information in Multi-armed Bandit. IJCAI 2019: 2016-2022 - [i5]Djallel Bouneffouf, Srinivasan Parthasarathy, Horst Samulowitz, Martin Wistuba:
Optimal Exploitation of Clustering and History Information in Multi-Armed Bandit. CoRR abs/1906.03979 (2019) - 2018
- [i4]Srinivasan Parthasarathy:
An analysis of the Greedy Algorithm for Stochastic Set Cover. CoRR abs/1803.07639 (2018) - 2017
- [j13]Çagatay Demiralp, Peter J. Haas, Srinivasan Parthasarathy, Tejaswini Pedapati:
Foresight: Recommending Visual Insights. Proc. VLDB Endow. 10(12): 1937-1940 (2017) - [c27]Yanjie Fu, Charu C. Aggarwal, Srinivasan Parthasarathy, Deepak S. Turaga, Hui Xiong:
REMIX: Automated Exploration for Interactive Outlier Detection. KDD 2017: 827-835 - [i3]Yanjie Fu, Charu C. Aggarwal, Srinivasan Parthasarathy, Deepak S. Turaga, Hui Xiong:
REMIX: Automated Exploration for Interactive Outlier Detection. CoRR abs/1705.05986 (2017) - [i2]Çagatay Demiralp, Peter J. Haas, Srinivasan Parthasarathy, Tejaswini Pedapati:
Foresight: Recommending Visual Insights. CoRR abs/1707.03877 (2017) - [i1]Çagatay Demiralp, Peter J. Haas, Srinivasan Parthasarathy, Tejaswini Pedapati:
Foresight: Rapid Data Exploration Through Guideposts. CoRR abs/1709.10513 (2017) - 2016
- [j12]Udayan Khurana, Srinivasan Parthasarathy, Deepak S. Turaga:
Graph-based Exploration of Non-graph Datasets. Proc. VLDB Endow. 9(13): 1557-1560 (2016) - [j11]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks. ACM Trans. Algorithms 12(3): 28:1-28:25 (2016) - [r2]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Minimum Weighted Completion Time. Encyclopedia of Algorithms 2016: 1328-1331 - 2015
- [c26]Fatemeh Nargesian, Alain Biem, Prateek Jain, Srinivasan Parthasarathy, Deepak S. Turaga:
SOFIA: An Analytics Recommendation System. ISWC (Posters & Demos) 2015 - 2014
- [c25]Udayan Khurana, Srinivasan Parthasarathy, Deepak S. Turaga:
READ: Rapid data Exploration, Analysis and Discovery. EDBT 2014: 612-615 - [c24]Udayan Khurana, Srinivasan Parthasarathy, Deepak S. Turaga:
FAQ: A Framework for Fast Approximate Query Processing on Temporal Data. BigMine 2014: 29-45 - [c23]Leman Akoglu, Rohit Khandekar, Vibhore Kumar, Srinivasan Parthasarathy, Deepak Rajan, Kun-Lung Wu:
Fast Nearest Neighbor Search on Large Time-Evolving Graphs. ECML/PKDD (1) 2014: 17-33 - [c22]Long H. Vu, Deepak S. Turaga, Srinivasan Parthasarathy:
Impact of DHCP churn on network characterization. SIGMETRICS 2014: 587-588 - 2013
- [j10]Guanhong Pei, Srinivasan Parthasarathy, Aravind Srinivasan, Anil Kumar S. Vullikanti:
Approximation Algorithms for Throughput Maximization in Wireless Networks With Delay Constraints. IEEE/ACM Trans. Netw. 21(6): 1988-2000 (2013) - 2012
- [j9]Minkyong Kim, Zhen Liu, Srinivasan Parthasarathy, Dimitrios E. Pendarakis, Hao Yang:
Association control algorithms for handoff frequency minimization in mobile wireless networks. Wirel. Networks 18(5): 535-550 (2012) - 2011
- [j8]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Capacity of wireless networks under SINR interference constraints. Wirel. Networks 17(7): 1605-1624 (2011) - [c21]Jing Gao, Wei Fan, Deepak S. Turaga, Srinivasan Parthasarathy, Jiawei Han:
A Spectral Framework for Detecting Inconsistency across Multi-source Object Relationships. ICDM 2011: 1050-1055 - [c20]Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthasarathy, Aravind Srinivasan:
Approximation algorithms for throughput maximization in wireless networks with delay constraints. INFOCOM 2011: 1116-1124 - 2010
- [p1]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy:
Cross-Layer Capacity Estimation and Throughput Maximization in Wireless Networks. Algorithms for Next Generation Networks 2010: 67-98
2000 – 2009
- 2009
- [j7]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Scheduling on Unrelated Machines under Tree-Like Precedence Constraints. Algorithmica 55(1): 205-226 (2009) - [j6]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
A unified approach to scheduling on unrelated parallel machines. J. ACM 56(5): 28:1-28:31 (2009) - [c19]Bo Han, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks. INFOCOM 2009: 1521-1529 - 2008
- [j5]Parijat Dube, Nagui Halim, Kyriakos Karenos, Minkyong Kim, Zhen Liu, Srinivasan Parthasarathy, Dimitrios E. Pendarakis, Hao Yang:
Harmony: Holistic messaging middleware for event-driven systems. IBM Syst. J. 47(2): 281-287 (2008) - [j4]Rajiv Gandhi, Arunesh Mishra, Srinivasan Parthasarathy:
Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16(4): 840-851 (2008) - [c18]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy:
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks. GLOBECOM 2008: 4895-4900 - [c17]Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks. INFOCOM 2008: 1148-1156 - [c16]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints. INFOCOM 2008: 1166-1174 - [c15]Minkyong Kim, Zhen Liu, Srinivasan Parthasarathy, Dimitrios E. Pendarakis, Hao Yang:
Association Control in Mobile Wireless Networks. INFOCOM 2008: 1256-1264 - [c14]Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, Hao Yang:
A generic flow algorithm for shared filter ordering problems. PODS 2008: 79-88 - [c13]Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, Hao Yang:
Near-optimal algorithms for shared filter evaluation in data stream systems. SIGMOD Conference 2008: 133-146 - [r1]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Minimum Weighted Completion Time. Encyclopedia of Algorithms 2008 - 2007
- [j3]Rajiv Gandhi, Srinivasan Parthasarathy:
Distributed algorithms for connected domination in wireless networks. J. Parallel Distributed Comput. 67(7): 848-862 (2007) - [c12]Srinivasan Parthasarathy, Rajeev Rastogi, Marina Thottan:
Efficient Design of End-to-End Probes for Source-Routed Networks. COMSWARE 2007 - [c11]Zhen Liu, Srinivasan Parthasarathy, Anand Ranganathan, Hao Yang:
Scalable event matching for overlapping subscriptions in pub/sub systems. DEBS 2007: 250-261 - [c10]Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Cross-layer latency minimization in wireless networks with SINR constraints. MobiHoc 2007: 110-119 - 2006
- [b1]Srinivasan Parthasarathy:
Resource Allocation in Networked and Distributed Environments. University of Maryland, College Park, MD, USA, 2006 - [j2]Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan:
Dependent rounding and its applications to approximation algorithms. J. ACM 53(3): 324-360 (2006) - [j1]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan, Sibylle Zust:
Provable algorithms for parallel generalized sweep scheduling. J. Parallel Distributed Comput. 66(6): 807-821 (2006) - 2005
- [c9]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints. APPROX-RANDOM 2005: 146-157 - [c8]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Approximation Algorithms for Scheduling on Multiple Machines. FOCS 2005: 254-263 - [c7]Indrajit Bhattacharya, Srinivas R. Kashyap, Srinivasan Parthasarathy:
Similarity Searching in Peer-to-Peer Databases. ICDCS 2005: 329-338 - [c6]V. S. Anil Kumar, Srinivasan Parthasarathy, Madhav V. Marathe, Aravind Srinivasan, Sibylle Zust:
Provable Algorithms for Parallel Sweep Scheduling on Unstructured Meshes. IPDPS 2005 - [c5]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
Algorithmic aspects of capacity in wireless networks. SIGMETRICS 2005: 133-144 - 2004
- [c4]Srinivasan Parthasarathy, Rajiv Gandhi:
Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks. FSTTCS 2004: 447-459 - [c3]V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan:
End-to-end packet-scheduling in wireless ad-hoc networks. SODA 2004: 1021-1030 - 2003
- [c2]Rajiv Gandhi, Srinivasan Parthasarathy, Arunesh Mishra:
Minimizing broadcast latency and redundancy in ad hoc networks. MobiHoc 2003: 222-232 - 2002
- [c1]Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, Aravind Srinivasan:
Dependent Rounding in Bipartite Graphs. FOCS 2002: 323-332
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-18 19:32 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:
