Yadu Vasudev - RankMe

32 papers A* 2A 3B 5C 1Misc 1Journal 18Unranked 2

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Tolerant Testing and Distance Estimation for Distributions Under Memory Constraints. SOFSEM (2) Sampriti Roy, Yadu Vasudev
2024	—	`conf`	The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. FSTTCS Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
2023	B	`conf`	Testing Properties of Distributions in the Streaming Model. ISAAC Sampriti Roy, Yadu Vasudev
2023	J	`jnl`	Testing properties of distributions in the streaming model. CoRR Sampriti Roy, Yadu Vasudev
2023	J	`jnl`	The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. CoRR Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
2022	A	`conf`	Byzantine Connectivity Testing in the Congested Clique. DISC John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev
2021	Misc	`conf`	Dynamic Complexity of Expansion. CSR Samir Datta, Anuj Tawari, Yadu Vasudev
2020	J	`jnl`	Dynamic Complexity of Expansion. CoRR Samir Datta, Anuj Tawari, Yadu Vasudev
2019	J	`jnl`	Fast distributed algorithms for testing graph properties. Distributed Comput. Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
2019	J	`jnl`	Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica Eldar Fischer, Oded Lachish, Yadu Vasudev
2018	A*	`conf`	A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. ICALP Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel
2018	B	`conf`	A Two-Sided Error Distributed Property Tester For Conductance. MFCS Hendrik Fichtenberger, Yadu Vasudev
2018	J	`jnl`	Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2017	J	`jnl`	Distributed Testing of Conductance. CoRR Hendrik Fichtenberger, Yadu Vasudev
2017	A	`conf`	Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS Eldar Fischer, Oded Lachish, Yadu Vasudev
2017	J	`jnl`	On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. CoRR Hendrik Fichtenberger, Reut Levi, Yadu Vasudev, Maximilian Wötzel
2016	A	`conf`	Fast Distributed Algorithms for Testing Graph Properties. DISC Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
2016	J	`jnl`	Fast Distributed Algorithms for Testing Graph Properties. CoRR Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
2016	J	`jnl`	Improving and extending the testing of distributions for shape-restricted properties. CoRR Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
2015	A*	`conf`	Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	Trading query complexity for sample-based testing and multi-testing scalability. CoRR Eldar Fischer, Oded Lachish, Yadu Vasudev
2015	J	`jnl`	Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. Eldar Fischer, Oded Lachish, Yadu Vasudev
2014	J	`jnl`	Isomorphism testing of Boolean functions computable by constant-depth circuits. Inf. Comput. Vikraman Arvind, Yadu Vasudev
2013	B	`conf`	On the Isomorphism Problem for Decision Trees and Decision Lists. FCT Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
2012	B	`conf`	Approximate Graph Isomorphism. MFCS Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev
2012	J	`jnl`	Approximate Graph Isomorphism. Electron. Colloquium Comput. Complex. Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev
2012	C	`conf`	Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. LATA Vikraman Arvind, Yadu Vasudev
2012	J	`jnl`	Near-Optimal Expanding Generating Sets for Solvable Permutation Groups CoRR Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2012	B	`conf`	Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. MFCS Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2011	J	`jnl`	Expanding Generator Sets for Solvable Permutation Groups. Electron. Colloquium Comput. Complex. Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2011	J	`jnl`	Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits. Electron. Colloquium Comput. Complex. Vikraman Arvind, Yadu Vasudev