Ronitt Rubinfeld
2 indexed papers
Recent (6 mo)
2With code
0Influential cites
0Benchmarked
0Publications per year
226
Top categories
Algorithms×2Complexity×1Combinatorics×1
Frequent co-authors
Research Timeline
2026
Testing Bipartiteness in Logarithmic Rounds
The authors improve the result of testing bipartiteness in bounded-degree graphs using random walks.
Graph k-Coloring in Average Sublinear Time
This paper shows that the average-case complexity of the $k$-coloring problem is $Θ(nk)$ for every $k ≤ n^{c'}$, revealing its average sublinear nature.
Highlighted terms show continued research focus across papers