| Blockchain analytics and artificial intelligence DN Dillenberger, P Novotny, Q Zhang, P Jayachandran, H Gupta, S Hans, ... IBM Journal of Research and Development 63 (2/3), 5: 1-5: 14, 2019 | 105 | 2019 |
| Cross-platform scheduling with long-term fairness and platform-specific optimization KW Hildrum, Z Nabi, V Nagarajan, R Saccone, KK Sarpatwar, R Wagle, ... US Patent 9,886,306, 2018 | 73 | 2018 |
| Towards enabling trusted artificial intelligence via blockchain K Sarpatwar, R Vaculin, H Min, G Su, T Heath, G Ganapavarapu, ... Policy-based autonomic data governance, 137-153, 2019 | 57 | 2019 |
| Analyzing the optimal neighborhood: Algorithms for budgeted and partial connected dominating set problems S Khuller, M Purohit, KK Sarpatwar Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 48 | 2014 |
| Rainbow connectivity: Hardness and tractability P Ananth, M Nasre, KK Sarpatwar IARCS annual conference on foundations of software technology and …, 2011 | 40 | 2011 |
| Constrained submodular maximization via greedy local search KK Sarpatwar, B Schieber, H Shachnai Operations Research Letters 47 (1), 1-6, 2019 | 31* | 2019 |
| Online resource allocation with matching constraints J Dickerson, K Sankararaman, K Sarpatwar, A Srinivasan, KL Wu, P Xu International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2019 | 30 | 2019 |
| Blockchain enabled AI marketplace: the price you pay for trust K Sarpatwar, V Sitaramagiridharganesh Ganapavarapu, K Shanmugam, ... Proceedings of the IEEE/CVF conference on computer vision and pattern …, 2019 | 24 | 2019 |
| Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems S Khuller, M Purohit, KK Sarpatwar SIAM Journal on Discrete Mathematics 34 (1), 251-270, 2020 | 17 | 2020 |
| Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems S Khuller, M Purohit, KK Sarpatwar SIAM Journal on Discrete Mathematics 34 (1), 251-270, 2020 | 17 | 2020 |
| Approximation algorithms for connected maximum cut and related problems MT Hajiaghayi, G Kortsarz, R MacDavid, M Purohit, K Sarpatwar Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 16 | 2015 |
| Aggregated machine learning verification for database VS Ganapavarapu, K Sarpatwar, K Shanmugam, R Vaculin US Patent 11,694,110, 2023 | 15 | 2023 |
| Privacy enhanced decision tree inference K Sarpatwar, NK Ratha, K Nandakumar, K Shanmugam, JT Rayfield, ... Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern …, 2020 | 13 | 2020 |
| He-pex: Efficient machine learning under homomorphic encryption using pruning, permutation and expansion E Aharoni, M Baruch, P Bose, A Buyuktosunoglu, N Drucker, S Pal, ... arXiv preprint arXiv:2207.03384, 2022 | 9 | 2022 |
| Budgeted Online Assignment in Crowdsourcing Markets: Theory and Practice. P Xu, A Srinivasan, KK Sarpatwar, KL Wu AAMAS, 1763-1765, 2017 | 9 | 2017 |
| The X-flex cross-platform scheduler: who's the fairest of them all? J Wolf, Z Nabi, V Nagarajan, R Saccone, R Wagle, K Hildrum, E Pring, ... Proceedings of the Middleware Industry Track, 1-7, 2014 | 9 | 2014 |
| Efficient verification of machine learning applications VS Ganapavarapu, K Sarpatwar, K Shanmugam, R Vaculin US Patent 11,983,608, 2024 | 8 | 2024 |
| Approximation algorithms for connected maximum cut and related problems MT Hajiaghayi, G Kortsarz, R MacDavid, M Purohit, K Sarpatwar Theoretical Computer Science 814, 74-85, 2020 | 8 | 2020 |
| On maximum leaf trees and connections to connected maximum cut problems R Gandhi, MT Hajiaghayi, G Kortsarz, M Purohit, K Sarpatwar Information Processing Letters 129, 31-34, 2018 | 8 | 2018 |
| Differentially private distributed data summarization under covariate shift K Sarpatwar, K Shanmugam, VS Ganapavarapu, A Jagmohan, R Vaculin Advances in Neural Information Processing Systems 32, 2019 | 7 | 2019 |
Roman VaculinIBM Researchus.ibm.com의 이메일 확인됨