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

Varun Jog

1 indexed paper

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

Publications per year

1
26

Top categories

Info Theory×1Complexity×1Stats Theory×1Stats ML×1

Frequent co-authors

Hadi Kazemi1×

Research Timeline

2026
Tight Information Complexity of the Coin Problem in the Broadcast Model

This paper characterizes the information complexity of distributed testing of Ber(α) versus Ber(β) in the broadcast model, identifies optimal protocols for different parameter regimes, and derives new bounds using a novel mixed Hellinger--Jensen--Shannon inequality.

Highlighted terms show continued research focus across papers

Papers

cs.ITcs.CCmath.STTheoreticalRecentAug 3, 2026

Tight Information Complexity of the Coin Problem in the Broadcast Model

Hadi Kazemi, Varun Jog

This paper characterizes the information complexity of distributed testing of Ber(α) versus Ber(β) in the broadcast model, identifies optimal protocols for different parameter regimes, and derives new…

View →