A Refutation of Guinea's "Understanding SAT is in P". - Jackson Abascal; Shir Maimon (CoRR, 2017)

Critique of Barbosa's "P != NP Proof". - Jackson Abascal; Shir Maimon (CoRR, 2017)

A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs. - Jackson Abascal; Amadou Bah; Mario Banuelos; David Uminsky 001; Olivia Vasquez (CoRR, 2018)

Closure and Nonclosure Properties of the Compressible and Rankable Sets. - Jackson Abascal; Lane A. Hemaspaandra; Shir Maimon; Daniel Rubery (LATA, 2019)

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC. - Jackson Abascal; Mohammad Hossein Faghihi Sereshgi; Carmit Hazay; Yuval Ishai; Muthuramakrishnan Venkitasubramaniam (CCS, 2020)

Strongly refuting all semi-random Boolean CSPs. - Jackson Abascal; Venkatesan Guruswami; Pravesh K. Kothari (SODA, 2021)

Closure and nonclosure properties of the classes of compressible and rankable sets. - Jackson Abascal; Lane A. Hemaspaandra; Shir Maimon; Daniel Rubery (J. Comput. Syst. Sci., 2021)