Prashanth Amireddy

Orcid: 0000-0002-2713-8961

Affiliations:
  • Harvard University, USA
  • IIT Madras, India (former)


According to our database1, Prashanth Amireddy authored at least 11 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Low Degree Local Correction Over the Boolean Cube.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

A Near-Optimal Polynomial Distance Lemma over Boolean Slices.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Eigenvalue Bounds for Symmetric Markov Chains on Multislices with Applications.
Proceedings of the Approximation, 2025

2024
Local Correction of Linear Functions over the Boolean Cube.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Low-Degree Testing over Grids.
Proceedings of the Approximation, 2023

2022
Low-depth arithmetic circuit lower bounds via shifted partials.
Electron. Colloquium Comput. Complex., 2022

2021
Diameter constrained Steiner tree and related problems.
CoRR, 2021

2020
Time Series Forecasting for Cold-Start Items by Learning from Related Items using Memory Networks.
Proceedings of the Companion of The 2020 Web Conference 2020, 2020

On the Mystery of Negations in Circuits: Structure vs Power.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020

Power of Decision Trees with Monotone Queries.
Proceedings of the Computing and Combinatorics - 26th International Conference, 2020


  Loading...