#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1995

2019

- This year (8)
- Last 5 years (21)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
- J. Comb. Optim.
- 2011

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted rc(G), is the… (More)

- Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Raphael Yuster
- STACS
- 2009

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted rc(G), is the… (More)

- Sourav Chakraborty, David García-Soriano, Arie Matsliah
- Electronic Colloquium on Computational Complexity
- 2010

We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions <i>f,g</i>: {0, 1}<sup><i>n</i></sup> → {0, 1}. Our main focus is on the most… (More)

- Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah
- SIAM J. Comput.
- 2016

- Sourav Chakraborty
- 20th Annual IEEE Conference on Computational…
- 2005

In this paper we construct a cyclically invariant Boolean function whose sensitivity is /spl Theta/(n/sup 1/3/). This result answers nvo previously published questions. Turtin (1984) asked if any… (More)

- Sourav Chakraborty, Oded Lachish
- SODA
- 2012

The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presented to an on-line… (More)

- Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni
- Electronic Colloquium on Computational Complexity
- 2013

In this paper , we study linear and quadratic Boolean functions in the context of property testing. We do this by observing that the query complexity of testing properties of linear and quadratic… (More)

- Sourav Chakraborty, Eldar Fischer, David García-Soriano, Arie Matsliah
- IEEE 27th Conference on Computational Complexity
- 2012

We make a step towards characterizing the boolean functions to which isomorphism can be efficiently tested. Specifically, we prove that isomorphism to any boolean function on {0, 1}n with a… (More)

- Sourav Chakraborty, David García-Soriano, Arie Matsliah
- ICALP
- 2011

We develop a query-efficient sample extractor for juntas, that is, a probabilistic algorithm that can simulate random samples from the core of a k-junta f : {0, 1} → {0, 1} given oracle access to a… (More)

- Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf
- FSTTCS
- 2010

We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability distributions given… (More)