An Optimal Algorithm for ℓ1-Heavy Hitters in Insertion Streams and Related Problems A Bhattacharyya, P Dey, DP Woodruff ACM Transactions on Algorithms (TALG) 15 (1), 1-27, 2018 | 36 | 2018 |
Sample complexity for winner prediction in elections P Dey, A Bhattacharyya Proceedings of the 2015 International Conference on Autonomous Agents and …, 2015 | 36 | 2015 |
Estimating the margin of victory of an election using sampling P Dey, Y Narahari arXiv preprint arXiv:1505.00566, 2015 | 30 | 2015 |
Frugal bribery in voting P Dey, N Misra, Y Narahari Theoretical Computer Science 676, 15-32, 2017 | 29 | 2017 |
Kernelization complexity of possible winner and coalitional manipulation problems in voting P Dey, N Misra, Y Narahari Theoretical Computer Science 616, 111-125, 2016 | 29 | 2016 |
Manipulating node similarity measures in networks P Dey, S Medya arXiv preprint arXiv:1910.11529, 2019 | 26 | 2019 |
Complexity of manipulation with partial information in voting P Dey, N Misra, Y Narahari Theoretical Computer Science 726, 78-99, 2018 | 26 | 2018 |
Elicitation for preferences single peaked on trees P Dey, N Misra arXiv preprint arXiv:1604.04403, 2016 | 20 | 2016 |
Minimizing margin of victory for fair political and educational districting AA Stoica, A Chakraborty, P Dey, KP Gummadi arXiv preprint arXiv:1909.05583, 2019 | 19 | 2019 |
Query complexity of tournament solutions P Dey Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 19 | 2017 |
Preference elicitation for single crossing domain P Dey, N Misra arXiv preprint arXiv:1604.05194, 2016 | 17 | 2016 |
On the exact amount of missing information that makes finding possible winners hard P Dey, N Misra arXiv preprint arXiv:1610.08407, 2016 | 16 | 2016 |
On the complexity of winner verification and candidate winner for multiwinner voting rules C Sonar, P Dey, N Misra arXiv preprint arXiv:2004.13933, 2020 | 13 | 2020 |
Covert networks: How hard is it to hide? P Dey, S Medya arXiv preprint arXiv:1903.05832, 2019 | 12 | 2019 |
Proportional representation in vote streams P Dey, N Talmon, O Van Handel arXiv preprint arXiv:1702.08862, 2017 | 12 | 2017 |
Predicting winner and estimating margin of victory in elections using sampling A Bhattacharyya, P Dey Artificial Intelligence 296, 103476, 2021 | 11 | 2021 |
On parameterized complexity of binary networked public goods game A Maiti, P Dey Algorithmica 86 (1), 307-333, 2024 | 10 | 2024 |
A parameterized perspective on protecting elections P Dey, N Misra, S Nath, G Shakya Theoretical Computer Science 874, 15-31, 2021 | 10 | 2021 |
Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers P Dey, N Misra, Y Narahari Theoretical Computer Science 783, 53-70, 2019 | 10 | 2019 |
Detecting possible manipulators in elections P Dey, N Misra, Y Narahari arXiv preprint arXiv:1404.2367, 2014 | 10 | 2014 |