Fernando Granha Jeronimo

According to our database, Fernando Granha Jeronimo authored at least 16 papers between 2019 and 2024.

Collaborative distances:

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

2024

Dimension Independent Disentanglers from Unentanglement and Applications.

Fernando Granha Jeronimo, Pei Wu

Proceedings of the 39th Computational Complexity Conference, 2024

2023

Subset States and Pseudorandom States.

Fernando Granha Jeronimo, Nir Magrafta, Pei Wu

CoRR, 2023

The Power of Unentangled Quantum Proofs with Non-negative Amplitudes.

Fernando Granha Jeronimo, Pei Wu

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Exact Completeness of LP Hierarchies for Linear Codes.

Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

List Decoding of Tanner and Expander Amplified Codes from Distance Certificates.

Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs.

Fernando Granha Jeronimo

Proceedings of the Approximation, 2023

2022

Tighter bounds on the independence number of the Birkhoff graph.

Leonardo Nagami Coregliano, Fernando Granha Jeronimo

Eur. J. Comb., 2022

Explicit Abelian Lifts and Quantum LDPC Codes.

Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, Madhur Tulsiani

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

A Complete Linear Programming Hierarchy for Linear Codes.

Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification.

Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy, Avi Wigderson

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Near-linear time decoding of Ta-Shma's codes via splittable regularity.

Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound.

Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani

CoRR, 2020

List Decoding of Direct Sum Codes.

Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani

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

Unique Decoding of Explicit $\varepsilon$-balanced Codes Near the Gilbert-Varshamov Bound.

Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes.

Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Approximating Constraint Satisfaction Problems on High-Dimensional Expanders.

Vedat Levi Alev, Fernando Granha Jeronimo, Madhur Tulsiani

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019