default search action
Fernando Granha Jeronimo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Fernando Granha Jeronimo, Pei Wu:
Dimension Independent Disentanglers from Unentanglement and Applications. CCC 2024: 26:1-26:28 - [i14]Fernando Granha Jeronimo, Pei Wu:
Dimension Independent Disentanglers from Unentanglement and Applications. CoRR abs/2402.15282 (2024) - [i13]Fernando Granha Jeronimo, Pei Wu:
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. CoRR abs/2402.18790 (2024) - [i12]Fernando Granha Jeronimo, Nir Magrafta, Joseph Slote, Pei Wu:
Coherence in Property Testing: Quantum-Classical Collapses and Separations. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c12]Fernando Granha Jeronimo:
Fast Decoding of Explicit Almost Optimal ε-Balanced q-Ary Codes And Fast Approximation of Expanding k-CSPs. APPROX/RANDOM 2023: 60:1-60:16 - [c11]Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani:
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates. FOCS 2023: 1682-1693 - [c10]Leonardo Nagami Coregliano
, Fernando Granha Jeronimo, Chris Jones:
Exact Completeness of LP Hierarchies for Linear Codes. ITCS 2023: 40:1-40:18 - [c9]Fernando Granha Jeronimo, Pei Wu:
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes. STOC 2023: 1629-1642 - [i11]Fernando Granha Jeronimo, Shashank Srivastava
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates. CoRR abs/2311.02263 (2023) - [i10]Fernando Granha Jeronimo, Nir Magrafta, Pei Wu:
Subset States and Pseudorandom States. CoRR abs/2312.15285 (2023) - 2022
- [j1]Leonardo Nagami Coregliano
Tighter bounds on the independence number of the Birkhoff graph. Eur. J. Comb. 105: 103564 (2022) - [c8]Fernando Granha Jeronimo, Tushant Mittal
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. FOCS 2022: 378-388 - [c7]Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
A Complete Linear Programming Hierarchy for Linear Codes. ITCS 2022: 51:1-51:22 - [c6]Fernando Granha Jeronimo, Tushant Mittal
Explicit Abelian Lifts and Quantum LDPC Codes. ITCS 2022: 88:1-88:21 - [i9]Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy, Avi Wigderson:
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification. CoRR abs/2209.07024 (2022) - [i8]Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
Exact Completeness of LP Hierarchies for Linear Codes. CoRR abs/2211.01248 (2022) - 2021
- [c5]Fernando Granha Jeronimo, Shashank Srivastava
Near-linear time decoding of Ta-Shma's codes via splittable regularity. STOC 2021: 1527-1536 - [i7]Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, Madhur Tulsiani:
Explicit Abelian Lifts and Quantum LDPC Codes. CoRR abs/2112.01647 (2021) - [i6]Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones:
A Complete Linear Programming Hierarchy for Linear Codes. CoRR abs/2112.09221 (2021) - 2020
- [c4]Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava
Unique Decoding of Explicit $\varepsilon$-balanced Codes Near the Gilbert-Varshamov Bound. FOCS 2020: 434-445 - [c3]Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran:
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. FOCS 2020: 954-965 - [c2]Vedat Levi Alev
List Decoding of Direct Sum Codes. SODA 2020: 1412-1425 - [i5]Leonardo Nagami Coregliano, Fernando Granha Jeronimo:
Tighter Bounds on the Independence Number of the Birkhoff Graph. CoRR abs/2007.05841 (2020) - [i4]Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran:
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes. CoRR abs/2009.01874 (2020) - [i3]Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani:
List Decoding of Direct Sum Codes. CoRR abs/2011.05467 (2020) - [i2]Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, Madhur Tulsiani:
Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound. CoRR abs/2011.05500 (2020)
2010 – 2019
- 2019
- [c1]Vedat Levi Alev
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. FOCS 2019: 180-201 - [i1]Vedat Levi Alev, Fernando Granha Jeronimo, Madhur Tulsiani:
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders. CoRR abs/1907.07833 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-17 20:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: