Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Ronitt Rubinfeld

Ronitt Rubinfeld

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Algorithms×2Complexity×1Combinatorics×1

Frequent co-authors

Cassandra Marcussen1×
Edward Pyne1×
Asaf Shapira1×
Shlomo Tauber1×
Yumou Fei1×

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

Papers

cs.DScs.CCmath.COTheoreticalRecentJul 29, 2026

Graph k-Coloring in Average Sublinear Time

Cassandra Marcussen, Edward Pyne, Ronitt Rubinfeld, Asaf Shapira +1 more

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.

View →
cs.DSTheoretical
Recent
Jun 11, 2026

Testing Bipartiteness in Logarithmic Rounds

Yumou Fei, Ronitt Rubinfeld

The authors improve the result of testing bipartiteness in bounded-degree graphs using random walks.

View →