Pratik Shastri

Orcid: 0009-0004-2672-3036

According to our database1, Pratik Shastri authored at least 5 papers between 2024 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
A Quadratic Lower Bound for Noncommutative Circuits.
CoRR, April, 2026

Lower Bounds for Noncommutative Circuits with Low Syntactic Degree.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
On the Hardness of Order Finding and Equivalence Testing for ROABPs.
Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

Efficient Polynomial Identity Testing over Nonassociative Algebras.
Proceedings of the Approximation, 2025

2024
Lower Bounds for Planar Arithmetic Circuits.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024


  Loading...