Parker Newton
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
2
Venues
2
Active years
2023–2023
Best venue rank
A*
Where they publish
Papers
2 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2023 | CRYPTO | A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus. | Parker Newton, Silas Richelson |
| 2023 | STOC | A High Dimensional Goldreich-Levin Theorem. | Parker Newton, Silas Richelson, Chase Wilson |