| Fast distributed algorithms for testing graph properties K Censor-Hillel, E Fischer, G Schwartzman, Y Vasudev Distributed Computing 32, 41-57, 2019 | 62 | 2019 |
| Approximate graph isomorphism V Arvind, J Köbler, S Kuhnert, Y Vasudev Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 44 | 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 | 26 | 2015 |
| On testing minor-freeness in bounded degree graphs with one-sided error H Fichtenberger, R Levi, Y Vasudev, M Wötzel Unpublished manuscript, 2017 | 12 | 2017 |
| A two-sided error distributed property tester for conductance H Fichtenberger, Y Vasudev 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 8 | 2018 |
| 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 | 8 | 2017 |
| Improving and extending the testing of distributions for shape-restricted properties E Fisher, O Lachish, Y Vasudev Leibniz International, 2017 | 7 | 2017 |
| Improving and extending the testing of distributions for shape-restricted properties E Fischer, O Lachish, Y Vasudev Algorithmica 81, 3765-3802, 2019 | 6 | 2019 |
| 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 | 6 | 2015 |
| Isomorphism testing of Boolean functions computable by constant-depth circuits V Arvind, Y Vasudev Information and Computation 239, 3-12, 2014 | 6 | 2014 |
| Byzantine Connectivity Testing in the Congested Clique J Augustine, AR Molla, G Pandurangan, Y Vasudev Leibniz international proceedings in informatics, 2022 | 4 | 2022 |
| 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 |
| Testing properties of distributions in the streaming model S Roy, Y Vasudev arXiv preprint arXiv:2309.03245, 2023 | 2 | 2023 |
| The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem V Arvind, S Datta, A Khan, S Sharma, Y Vasudev, SR Vasudevan arXiv preprint arXiv:2308.10073, 2023 | 1 | 2023 |
| Dynamic Complexity of Expansion S Datta, A Tawari, Y Vasudev Computer Science–Theory and Applications: 16th International Computer …, 2021 | 1 | 2021 |
| 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 | 1 | 2018 |
| Dynamic Complexity of Group Problems S Datta, A Khan, S Sharma, Y Vasudev, SR Vasudevan arXiv preprint arXiv:2206.00371, 2022 | | 2022 |
| 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017) J Kontinen, A Jez, A Joux, T Tantau, A Agrawal, D Lokshtanov, S Saurabh, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | | 2017 |
| The Complexity of some exact and approximate isomorphism problems [HBNI Th80] Y Vasudev The Institute of Mathematical Sciences, 2014 | | 2014 |
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaDirección de correo verificada de imsc.res.in
