Yadu Vasudev

Orcid: 0000-0001-7918-7194

Affiliations:
  • Institute of Mathematical Sciences, Chennai, India


According to our database1, Yadu Vasudev authored at least 18 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
Testing Properties of Distributions in the Streaming Model.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Byzantine Connectivity Testing in the Congested Clique.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

2021
Dynamic Complexity of Expansion.
Proceedings of the Computer Science - Theory and Applications, 2021

2019
Fast distributed algorithms for testing graph properties.
Distributed Comput., 2019

Improving and Extending the Testing of Distributions for Shape-Restricted Properties.
Algorithmica, 2019

2018
Expanding Generating Sets for Solvable Permutation Groups.
SIAM J. Discret. Math., 2018

A Two-Sided Error Distributed Property Tester For Conductance.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Distributed Testing of Conductance.
CoRR, 2017

On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error.
CoRR, 2017

2015
On the isomorphism problem for decision trees and decision lists.
Theor. Comput. Sci., 2015

Trading query complexity for sample-based testing and multi-testing scalability}.
Electron. Colloquium Comput. Complex., 2015

2012
Approximate Graph Isomorphism.
Electron. Colloquium Comput. Complex., 2012

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
CoRR, 2012

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits.
Electron. Colloquium Comput. Complex., 2011

Expanding Generator Sets for Solvable Permutation Groups.
Electron. Colloquium Comput. Complex., 2011


  Loading...