default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKanthi K. Sarpatwar
Person information
- affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA
- affiliation (former): University of Maryland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Kanthi K. Sarpatwar
, Baruch Schieber, Hadas Shachnai:
The preemptive resource allocation problem. J. Sched. 27(1): 103-118 (2024)- 2023
- [c20]Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi K. Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculín:
Efficient Pruning for Machine Learning Under Homomorphic Encryption. ESORICS (4) 2023: 204-225 - [c19]Giridhar Ganapavarapu, Sumanta Mukherjee, Natalia Martinez Gil, Kanthi K. Sarpatwar, Amaresh Rajasekharan, Amit Dhurandhar, Vijay Arya, Roman Vaculín:
AI Explainability 360 Toolkit for Time-Series and Industrial Use Cases. KDD 2023: 5777-5778 - [i10]Vikas C. Raykar, Arindam Jati, Sumanta Mukherjee, Nupur Aggarwal, Kanthi K. Sarpatwar, Giridhar Ganapavarapu, Roman Vaculín:
TsSHAP: Robust model agnostic feature-based explainability for time series forecasting. CoRR abs/2303.12316 (2023) - 2022
- [c18]Sumanta Mukherjee, Arindam Jati, Kanthi K. Sarpatwar, Roman Vaculín:
Physics-based multiple time-series univariate forecasting. IEEE Big Data 2022: 1054-1059 - [i9]Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi K. Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculín:
HE-PEx: Efficient Machine Learning under Homomorphic Encryption using Pruning, Permutation and Expansion. CoRR abs/2207.03384 (2022) - 2021
- [i8]Kanthi K. Sarpatwar, Karthik Nandakumar, Nalini K. Ratha, James T. Rayfield, Karthikeyan Shanmugam, Sharath Pankanti, Roman Vaculín:
Efficient Encrypted Inference on Ensembles of Decision Trees. CoRR abs/2103.03411 (2021) - 2020
- [j7]Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems. SIAM J. Discret. Math. 34(1): 251-270 (2020) - [j6]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. 814: 74-85 (2020) - [c17]Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM 2020: 48:1-48:18 - [c16]Kanthi K. Sarpatwar, Nalini K. Ratha, Karthik Nandakumar, Karthikeyan Shanmugam, James T. Rayfield, Sharath Pankanti, Roman Vaculín:
Privacy Enhanced Decision Tree Inference. CVPR Workshops 2020: 154-159
2010 – 2019
- 2019
- [j5]Donna Dillenberger, Petr Novotný, Q. Zhang, Praveen Jayachandran, H. Gupta, Sandeep Hans, Dinesh C. Verma, Shreya Chakraborty, J. J. Thomas, M. M. Walli, Roman Vaculín, Kanthi K. Sarpatwar:
Blockchain analytics and artificial intelligence. IBM J. Res. Dev. 63(2/3): 5:1-5:14 (2019) - [j4]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained submodular maximization via greedy local search. Oper. Res. Lett. 47(1): 1-6 (2019) - [c15]John P. Dickerson, Karthik Abinav Sankararaman, Kanthi Kiran Sarpatwar, Aravind Srinivasan, Kun-Lung Wu, Pan Xu:
Online Resource Allocation with Matching Constraints. AAMAS 2019: 1681-1689 - [c14]Kanthi K. Sarpatwar, Venkata Sitaramagiridharganesh Ganapavarapu, Karthikeyan Shanmugam, Akond Rahman, Roman Vaculín:
Blockchain Enabled AI Marketplace: The Price You Pay for Trust. CVPR Workshops 2019: 2857-2866 - [c13]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA 2019: 69:1-69:15 - [c12]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. FSTTCS 2019: 26:1-26:15 - [c11]Kanthi K. Sarpatwar, Karthikeyan Shanmugam, Venkata Sitaramagiridharganesh Ganapavarapu, Ashish Jagmohan, Roman Vaculín:
Differentially Private Distributed Data Summarization under Covariate Shift. NeurIPS 2019: 14432-14442 - [i7]Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR abs/1907.01745 (2019) - [i6]Kanthi K. Sarpatwar, Karthikeyan Shanmugam, Venkata Sitaramagiridharganesh Ganapavarapu, Ashish Jagmohan, Roman Vaculín:
Differentially Private Distributed Data Summarization under Covariate Shift. CoRR abs/1910.12832 (2019) - 2018
- [j3]Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar:
On maximum leaf trees and connections to connected maximum cut problems. Inf. Process. Lett. 129: 31-34 (2018) - [c10]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM 2018: 24:1-24:18 - [c9]Kanthi K. Sarpatwar, Roman Vaculín, Hong Min, Gong Su, Terry Heath, Giridhar Ganapavarapu, Donna Dillenberger:
Towards Enabling Trusted Artificial Intelligence via Blockchain. PADG@ESORICS 2018: 137-153 - [c8]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA 2018: 343-345 - [i5]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
The Preemptive Resource Allocation Problem. CoRR abs/1811.07413 (2018) - 2017
- [c7]Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu:
Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. AAMAS 2017: 1763-1765 - [i4]Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai:
Constrained Submodular Maximization via Greedy Local Search. CoRR abs/1705.06319 (2017) - 2016
- [j2]Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. Algorithmica 74(3): 969-991 (2016) - 2015
- [b1]Kanthi K. Sarpatwar:
Allocation Algorithms for Networks with Scarce Resources. University of Maryland, College Park, MD, USA, 2015 - [c6]Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf:
The Container Selection Problem. APPROX-RANDOM 2015: 416-434 - [c5]Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. ESA 2015: 693-704 - [i3]MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar:
Approximation Algorithms for Connected Maximum Cut and Related Problems. CoRR abs/1507.00648 (2015) - 2014
- [c4]Joel L. Wolf, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Rohit Wagle, Kirsten Hildrum, Edward Pring, Kanthi K. Sarpatwar:
The X-flex cross-platform scheduler: who's the fairest of them all? Middleware (Industry Track) 2014: 1:1-1:7 - [c3]Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. SODA 2014: 1702-1713 - 2013
- [i2]Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar:
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. CoRR abs/1311.2309 (2013) - 2012
- [c2]Samir Khuller, Barna Saha, Kanthi K. Sarpatwar:
New Approximation Results for Resource Replication Problems. APPROX-RANDOM 2012: 218-230 - 2011
- [j1]S. Kanthi Kiran, N. S. Narayanaswamy:
Hardness of subgraph and supergraph problems in c-tournaments. Theor. Comput. Sci. 412(35): 4629-4635 (2011) - [c1]Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar:
Rainbow Connectivity: Hardness and Tractability. FSTTCS 2011: 241-251 - [i1]Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar:
Hardness and Parameterized Algorithms on Rainbow Connectivity problem. CoRR abs/1105.0979 (2011)
Coauthor Index
aka: Giridhar Ganapavarapu
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-04-25 05:51 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:
