| Qip= pspace R Jain, Z Ji, S Upadhyay, J Watrous Communications of the ACM 53 (12), 102-109, 2010 | 197 | 2010 |
| Perfect parallel repetition theorem for quantum XOR proof systems R Cleve, W Slofstra, F Unger, S Upadhyay Computational Complexity 17, 282-299, 2008 | 135 | 2008 |
| Two-message quantum interactive proofs are in PSPACE R Jain, S Upadhyay, J Watrous 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 534-543, 2009 | 70 | 2009 |
| Compressed Quadratization of Higher Order Binary Optimization Problems A Mandal, A Roy, S Upadhyay, H Ushijima-Mwesigwa arXiv preprint arXiv:2001.00658, 2020 | 19 | 2020 |
| QMA variants with polynomially many provers S Gharibian, J Sikora, S Upadhyay arXiv preprint arXiv:1108.0617, 2011 | 17 | 2011 |
| Almost tight error bounds on differentially private continual counting M Henzinger, J Upadhyay, S Upadhyay Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 11 | 2023 |
| A framework for private matrix analysis in sliding window model J Upadhyay, S Upadhyay International Conference on Machine Learning, 10465-10475, 2021 | 11 | 2021 |
| On modeling local search with special-purpose combinatorial optimization hardware X Liu, H Ushijima-Mwesigwa, A Mandal, S Upadhyay, I Safro, A Roy arXiv preprint arXiv:1911.09810, 2019 | 11 | 2019 |
| Differentially private analysis on graph streams J Upadhyay, S Upadhyay, R Arora International Conference on Artificial Intelligence and Statistics, 1171-1179, 2021 | 10 | 2021 |
| Leveraging special-purpose hardware for local search heuristics X Liu, H Ushijima-Mwesigwa, A Mandal, S Upadhyay, I Safro, A Roy Computational Optimization and Applications 82 (1), 1-29, 2022 | 6 | 2022 |
| Heuristic methods for converting higher order to quadratic polynomials in binary spaces A Mandal, A Roy, S Upadhyay, H Ushijima-mwesigwa US Patent App. 16/452,342, 2020 | 2 | 2020 |
| A framework for private matrix analysis J Upadhyay, S Upadhyay arXiv preprint arXiv:2009.02668, 2020 | 2 | 2020 |
| Solving quadratic integer programming (QIP) problems on optimization solver machines A Mandal, A Roy, S Upadhyay, H Ushijima-mwesigwa US Patent 11,693,916, 2023 | 1 | 2023 |
| Scheduling operations A Mandal, S Upadhyay US Patent 11,231,961, 2022 | 1 | 2022 |
| Quantum Information and Variants of Interactive Proof Systems S Upadhyay University of Waterloo, 2011 | 1 | 2011 |
| A Unifying Framework for Differentially Private Sums under Continual Observation M Henzinger, J Upadhyay, S Upadhyay arXiv preprint arXiv:2307.08970, 2023 | | 2023 |
| Local search with global view for large scale combinatorial optimization A Mandal, A Roy, S Upadhyay, H Ushijima-mwesigwa, X Liu US Patent 11,625,451, 2023 | | 2023 |
| Data summarization for training machine learning models L Angus, S Upadhyay US Patent App. 17/322,467, 2022 | | 2022 |
| Solving integer linear programming problems on optimization solver machines A Mandal, A Roy, S Upadhyay, H Ushijima-mwesigwa US Patent App. 17/248,629, 2022 | | 2022 |
| Using lattice reduction and optimization solvers for solving multi-dimensional knapsack problems and variants thereof A Mandal, A Roy, S Upadhyay, H Ushijima US Patent App. 17/248,198, 2022 | | 2022 |
John WatrousIBM QuantumVerified email at ibm.com
