Jackson Abascal

According to our database, Jackson Abascal authored at least 7 papers between 2017 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

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

Strongly refuting all semi-random Boolean CSPs.

Jackson Abascal, Venkatesan Guruswami, Pravesh K. Kothari

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

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

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2019

Closure and Nonclosure Properties of the Compressible and Rankable Sets.

Jackson Abascal, Lane A. Hemaspaandra, Shir Maimon, Daniel Rubery

Proceedings of the Language and Automata Theory and Applications, 2019

2018

A Non-iterative Parallelizable Eigenbasis Algorithm for Johnson Graphs.

Jackson Abascal, Amadou Bah, Mario Banuelos, David Uminsky, Olivia Vasquez

CoRR, 2018

2017

Critique of Barbosa's "P != NP Proof".

Jackson Abascal, Shir Maimon

CoRR, 2017

A Refutation of Guinea's "Understanding SAT is in P".

Jackson Abascal, Shir Maimon

CoRR, 2017