20 citations · 35 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules
Chinmay Sonar, Palash Dey, Neeldhara Misra
The Chamberlin-Courant and Monroe rules are fundamental and well-studied rules in the literature of multi-winner elections. The problem of determining if there exists a committee o…
cs.DS2017
Resolving the Complexity of Some Fundamental Problems in Computational Social Choice
Palash Dey
This thesis is in the area called computational social choice which is an intersection area of algorithms and social choice theory.
cs.DS2016
An Optimal Algorithm for l1-Heavy Hitters in Insertion Streams and Related Problems
Arnab Bhattacharyya, Palash Dey, David P. Woodruff
We give the first optimal bounds for returning the -heavy hitters in a data stream of insertions, together with their approximate frequencies, closing a long line of work o…