Siddharth Iyer

activity

20182021

most citedTight bounds on the Fourier growth of bounded functions on the hypercube

2 citations · 2 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2018

Interactive coding resilient to an unknown number of erasures

Ran Gelles, Siddharth Iyer

We consider distributed computations between two parties carried out over a noisy channel that may erase messages. Following a noise model proposed by Dani et al. (2018), the noise…

cs.DS2018

Shortest $k$ -Disjoint Paths via Determinants

Samir Datta, Siddharth Iyer, Raghav Kulkarni +1

The well-known $k$ -disjoint path problem ( $k$ -DPP) asks for pairwise vertex-disjoint paths between $k$ specified pairs of vertices $(s_{i}, t_{i})$ in a given graph, if they exist. The…

Interactive coding resilient to an unknown number of erasures

Shortest k-Disjoint Paths via Determinants

Shortest $k$ -Disjoint Paths via Determinants