#### Filter Results:

#### Publication Year

2011

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We initiate a thorough study of distributed property testing – producing algorithms for the approximation problems of property testing in the CONGEST model. In particular, for the so-called dense graph testing model we emulate sequential tests for nearly all graph properties having 1-sided tests, while in the general and sparse models we obtain faster tests… (More)

- Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev
- Electronic Colloquium on Computational Complexity
- 2012

We study optimization versions of Graph Isomorphism. Given two graphs G1, G2, we are interested in finding a bijection π from V (G1) to V (G2) that maximizes the number of matches (edges mapped to edges or non-edges mapped to non-edges). We give an n O(log n) time approximation scheme that for any constant factor α < 1, computes an α-approximation. We prove… (More)

- Eldar Fischer, Oded Lachish, Yadu Vasudev
- 2015 IEEE 56th Annual Symposium on Foundations of…
- 2015

We show that every non-adaptive property testing algorithm making a constant number of queries, over a fixed alphabet, can be converted to a sample-based (as per [Gold Reich and Ron, 2015]) testing algorithm whose average number of queries is a fixed, smaller than 1, power of n. Since the query distribution of the sample-based algorithm is not dependent at… (More)

- Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
- Electronic Colloquium on Computational Complexity
- 2011

Let G = S be a solvable permutation group given as input by the generating set S. I.e. G is a solvable subgroup of the symmetric group S n. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size O(n 2) for G. More precisely, given a λ < 1, we can compute a subset T ⊂ G of size O(n 2) 1 λ O(1) such that the… (More)

- Eldar Fischer, Oded Lachish, Yadu Vasudev
- STACS
- 2017

Distribution testing deals with what information can be deduced about an unknown distribution over {1,. .. , n}, where the algorithm is only allowed to obtain a relatively small number of independent samples from the distribution. In the extended conditional sampling model, the algorithm is also allowed to obtain samples from the restriction of the original… (More)

- Ritika Sharma, Kamlesh Gupta, +13 authors Rahul Rishi
- 2013

The transmission of information in a MANET relies on the performance of the traffic scenario (application traffic agent and data traffic) used in a network. The traffic scenario determines the reliability and capability of information transmission, which necessitates its performance analysis. The objective of this paper is to compare the performance of… (More)

We study the complexity of isomorphism testing for boolean functions that are represented by decision trees or decision lists. Our results are the following: • Isomorphism testing of rank 1 decision trees is complete for logspace. • For any constant r ≥ 2, isomorphism testing for rank r decision trees is polynomial-time equivalent to Graph Isomorphism. As a… (More)

Let G = S be a solvable permutation group of the symmetric group S n given as input by the generating set S. We give a deterministic polynomial-time algorithm that computes an expanding generating set of size O(n 2) for G. More precisely, the algorithm computes a subset T ⊂ G of size O(n 2)(1/λ) O(1) such that the undirected Cayley graph Cay(G, T) is a… (More)

- Yadu Vasudev
- 2012

In this lecture, we look at Yannakakis'[Yan91] approach to relating the minimum size of LPs for polytopes to a combinatorial parameter and some connections to communication complexity. The flavor of a combinatorial optimization problem is to maximize an objective function over a set of valid points. In the case of TSP, the valid set of points S ⊆ {0, 1} (n… (More)

Let G = S be a solvable subgroup of the symmetric group Sn given as input by the generator set S. We give a deterministic polynomial-time algorithm that computes an expanding generator set of size O(n 2) for G. As a byproduct of our proof, we obtain a new explicit construction of ε-bias spaces of size O(n poly(log d))(1 ε) O(1) for the groups Z n d .