Kanthi K. Sarpatwar

Orcid: 0000-0002-7737-1200

Affiliations:
  • IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA
  • University of Maryland (former)


According to our database1, Kanthi K. Sarpatwar authored at least 30 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The preemptive resource allocation problem.
J. Sched., February, 2024

2023
TsSHAP: Robust model agnostic feature-based explainability for time series forecasting.
CoRR, 2023

AI Explainability 360 Toolkit for Time-Series and Industrial Use Cases.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

Efficient Pruning for Machine Learning Under Homomorphic Encryption.
Proceedings of the Computer Security - ESORICS 2023, 2023

2022
HE-PEx: Efficient Machine Learning under Homomorphic Encryption using Pruning, Permutation and Expansion.
CoRR, 2022

Physics-based multiple time-series univariate forecasting.
Proceedings of the IEEE International Conference on Big Data, 2022

2021
Efficient Encrypted Inference on Ensembles of Decision Trees.
CoRR, 2021

2020
Approximation algorithms for connected maximum cut and related problems.
Theor. Comput. Sci., 2020

Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems.
SIAM J. Discret. Math., 2020

Privacy Enhanced Decision Tree Inference.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

Maximizing Throughput in Flow Shop Real-Time Scheduling.
Proceedings of the Approximation, 2020

2019
Constrained submodular maximization via greedy local search.
Oper. Res. Lett., 2019

Blockchain analytics and artificial intelligence.
IBM J. Res. Dev., 2019

Differentially Private Distributed Data Summarization under Covariate Shift.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Generalized Assignment via Submodular Optimization with Reserved Capacity.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Blockchain Enabled AI Marketplace: The Price You Pay for Trust.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2019

Online Resource Allocation with Matching Constraints.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
On maximum leaf trees and connections to connected maximum cut problems.
Inf. Process. Lett., 2018

Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation.
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Towards Enabling Trusted Artificial Intelligence via Blockchain.
Proceedings of the Policy-Based Autonomic Data Governance [extended papers from the Second International Workshop on Policy-based Autonomic Data Governance, 2018

Generalized Assignment of Time-Sensitive Item Groups.
Proceedings of the Approximation, 2018

2017
Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
New Approximation Results for Resource Replication Problems.
Algorithmica, 2016

2015
Allocation Algorithms for Networks with Scarce Resources.
PhD thesis, 2015

The Container Selection Problem.
Proceedings of the Approximation, 2015

2014
Analyzing the Optimal Neighborhood: Algorithms for Budgeted and Partial Connected Dominating Set Problems.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

The X-flex cross-platform scheduler: who's the fairest of them all?
Proceedings of the Middleware Industry Track, Bordeaux, France, December 8-12, 2014, 2014

2011
Hardness of subgraph and supergraph problems in c-tournaments.
Theor. Comput. Sci., 2011

Hardness and Parameterized Algorithms on Rainbow Connectivity problem
CoRR, 2011

Rainbow Connectivity: Hardness and Tractability.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011


  Loading...