受强制性开放获取政策约束的文章 - Arun Ganesh了解详情
可在其他位置公开访问的文章：9 篇
Online service with delay
Y Azar, A Ganesh, R Ge, D Panigrahi
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
强制性开放获取政策： US National Science Foundation
Faster differentially private samplers via Rényi divergence analysis of discretized Langevin MCMC
A Ganesh, K Talwar
Advances in Neural Information Processing Systems 33, 7222-7233, 2020
强制性开放获取政策： US National Science Foundation
How compression and approximation affect efficiency in string distance measures
A Ganesh, T Kociumaka, A Lincoln, B Saha
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
强制性开放获取政策： US National Science Foundation
Universal algorithms for clustering problems
A Ganesh, BM Maggs, D Panigrahi
ACM Transactions on Algorithms 19 (2), 1-46, 2023
强制性开放获取政策： US National Science Foundation
Online service with delay
Y Azar, A Ganesh, R Ge, D Panigrahi
ACM Transactions on Algorithms (TALG) 17 (3), 1-31, 2021
强制性开放获取政策： US National Science Foundation
Optimal sequence length requirements for phylogenetic tree reconstruction with indels
A Ganesh, Q Zhang
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
强制性开放获取政策： US National Science Foundation
Universality of langevin diffusion for private optimization, with applications to sampling from rashomon sets
A Ganesh, A Thakurta, J Upadhyay
The Thirty Sixth Annual Conference on Learning Theory, 1730-1773, 2023
强制性开放获取政策： US National Science Foundation
Robust algorithms for TSP and Steiner tree
A Ganesh, BM Maggs, D Panigrahi
ACM Transactions on Algorithms 19 (2), 1-37, 2023
强制性开放获取政策： US National Science Foundation
Universal Algorithms for Clustering
B Maggs, A Ganesh
Leibniz international proceedings in informatics 198, 2021
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定