70 citations · 129 across the 18 of their papers we have counts for
22 papers
Existence of Fair Resolute Voting Rules
Manik Dhar, Kunal Mittal, Clayton Thomas
Among two-candidate elections that treat the candidates symmetrically and never result in a tie, which voting rules are fair? A natural requirement is that each voter exerts an equ…
From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
Joshua Brakensiek, Yeyuan Chen, Manik Dhar +1
In coding theory, a common question is to understand the threshold rates of various local properties of codes, such as their list decodability and list recoverability. A recent wor…
Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
Joshua Brakensiek, Yeyuan Chen, Manik Dhar +1
In coding theory, the problem of list recovery asks one to find all codewords of a given code which such that at least fraction of the symbols of lie in some pred…
Iterated sumset expansion in
Manik Dhar, Sammy Luo
Given a set , what conditions does one need to guarantee that iterated sumsets of the form expand quickly (say, within terms) to the…
Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
Joshua Brakensiek, Manik Dhar, Sivakanth Gopi
In this paper, we continue the study of Maximally Recoverable (MR) Grid Codes initiated by Gopalan et al. [SODA 2017]. More precisely, we study codes over an grid topo…
Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
Joshua Brakensiek, Yeyuan Chen, Manik Dhar +1
Motivated by recent developments in coding theory, particular in list-decoding, we introduce a new error model which we call semi-adversarial errors. This error model bridges betwe…