A. Pavan - RankMe

31 papers A* 4A 5B 1Journal 20Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	List Replicable Reinforcement Learning. CoRR Bohan Zhang, Michael Chen, A. Pavan, N. V. Vinodchandran, Lin F. Yang, Ruosong Wang
2025	J	`jnl`	Total variation distance for product distributions is #P-complete. Inf. Process. Lett. Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2024	J	`jnl`	Computational Explorations of Total Variation Distance. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2024	J	`jnl`	Fairness in Monotone CoRR Yanhui Zhu, Samik Basu, A. Pavan
2024	A*	`conf`	Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints. IJCAI Yanhui Zhu, Samik Basu, A. Pavan
2024	J	`jnl`	Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints. CoRR Yanhui Zhu, Samik Basu, A. Pavan
2024	A	`conf`	Regularized Unconstrained Weakly Submodular Maximization. CIKM Yanhui Zhu, Samik Basu, A. Pavan
2024	J	`jnl`	Regularized Unconstrained Weakly Submodular Maximization. CoRR Yanhui Zhu, Samik Basu, A. Pavan
2024	A*	`conf`	Total Variation Distance Meets Probabilistic Inference. ICML Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2024	J	`jnl`	Total Variation Distance for Product Distributions is #P-Complete. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2023	A	`conf`	Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. DISC Michael Chen, A. Pavan, N. V. Vinodchandran
2023	J	`jnl`	List and Certificate Complexities in Replicable Learning. CoRR Peter Dixon, A. Pavan, Jason Vander Woude, N. V. Vinodchandran
2023	J	`jnl`	Model Counting Meets ACM Trans. Database Syst. A. Pavan, N. Variyam Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2023	J	`jnl`	Model Counting Meets Distinct Elements. Commun. ACM A. Pavan, N. V. Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2023	A*	`conf`	On Approximating Total Variation Distance. IJCAI Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2023	A	`conf`	Size-constrained k-submodular maximization in near-linear time. UAI Guanyu Nie, Yanhui Zhu, Yididiya Y. Nadew, Samik Basu, A. Pavan, Christopher John Quinn
2023	J	`jnl`	Total Variation Distance Estimation Is as Easy as Probabilistic Inference. CoRR Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2023	J	`jnl`	Total Variation Distance Estimation Is as Easy as Probabilistic Inference. Electron. Colloquium Comput. Complex. Arnab Bhattacharyya, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan, N. V. Vinodchandran
2022	J	`jnl`	The Geometry of Rounding. Electron. Colloquium Comput. Complex. Jason Vander Woude, Peter Dixon, A. Pavan, Jamie Radcliffe, N. V. Vinodchandran
2021	A	`conf`	Complete Problems for Multi-Pseudodeterministic Computations. ITCS Peter Dixon, A. Pavan, N. V. Vinodchandran
2021	J	`jnl`	Measuring the impact of influence on individuals: roadmap to quantifying attitude. Soc. Netw. Anal. Min. Xiaoyun Fu, Madhavan R. Padmanabhan, Raj Gaurav Kumar, Samik Basu, Shawn F. Dorius, A. Pavan
2020	J	`jnl`	Perfect Zero Knowledge: New Upperbounds and Relativized Separations. IACR Cryptol. ePrint Arch. Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran
2019	J	`jnl`	A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Electron. Colloquium Comput. Complex. Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe
2018	B	`conf`	Improved Triangle Counting in Graph Streams: Power of Multi-Sampling. ASONAM Neeraj Kavassery-Parakkat, Kiana Mousavi Hanjani, A. Pavan
2018	—	`conf`	Influence Maximization in Social Networks With Non-Target Constraints. IEEE BigData Madhavan R. Padmanabhan, Naresh Somisetty, Samik Basu, A. Pavan
2016	J	`jnl`	Space-Efficient Estimation of Statistics Over Sub-Sampled Streams. Algorithmica Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff
2013	J	`jnl`	Counting and Sampling Triangles from a Graph Stream. Proc. VLDB Endow. A. Pavan, Kanat Tangwongsan, Srikanta Tirthapura, Kun-Lung Wu
2013	J	`jnl`	Parallel Triangle Counting in Massive Streaming Graphs. CoRR Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura
2013	A	`conf`	Parallel triangle counting in massive streaming graphs. CIKM Kanat Tangwongsan, A. Pavan, Srikanta Tirthapura
2012	A*	`conf`	Space-efficient estimation of statistics over sub-sampled streams. PODS Andrew McGregor, A. Pavan, Srikanta Tirthapura, David P. Woodruff
2007	J	`jnl`	Range-Efficient Counting of Distinct Elements in a Massive Data Stream. SIAM J. Comput. A. Pavan, Srikanta Tirthapura