I agree that this site is using cookies. You can find further informations here.
X
Lee, Troy
968  results:
Search for persons X
?
1

Around the log-rank conjecture:

Lee, Troy ; Shraibman, Adi
Israel Journal of Mathematics.  256 (2023)  2 - p. 441-477 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Cut Query Algorithms with Star Contraction:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Apers, Simon ; Efron, Yuval ; Gawrychowski, Pawel... - p. 507-518 , 2022
Link: https://doi.org/10.1109/..
 
?
3

On the cut dimension of a graph:

, In: Proceedings of the 36th Computational Complexity Conference,
Lee, Troy ; Li, Tongyang ; Santha, Miklos. - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
4

Quantum algorithms for graph problems with cut queries:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Lee, Troy ; Santha, Miklos ; Zhang, Shengyu - p. 939-958 , 2021
Link: https://dl.acm.org/doi/1..
 
?
5

Quantum algorithms for graph problems with cut queries:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Lee, Troy ; Santha, Miklos ; Zhang, Shengyu - p. 939-958 , 2021
Link: https://doi.org/10.1137/..
 
?
6

Quantum complexity of minimum cut:

, In: Proceedings of the 36th Computational Complexity Conference,
Apers, Simon ; Lee, Troy - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Two new results about quantum exact learning:

Arunachalam, Srinivasan ; Chakraborty, Sourav ; Lee, Troy..
Quantum.  5 (2021)  - p. 587 , 2021
Link: https://doi.org/10.22331..
 
?
8

Quadratically Tight Relations for Randomized Query Complexi..:

Jain, Rahul ; Klauck, Hartmut ; Kundu, Srijita...
Theory of Computing Systems.  64 (2019)  1 - p. 101-119 , 2019
Link: https://doi.org/10.1007/..
 
?
9

Quantum Attacks on Bitcoin, and How to Protect Against Them:

Aggarwal, Divesh ; Brennen, Gavin ; Lee, Troy..
Ledger.  3 (2018)  - p. , 2018
Link: https://doi.org/10.5195/..
 
?
10

Separations in Query Complexity Based on Pointer Functions:

Ambainis, Andris ; Balodis, Kaspars ; Belovs, Aleksandrs...
Journal of the ACM (JACM).  64 (2017)  5 - p. 1-24 , 2017
Link: https://dl.acm.org/doi/1..
 
?
11

Separating quantum communication and approximate rank:

, In: Proceedings of the 32nd Computational Complexity Conference,
Anshu, Anurag ; Ben-David, Shalev ; Garg, Ankit... - p. 1-33 , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

Separations in Query Complexity Based on Pointer Functions:

Ambainis, Andris ; Balodis, Kaspars ; Belovs, Aleksandrs...
Journal of the ACM.  64 (2017)  5 - p. 1-24 , 2017
Link: https://doi.org/10.1145/..
 
?
13

Hellinger volume and number-on-the-forehead communication c..:

Lee, Troy ; Leonardos, Nikos ; Saks, Michael.
Journal of Computer and System Sciences.  82 (2016)  6 - p. 1064-1074 , 2016
Link: https://doi.org/10.1016/..
 
?
14

Information-theoretic approximations of the nonnegative ran:

Braun, Gábor ; Jain, Rahul ; Lee, Troy.
computational complexity.  26 (2016)  1 - p. 147-197 , 2016
Link: https://doi.org/10.1007/..
 
?
15

Separations in query complexity based on pointer functions:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,
Ambainis, Andris ; Balodis, Kaspars ; Belovs, Aleksandrs... - p. 800-813 , 2016
Link: https://dl.acm.org/doi/1..
 
1-15