default search action
Yadu Vasudev
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan:
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. FSTTCS 2024: 4:1-4:23 - 2023
- [c12]Sampriti Roy, Yadu Vasudev:
Testing Properties of Distributions in the Streaming Model. ISAAC 2023: 56:1-56:17 - [i13]Vikraman Arvind, Samir Datta, Asif Khan
, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan:
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. CoRR abs/2308.10073 (2023) - [i12]Sampriti Roy, Yadu Vasudev:
Testing properties of distributions in the streaming model. CoRR abs/2309.03245 (2023) - 2022
- [c11]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev:
Byzantine Connectivity Testing in the Congested Clique. DISC 2022: 7:1-7:21 - 2021
- [c10]Samir Datta
Dynamic Complexity of Expansion. CSR 2021: 56-77 - 2020
- [i11]Samir Datta, Anuj Tawari, Yadu Vasudev:
Dynamic Complexity of Expansion. CoRR abs/2008.05728 (2020)
2010 – 2019
- 2019
- [j5]Eldar Fischer, Oded Lachish
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. Algorithmica 81(9): 3765-3802 (2019) - [j4]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast distributed algorithms for testing graph properties. Distributed Comput. 32(1): 41-57 (2019) - 2018
- [j3]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. 32(3): 1721-1740 (2018) - [c9]Hendrik Fichtenberger
A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error. ICALP 2018: 52:1-52:14 - [c8]Hendrik Fichtenberger
A Two-Sided Error Distributed Property Tester For Conductance. MFCS 2018: 19:1-19:15 - 2017
- [c7]Eldar Fischer, Oded Lachish
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. STACS 2017: 31:1-31:14 - [i10]Hendrik Fichtenberger
Distributed Testing of Conductance. CoRR abs/1705.08174 (2017) - [i9]Hendrik Fichtenberger
On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error. CoRR abs/1707.06126 (2017) - 2016
- [c6]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev
Fast Distributed Algorithms for Testing Graph Properties. DISC 2016: 43-56 - [i8]Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev:
Fast Distributed Algorithms for Testing Graph Properties. CoRR abs/1602.03718 (2016) - [i7]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and extending the testing of distributions for shape-restricted properties. CoRR abs/1609.06736 (2016) - 2015
- [j2]Vikraman Arvind, Johannes Köbler
On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. 590: 38-54 (2015) - [c5]Eldar Fischer, Oded Lachish
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability. FOCS 2015: 1163-1182 - [i6]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability. CoRR abs/1504.00695 (2015) - [i5]Eldar Fischer, Oded Lachish, Yadu Vasudev:
Trading query complexity for sample-based testing and multi-testing scalability}. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j1]Vikraman Arvind, Yadu Vasudev
Isomorphism testing of Boolean functions computable by constant-depth circuits. Inf. Comput. 239: 3-12 (2014) - 2013
- [c4]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
On the Isomorphism Problem for Decision Trees and Decision Lists. FCT 2013: 16-27 - 2012
- [c3]Vikraman Arvind, Yadu Vasudev
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. LATA 2012: 83-94 - [c2]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert
Approximate Graph Isomorphism. MFCS 2012: 100-111 - [c1]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. MFCS 2012: 112-123 - [i4]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups. CoRR abs/1201.3181 (2012) - [i3]Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev:
Approximate Graph Isomorphism. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i2]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generator Sets for Solvable Permutation Groups. Electron. Colloquium Comput. Complex. TR11 (2011) - [i1]Vikraman Arvind, Yadu Vasudev:
Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits. Electron. Colloquium Comput. Complex. TR11 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: