Search for persons
X
?
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) ,
2
Cut Query Algorithms with Star Contraction:
, In:
?
Proceedings of the 36th Computational Complexity Conference ,
3
On the cut dimension of a graph:
, In:
?
Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms ,
4
Quantum algorithms for graph problems with cut queries:
, In:
?
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ,
5
Quantum algorithms for graph problems with cut queries:
, In:
?
Proceedings of the 36th Computational Complexity Conference ,
6
Quantum complexity of minimum cut:
, In:
?
Proceedings of the 32nd Computational Complexity Conference ,
11
Separating quantum communication and approximate rank:
, In:
?
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing ,
15