Varun Jog
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Info Theory×1Complexity×1Stats Theory×1Stats ML×1
Frequent co-authors
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