Kanthi K. Sarpatwar

37 papers A* 3A 3B 2Journal 17Unranked 11

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	The preemptive resource allocation problem. J. Sched. Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2023	A*	`conf`	AI Explainability 360 Toolkit for Time-Series and Industrial Use Cases. KDD Giridhar Ganapavarapu, Sumanta Mukherjee, Natalia Martinez Gil, Kanthi K. Sarpatwar, Amaresh Rajasekharan, Amit Dhurandhar, Vijay Arya, Roman Vaculín
2023	—	`conf`	Efficient Pruning for Machine Learning Under Homomorphic Encryption. ESORICS (4) Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi K. Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculín
2023	J	`jnl`	TsSHAP: Robust model agnostic feature-based explainability for time series forecasting. CoRR Vikas C. Raykar, Arindam Jati, Sumanta Mukherjee, Nupur Aggarwal, Kanthi K. Sarpatwar, Giridhar Ganapavarapu, Roman Vaculín
2022	J	`jnl`	HE-PEx: Efficient Machine Learning under Homomorphic Encryption using Pruning, Permutation and Expansion. CoRR Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi K. Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculín
2022	B	`conf`	Physics-based multiple time-series univariate forecasting. IEEE Big Data Sumanta Mukherjee, Arindam Jati, Kanthi K. Sarpatwar, Roman Vaculín
2021	J	`jnl`	Efficient Encrypted Inference on Ensembles of Decision Trees. CoRR Kanthi K. Sarpatwar, Karthik Nandakumar, Nalini K. Ratha, James T. Rayfield, Karthikeyan Shanmugam, Sharath Pankanti, Roman Vaculín
2020	J	`jnl`	Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems. SIAM J. Discret. Math. Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
2020	J	`jnl`	Approximation algorithms for connected maximum cut and related problems. Theor. Comput. Sci. MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
2020	—	`conf`	Maximizing Throughput in Flow Shop Real-Time Scheduling. APPROX-RANDOM Lior Ben Yamin, Jing Li, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2020	—	`conf`	Privacy Enhanced Decision Tree Inference. CVPR Workshops Kanthi K. Sarpatwar, Nalini K. Ratha, Karthik Nandakumar, Karthikeyan Shanmugam, James T. Rayfield, Sharath Pankanti, Roman Vaculín
2019	—	`conf`	Blockchain Enabled AI Marketplace: The Price You Pay for Trust. CVPR Workshops Kanthi K. Sarpatwar, Venkata Sitaramagiridharganesh Ganapavarapu, Karthikeyan Shanmugam, Akond Rahman, Roman Vaculín
2019	J	`jnl`	Blockchain analytics and artificial intelligence. IBM J. Res. Dev. Donna Dillenberger, Petr Novotný, Q. Zhang, Praveen Jayachandran, Himanshu Gupta, Sandeep Hans, Dinesh C. Verma, Shreya Chakraborty, J. J. Thomas, M. M. Walli, Roman Vaculín, Kanthi K. Sarpatwar
2019	J	`jnl`	Constrained submodular maximization via greedy local search. Oper. Res. Lett. Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	A*	`conf`	Differentially Private Distributed Data Summarization under Covariate Shift. NeurIPS Kanthi K. Sarpatwar, Karthikeyan Shanmugam, Venkata Sitaramagiridharganesh Ganapavarapu, Ashish Jagmohan, Roman Vaculín
2019	J	`jnl`	Differentially Private Distributed Data Summarization under Covariate Shift. CoRR Kanthi K. Sarpatwar, Karthikeyan Shanmugam, Venkata Sitaramagiridharganesh Ganapavarapu, Ashish Jagmohan, Roman Vaculín
2019	A	`conf`	Generalized Assignment via Submodular Optimization with Reserved Capacity. ESA Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	J	`jnl`	Generalized Assignment via Submodular Optimization with Reserved Capacity. CoRR Ariel Kulik, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2019	—	`conf`	The Preemptive Resource Allocation Problem. FSTTCS Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	B	`conf`	Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation. SPAA Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	—	`conf`	Generalized Assignment of Time-Sensitive Item Groups. APPROX-RANDOM Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	J	`jnl`	On maximum leaf trees and connections to connected maximum cut problems. Inf. Process. Lett. Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar
2018	J	`jnl`	The Preemptive Resource Allocation Problem. CoRR Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2018	—	`conf`	Towards Enabling Trusted Artificial Intelligence via Blockchain. PADG@ESORICS Kanthi K. Sarpatwar, Roman Vaculín, Hong Min, Gong Su, Terry Heath, Giridhar Ganapavarapu, Donna Dillenberger
2017	A	`conf`	Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. AAMAS Pan Xu, Aravind Srinivasan, Kanthi K. Sarpatwar, Kun-Lung Wu
2017	J	`jnl`	Constrained Submodular Maximization via Greedy Local Search. CoRR Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai
2016	J	`jnl`	New Approximation Results for Resource Replication Problems. Algorithmica Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
2015	—	`—`	Allocation Algorithms for Networks with Scarce Resources. Kanthi K. Sarpatwar
2015	A	`conf`	Approximation Algorithms for Connected Maximum Cut and Related Problems. ESA Mohammad Taghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
2015	J	`jnl`	Approximation Algorithms for Connected Maximum Cut and Related Problems. CoRR MohammadTaghi Hajiaghayi, Guy Kortsarz, Robert MacDavid, Manish Purohit, Kanthi K. Sarpatwar
2015	—	`conf`	The Container Selection Problem. APPROX-RANDOM Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf
2014	A*	`conf`	Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. SODA Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
2014	—	`conf`	The X-flex cross-platform scheduler: who's the fairest of them all? Middleware (Industry Track) Joel L. Wolf, Zubair Nabi, Viswanath Nagarajan, Robert Saccone, Rohit Wagle, Kirsten Hildrum, Edward Pring, Kanthi K. Sarpatwar
2013	J	`jnl`	Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems. CoRR Samir Khuller, Manish Purohit, Kanthi K. Sarpatwar
2012	—	`conf`	New Approximation Results for Resource Replication Problems. APPROX-RANDOM Samir Khuller, Barna Saha, Kanthi K. Sarpatwar
2011	J	`jnl`	Hardness and Parameterized Algorithms on Rainbow Connectivity problem CoRR Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar
2011	—	`conf`	Rainbow Connectivity: Hardness and Tractability. FSTTCS Prabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar