Andrey A. Storozhenko

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

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

The Communication Complexity of Approximating Matrix Rank.

Alexander A. Sherstov, Andrey A. Storozhenko

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2021

An optimal separation of randomized and Quantum query complexity.

Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021