N. Variyam Vinodchandran

12 papers A* 2A 2Journal 7Unranked 1

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	A Scalable $t$t-Wise Coverage Estimator: Algorithms and Applications. IEEE Trans. Software Eng. Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran
2023	J	`jnl`	Model Counting Meets ACM Trans. Database Syst. A. Pavan, N. Variyam Vinodchandran, Arnab Bhattacharyya, Kuldeep S. Meel
2022	A*	`conf`	A Scalable t-wise Coverage Estimator. ICSE Eduard Baranov, Sourav Chakraborty, Axel Legay, Kuldeep S. Meel, N. Variyam Vinodchandran
2022	A	`conf`	Efficient interventional distribution learning in the PAC framework. AISTATS Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Vedant Raval, N. Variyam Vinodchandran
2020	A*	`conf`	Learning and Sampling of Atomic Interventions from Observations. ICML Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, Ashwin Maran, N. Variyam Vinodchandran
2014	J	`jnl`	New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. Variyam Vinodchandran, Lin F. Yang
2014	J	`jnl`	Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs. Electron. Colloquium Comput. Complex. N. Variyam Vinodchandran
2011	J	`jnl`	Kolmogorov Complexity in Randomness Extraction. ACM Trans. Comput. Theory John M. Hitchcock, Aduri Pavan, N. Variyam Vinodchandran
2011	A	`conf`	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran
2008	J	`jnl`	An efficient and attack-resistant key agreement scheme for secure group communications in mobile ad-hoc networks. Wirel. Commun. Mob. Comput. Ravi K. Balachandran, Xukai Zou, Byrav Ramamurthy, Amandeep Thukral, N. Variyam Vinodchandran
2005	—	`conf`	CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks. ICC Ravi K. Balachandran, Byrav Ramamurthy, Xukai Zou, N. Variyam Vinodchandran
2005	J	`jnl`	Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games. Int. J. Found. Comput. Sci. N. Variyam Vinodchandran

Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz