Fast distributed algorithms for testing graph properties K Censor-Hillel, E Fischer, G Schwartzman, Y Vasudev Distributed Computing 32 (1), 41-57, 2019 | 37 | 2019 |

Approximate graph isomorphism V Arvind, J Köbler, S Kuhnert, Y Vasudev International Symposium on Mathematical Foundations of Computer Science, 100-111, 2012 | 36 | 2012 |

Trading query complexity for sample-based testing and multi-testing scalability E Fischer, O Lachish, Y Vasudev 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1163-1182, 2015 | 17 | 2015 |

On testing minor-freeness in bounded degree graphs with one-sided error H Fichtenberger, R Levi, Y Vasudev, M Wötzel CoRR abs/1707.06126, 2017 | 7 | 2017 |

Improving and extending the testing of distributions for shape-restricted properties E Fisher, O Lachish, Y Vasudev Leibniz International, 2017 | 5 | 2017 |

Isomorphism testing of Boolean functions computable by constant-depth circuits V Arvind, Y Vasudev Information and Computation 239, 3-12, 2014 | 5 | 2014 |

A two-sided error distributed property tester for conductance H Fichtenberger, Y Vasudev 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 4 | 2018 |

On the isomorphism problem for decision trees and decision lists V Arvind, J Köbler, S Kuhnert, G Rattan, Y Vasudev Theoretical Computer Science 590, 38-54, 2015 | 4 | 2015 |

Improving and extending the testing of distributions for shape-restricted properties E Fischer, O Lachish, Y Vasudev Algorithmica 81 (9), 3765-3802, 2019 | 3 | 2019 |

Distributed testing of conductance H Fichtenberger, Y Vasudev arXiv preprint arXiv:1705.08174, 2017 | 3 | 2017 |

Expanding Generator Sets for Solvable Permutation Groups. V Arvind, P Mukhopadhyay, P Nimbhorkar, Y Vasudev Electronic Colloquium on Computational Complexity (ECCC) 18, 140, 2011 | 3 | 2011 |

A sublinear tester for outerplanarity (and other forbidden minors) with one-sided error H Fichtenberger, R Levi, Y Vasudev, M Wötzel arXiv preprint arXiv:1707.06126, 2017 | 2 | 2017 |

Dynamic Complexity of Expansion S Datta, A Tawari, Y Vasudev arXiv preprint arXiv:2008.05728, 2020 | | 2020 |

Expanding Generating Sets for Solvable Permutation Groups V Arvind, P Mukhopadhyay, P Nimbhorkar, Y Vasudev SIAM Journal on Discrete Mathematics 32 (3), 1721-1740, 2018 | | 2018 |

Selected papers of the 8th International Conference on Language and Automata Theory and Applications (LATA 2014) AH Dediu, C Martín-Vide, B Truthe Information and Computation 3 (253), 355-357, 2017 | | 2017 |

The Complexity of some exact and approximate isomorphism problems [HBNI Th80] Y Vasudev HBNI, 2015 | | 2015 |

Near-Optimal expanding generator sets for solvable permutation groups V Arvind, P Mukhopadhyay, P Nimbhorkar, Y Vasudev International Symposium on Mathematical Foundations of Computer Science, 112-123, 2012 | | 2012 |

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups V Arvind, P Mukhopadhyay, P Nimbhorkar, Y Vasudev arXiv preprint arXiv:1201.3181, 2012 | | 2012 |

The Partial Derivative method in Arithmetic Circuit Complexity Y Vasudev Homi Bhabha National Institute, 2010 | | 2010 |