var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https://cs.rochester.edu/u/mchavrim/archival/mypubs.bib&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://cs.rochester.edu/u/mchavrim/archival/mypubs.bib&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://cs.rochester.edu/u/mchavrim/archival/mypubs.bib&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Czerwinski's ``P $\\neq$ NP relative to a P-complete oracle''.\n \n \n \n \n\n\n \n Chavrimootoo, M.; Le, T.; Reidy, M.; ; and Smith, E.\n\n\n \n\n\n\n Technical Report arXiv:2312.04395 [cs.CC], Computing Research Repository, arXiv.org/corr/, Dec 2023.\n \n\n\n\n
\n\n\n\n \n \n \"On link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@techreport{cha-le-rei-smi:t:czerwinski,\r\n  Author = {M. Chavrimootoo and T. Le and M. Reidy and and E. Smith},\r\n  title     = {On Czerwinski's ``{P} $\\neq$ {NP} relative to a {P}-complete oracle''},\r\n  Month = "Dec",\r\n  Year = "2023",\r\n  Institution = "Computing Research Repository",\r\n  Number = "arXiv:2312.04395 [cs.CC]",\r\n  Address = {arXiv.org/corr/},\r\n  url_link = {https://arxiv.org/abs/2312.04395}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Evaluating the Claims of ``SAT Requires Exhaustive Search''.\n \n \n \n \n\n\n \n Chavrimootoo, M.; He, Y.; Kotler-Berkowitz, M.; Liuson, H.; and Nie, Z.\n\n\n \n\n\n\n Technical Report arXiv:2312.02071 [cs.CC], Computing Research Repository, arXiv.org/corr/, Dec 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Evaluating link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@techreport{cha-he-kot-liu-nie:t:sat-exp,\r\n  Author = {M. Chavrimootoo and Y. He and M. Kotler-Berkowitz and H. Liuson and Z. Nie},\r\n  title     = {Evaluating the Claims of ``{SAT} Requires Exhaustive Search''},\r\n  Month = "Dec",\r\n  Year = "2023",\r\n  Institution = "Computing Research Repository",\r\n  Number = "arXiv:2312.02071 [cs.CC]",\r\n  Address = {arXiv.org/corr/},\r\n  url_link = {https://arxiv.org/abs/2312.02071}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle.\n \n \n \n \n\n\n \n Chavrimootoo, M.\n\n\n \n\n\n\n In Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems, pages 36–50, June 2023. \n \n\n\n\n
\n\n\n\n \n \n \"Defying link\n  \n \n \n \"Defying slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{cha:c:hanano,\r\n\tauthor    = {M. Chavrimootoo},\r\n\ttitle     = {Defying Gravity and Gadget Numerosity: The Complexity of the Hanano Puzzle},\r\n\tbooktitle = {Proceedings of the 25th International Conference on Descriptional Complexity of Formal Systems},\r\n\tmonth     = "June",                  \r\n\tpages     = {36--50},\r\n\tyear      = {2023},\r\n\turl_Link = {https://link.springer.com/chapter/10.1007/978-3-031-34326-1_3},\r\n\turl_Slides = {hanano_dcfs_slides.pdf},\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Separations and Collapses in Computational Social Choice.\n \n \n \n \n\n\n \n Chavrimootoo, M.\n\n\n \n\n\n\n In Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pages 3026–3028, May 2023. International Foundation for Autonomous Agents and Multiagent Systems\n \n\n\n\n
\n\n\n\n \n \n \"Separations link\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
@inproceedings{cha:c:dc-paper,\r\n\tauthor    = {M. Chavrimootoo},\r\n\ttitle     = {Separations and Collapses in Computational Social Choice},\r\n\tyear      = {2023},\r\n\tbooktitle = aamas23,\r\n\tpages     = {3026--3028},\r\n\tmonth     = "May",                 \r\n \tpublisher = "International Foundation for Autonomous Agents and Multiagent Systems",\r\n\turl_Link = {https://www.southampton.ac.uk/~eg/AAMAS2023/pdfs/p3026.pdf},\r\n}\r\n\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Separating and Collapsing Electoral Control Types.\n \n \n \n \n\n\n \n \n\n\n \n\n\n\n In Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pages 1743–1751, May 2023. International Foundation for Autonomous Agents and Multiagent Systems\n \n\n\n\n
\n\n\n\n \n \n \"Separating link\n  \n \n \n \"Separating video\n  \n \n \n \"Separating slides\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n 
\n
\n\n\n\n
\n\n\n  
\n  \n\n  \n  \n  \n  \n  \n  \n    Search versus Search for Collapsing Electoral Control Types (Extended Abstract).\n  \n  \n  \n  \n\n\n  \n  Carleton, B.; Chavrimootoo, M.; Hemaspaandra, L.; Narváez, D.; Taliancich, C.;  and Welles, H.\n\n\n  \n\n\n\n  In Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems, pages 2682–2684, May 2023. International Foundation for Autonomous Agents and Multiagent Systems\n  \n\n\n\n
\n\n\n\n  \n  \n    \"Search link\n   \n  \n  \n    \"Search poster\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@inproceedings{car-cha-hem-nar-tal-wel:c:svs,\r\n\tauthor    = {B. Carleton and M. Chavrimootoo and L. Hemaspaandra and \r\n\tD. Narv\\'{a}ez and C. Taliancich and H. Welles},\r\n\ttitle     = {Search versus Search for Collapsing Electoral Control Types \r\n\t\t(Extended Abstract)},\r\n\tyear      = {2023},\r\n\tbooktitle=aamas23,\r\n\tpages     = {2682--2684},\r\n\tmonth     = "May",                 \r\n \tpublisher = "International Foundation for Autonomous Agents and Multiagent Systems",\r\n\turl_Link = {https://www.southampton.ac.uk/~eg/AAMAS2023/pdfs/p2682.pdf},\r\n\turl_Poster = {archival/s-vs-s_poster.pdf}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n  
\n  \n\n  \n  \n  \n  \n  \n  \n    A Critique of Sopin's \"PH = PSPACE\".\n  \n  \n  \n  \n\n\n  \n  Chavrimootoo, M.; Clingerman, I.;  and Luu, Q.\n\n\n  \n\n\n\n  Technical Report arXiv:2301.03487 [cs.CC], Computing Research Repository, arXiv.org/corr/, January 2023.\n  \n\n\n\n
\n\n\n\n  \n  \n    \"A link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n   \n  \n    6 downloads\n  \n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{cha-cli-luu:t:sopin,\r\nauthor={M. Chavrimootoo and I. Clingerman and Q. Luu},\r\n\ttitle={A Critique of {Sopin}'s "{PH} = {PSPACE}"}, \r\n\tyear={2023},\r\n\tmonth={January},\r\n\tnumber={arXiv:2301.03487 [cs.CC]},\r\n\tinstitution={Computing Research Repository, arXiv.org/corr/},\r\n\turl_Link = {https://arxiv.org/abs/2301.03487}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n\n\n\n    
\n  
\n\n  
\n    
\n       \n      2022\n      \n        \n        (4)\n        \n      \n    
\n    
\n      \n  \n  
\n  \n\n  \n  \n  \n  \n  \n  \n    A Closer Look at Some Recent Proof Compression-Related Claims.\n  \n  \n  \n  \n\n\n  \n  Chavrimootoo, M.; Ferland, E.; Gibson, E.;  and Wilson, A.\n\n\n  \n\n\n\n  Technical Report arXiv:2212.12150 [cs.CC], Computing Research Repository, arXiv.org/corr/, December 2022.\n  \n\n\n\n
\n\n\n\n  \n  \n    \"A link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n   \n  \n    3 downloads\n  \n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{cha-fer-gib-wil:t:gh,\r\n\tauthor={M. Chavrimootoo and E. Ferland and E. Gibson and A. Wilson},\r\n\ttitle={A Closer Look at Some Recent Proof Compression-Related Claims}, \r\n\tyear={2022},\r\n\tmonth={December},\r\n\tnumber={arXiv:2212.12150 [cs.CC]},\r\n\tinstitution={Computing Research Repository, arXiv.org/corr/},\r\n\turl_Link = {https://arxiv.org/abs/2212.12150}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n  
\n  \n\n  \n  \n  \n  \n  \n  \n    Separating and Collapsing Electoral Control Types.\n  \n  \n  \n  \n\n\n  \n  Carleton, B.; Chavrimootoo, M.; Hemaspaandra, L.; Narváez, D.; Taliancich, C.;  and Welles, H.\n\n\n  \n\n\n\n  Technical Report arXiv:2207.00710 [cs.MA], Computing Research Repository, arXiv.org/corr/, July 2022.\n  Revised, February 2023.\n\n\n\n
\n\n\n\n  \n  \n    \"Separating link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{car-cha-hem-nar-tal-wel:t:sct,\r\n\tauthor    = {B. Carleton and M. Chavrimootoo and L. Hemaspaandra and D. Narv\\'{a}ez and \r\n\tC. Taliancich and H. Welles},\r\n\ttitle     = {Separating and Collapsing Electoral Control Types},\r\n\tyear      = {2022},\r\n\tMonth=jul,\r\n\tNumber= "arXiv:2207.00710 [cs.MA]",\r\n\tInstitution = "Computing Research Repository",\r\n\tAddress = {arXiv.org/corr/},\r\n\tNote = {Revised, February 2023.},\r\n\turl_Link = {https://arxiv.org/abs/2207.00710}\r\n}\r\n\r\n
\n
\n\n\n\n
\n\n\n  
\n  \n\n  \n  \n  \n  \n  \n  \n    Search versus Search for Collapsing Electoral Control Types.\n  \n  \n  \n  \n\n\n  \n  Carleton, B.; Chavrimootoo, M.; Hemaspaandra, L.; Narváez, D.; Taliancich, C.;  and Welles, H.\n\n\n  \n\n\n\n  Technical Report arXiv:2207.03049 [cs.GT], Computing Research Repository, arXiv.org/corr/, July 2022.\n  Revised, March 2023.\n\n\n\n
\n\n\n\n  \n  \n    \"Search link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n   \n  \n    1 download\n  \n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{car-cha-hem-nar-tal-wel:t:svs,\r\n\tauthor    = {B. Carleton and M. Chavrimootoo and L. Hemaspaandra and D. Narv\\'{a}ez and \r\n\tC. Taliancich and H. Welles},\r\n\ttitle     = {Search versus Search for Collapsing Electoral Control Types},\r\n\tyear      = {2022},\r\n\tMonth=jul,\r\n\tNumber= "arXiv:2207.03049 [cs.GT]",\r\n\tInstitution = "Computing Research Repository",\r\n\tAddress = {arXiv.org/corr/},\r\n\tNote = {Revised, March 2023.},\r\n\turl_Link = {https://arxiv.org/abs/2207.03049}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n  
\n  \n\n  \n  \n  \n  \n  \n  \n    Defying Gravity: The Complexity of the Hanano Puzzle.\n  \n  \n  \n  \n\n\n  \n  Chavrimootoo, M.\n\n\n  \n\n\n\n  Technical Report arXiv:2205.03400 [cs.CC], Computing Research Repository, arXiv.org/corr/, May 2022.\n  Revised, September 2022.\n\n\n\n
\n\n\n\n  \n  \n    \"Defying link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n   \n  \n    1 download\n  \n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{cha:t:hanano,\r\n\tauthor={M. Chavrimootoo},\r\n\ttitle={Defying Gravity: {The} Complexity of the {Hanano} Puzzle}, \r\n\tyear={2022},\r\n\tmonth=may,\r\n\tnumber={arXiv:2205.03400 [cs.CC]},\r\n\tinstitution={Computing Research Repository, arXiv.org/corr/},\r\n\tNote={Revised, September 2022.},\r\n\turl_Link = {https://arxiv.org/abs/2205.03400}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n\n\n\n    
\n  
\n\n  
\n    
\n       \n      2021\n      \n        \n        (2)\n        \n      \n    
\n    
\n      \n  \n  
\n  \n\n  \n  \n  \n  \n  \n  \n    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\".\n  \n  \n  \n  \n\n\n  \n  Chavrimootoo, M.;  and Welles, H.\n\n\n  \n\n\n\n  Technical Report arXiv:2112.06062 [cs.CC], Computing Research Repository, arXiv.org/corr/, December 2021.\n  \n\n\n\n
\n\n\n\n  \n  \n    \"A link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n   \n  \n    1 download\n  \n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{cha-wel:t:kumar-critique,\r\n\tauthor={M. Chavrimootoo and H. Welles},\r\n\ttitle={A Critique of {Kumar}'s "{Necessary} and Sufficient Condition \r\n\tfor Satisfiability of a Boolean Formula in {CNF} and Its Implications on \r\n\t{P} versus {NP} Problem"}, \r\n\tyear={2021},\r\n\tmonth=dec,\r\n\tnumber={arXiv:2112.06062 [cs.CC]},\r\n\tinstitution={Computing Research Repository, arXiv.org/corr/},\r\n\turl_Link = {https://arxiv.org/abs/2112.06062}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n  
\n  \n\n  \n  \n  \n  \n  \n  \n    A Critique of Keum-Bae Cho's Proof that P $⊊$ NP.\n  \n  \n  \n  \n\n\n  \n  Carleton, B.; Chavrimootoo, M.;  and Taliancich, C.\n\n\n  \n\n\n\n  Technical Report arXiv:2104.01736 [cs.CC], Computing Research Repository, arXiv.org/corr/, April 2021.\n  \n\n\n\n
\n\n\n\n  \n  \n    \"A link\n   \n  \n\n  \n\n  \n  link\n   \n  \n\n  bibtex\n    \n\n  \n\n  \n   \n  \n    1 download\n  \n  \n\n  \n  \n  \n  \n  \n  \n  \n\n   \n  \n  \n\n\n\n
\n  
@techreport{car-cha-tal:t:cho-critique,\r\n\tauthor={B. Carleton and M. Chavrimootoo and C. Taliancich},\r\n\ttitle={A Critique of {Keum-Bae Cho}'s Proof that {P} $\\subsetneq$ {NP}}, \r\n\tyear={2021},\r\n\tmonth=apr,\r\n\tnumber={arXiv:2104.01736 [cs.CC]},\r\n\tinstitution={Computing Research Repository, arXiv.org/corr/},\r\n\turl_Link = {https://arxiv.org/abs/2104.01736}\r\n}\r\n\r\n\r\n
\n
\n\n\n\n
\n\n\n\n\n\n    
\n  
\n\n\n\n\n  
\n\n\n  \n\n  \n  \n  \n  \n\n
\n"}; document.write(bibbase_data.data);