Get started
Author

Michael C. Chavrimootoo

Observed names: Chavrimootoo, Michael C., Michael C. Chavrimootoo
ORCID: 0000-0002-0510-6002
Observed ORCID: 0000-0002-0510-6002
OpenAlex ID: A5061361547
Separating and Collapsing Electoral Control Types
2024 · Benjamin Carleton, Michael C. Chavrimootoo, et al. · Journal of Artificial Intelligence Research · 7
PDF
Search Versus Search for Collapsing Electoral Control Types
2026 · Benjamin Carleton, Michael C. Chavrimootoo, et al. · Theory of Computing Systems · 4
PDF
Defying gravity and gadget numerosity: The complexity of the Hanano Puzzle and beyond
2024 · Michael C. Chavrimootoo · Information Processing Letters · 3
PDF
Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle
2023 · Michael C. Chavrimootoo · Lecture notes in computer science · 3
The Cost of Failure: On The Complexity of Recampaigning Under Fixed Districts
2026 · Michael C. Chavrimootoo, Aidan Jeansonne · Lecture notes in computer science · 2
PDF
Axiomatic Tools for Separating Electoral Control Types, with Applications to Concrete Systems
2026 · Michael C. Chavrimootoo, Ian Clingerman, et al. · Lecture notes in computer science · 2
PDF
Approximating Electoral Control Problems
2026 · Huy Vu Bui, Michael C. Chavrimootoo, et al. · Lecture notes in computer science · 2
Separating and Collapsing Electoral Control Types
2023 · Benjamin Carleton, Michael C. Chavrimootoo, et al. · Adaptive Agents and Multi-Agents Systems · 2
Search versus Search for Collapsing Electoral Control Types
2023 · Benjamin Carleton, Michael C. Chavrimootoo, et al. · Adaptive Agents and Multi-Agents Systems · 2
Carrying is Hard: Exploring the Gap Between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
2026 · Michael C. Chavrimootoo, Jin Seok Youn · Lecture notes in computer science · 1
PDF
Approximating Electoral Control Problems
2026 · Huy Vu Bui, Michael C. Chavrimootoo, et al. · Adaptive Agents and Multi-Agents Systems · 1
PDF
Search Versus Search for Collapsing Electoral Control Types
2025 · Benjamin Carleton, Michael C. Chavrimootoo, et al. · Lecture notes in computer science · 1
On Czerwinski's "${\rm P} \neq {\rm NP}$ relative to a ${\rm P}$-complete oracle"
2023 · Chavrimootoo, Michael C., Le, Tran Duy Anh, et al. · arXiv (Cornell University) · 1
PDF
A Closer Look at Some Recent Proof Compression-Related Claims
2022 · Chavrimootoo, Michael C., Ferland, Ethan, et al. · arXiv (Cornell University) · 1
PDF
Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?
2026 · Carleton, Benjamin, Chavrimootoo, Michael C., et al. · arXiv (Cornell University)
PDF
A Brief Note on a Recent Claim About NP-Hard Problems and BQP
2024 · Chavrimootoo, Michael C. · arXiv (Cornell University)
PDF
Evaluating the Claims of "SAT Requires Exhaustive Search"
2023 · Chavrimootoo, Michael C., He, Yumeng, et al. · arXiv (Cornell University)
PDF
Separations and Collapses in Computational Social Choice
2023 · Michael C. Chavrimootoo · Adaptive Agents and Multi-Agents Systems
A Critique of Sopin's "${\rm PH} = {\rm PSPACE}$"
2022 · Chavrimootoo, Michael C., Clingerman, Ian, et al. · arXiv (Cornell University)
PDF
A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem."
2021 · Chavrimootoo, Michael C., Welles, Henry B. · arXiv (Cornell University)
PDF
A Critique of Keum-Bae Cho's Proof that $\mathrm{P} \subsetneq \mathrm{NP}$
2021 · Carleton, Benjamin, Chavrimootoo, Michael C., et al. · arXiv (Cornell University)
PDF
Works count: 22
Citation count: 32
H-index: 3
I10-index:
Year
Topic
Type