Searching for authors named "Yaoyun Shi" – sorted by Relevance.
-
Approximating linear restrictions of boolean functions
- Approximating linear restrictions of Boolean functions Yaoyun Shi1 Abstract We initiate two new
- Cited by 7 (2 self) – Add To MetaCart
-
Quantum communication complexity of block-composed functions. Available at arXiv:0710.0095v1
- Quantum communication complexity of block-composed functions Yaoyun Shi and Yufan Zhu Department
- Cited by 7 (1 self) – Add To MetaCart
-
Simulating quantum computation by contracting tensor networks
- Simulating quantum computation by contracting tensor networks Igor Markov 1 and Yaoyun Shi 2
- Cited by 5 (1 self) – Add To MetaCart
-
Tensor norms and the classical communication complexity of nonlocal quantum measurement
- Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement 1 Yaoyun
- Cited by 2 (0 self) – Add To MetaCart
-
Y.: Path auction games when an agent can own multiple edges. In: NetEcon
- Path Auction Games When an Agent Can Own Multiple Edges ∗ Ye Du † Yaoyun Shi † Rahul Sami
- Cited by 2 (0 self) – Add To MetaCart
-
Quantum complexities of ordered searching, sorting, and element distinctness
- /yer z Jan Neerbek x Yaoyun Shi - September 17, 2001 Abstract We consider the quantum complexities
- Cited by 16 (3 self) – Add To MetaCart
-
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
- Chakrabarti Yaoyun Shi Anthony Wirth Andrew Yao Department of Computer Science, Princeton University 35 Olden
- Cited by 27 (5 self) – Add To MetaCart
-
Evasiveness of Subgraph Containment and Related Properties
- , and Yaoyun Shi Department of Computer Science, Princeton University, Princeton NJ 08544, USA famitc
- Cited by 5 (3 self) – Add To MetaCart

