ZHANG, Sheng Yu

Selected Publications:

  • Sean Hallgren, Alexandra Kolla, Pranab Sen and Shengyu Zhang. Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), pages 592-603, 2008. Best paper award.
  • Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, and Shengyu Zhang. Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 363-372, 2007. Journal version invited to SIAM Journal on Computing (special issue for FOCS'07).
  • Shengyu Zhang. New upper and lower bounds for randomized and quantum Local Search. In Proceedings of the 38th ACM Symposium on Theory of Computing (STOC), pp. 634-643, 2006.
  • Shengyu Zhang. On the power of Ambainis lower bounds. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pages 1238-1250, 2004. Journal version invited to Theoretical Computer Science (special issue for ICALP'04) and appeared in 339(2-3):241-256, 2005.
  • Prashanth Hande, Shengyu Zhang, and Mung Chiang. Distributed rate allocation for inelastic flows. IEEE/ACM Transactions on Networking, 15(6):1240-1253, December 2007. Earlier version in Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 2679-2690, 2005.