Andrey A. Storozhenko

According to our database1, Andrey A. Storozhenko authored at least 2 papers between 2021 and 2024.

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

2024
The Communication Complexity of Approximating Matrix Rank.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2021
An optimal separation of randomized and Quantum query complexity.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021


  Loading...