• One-Class Collaborative Filtering.
  Rong Pan, Yunhong Zhou, Bin Cao, Nathan N. Liu, Rajan Lukose, Martin Scholz, and Qiang Yang.
  Proc. ICDM, LNCS, Pisa, Italy, December 15--19, 2008.
  HPL Technical Report HPL-2008-48, May 2008. (pdf)
  
  
• Large-scale Parallel Collaborative Filtering for the Netflix Prize.
  Yunhong Zhou, Dennis Wilkinson, Robert Schreiber, and Rong Pan.
  Proc.AAIM'08, LNCS, Shanghai, June 23-25, 2008. (ps, pdf)
  
  
• Algorithm for Stochastic Multiple-Choice Knapsack Problem and Application to Keywords Bidding.
  Yunhong Zhou and Victor Naroditskiy.
  Proc. WWW2008 (poster), April 21 - 25, 2008, Beijing, China. (ps, pdf)
  An extended version appears in TROA2008, April 22, 2008, Beijing. (ps, pdf)
  
  
• Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems.
  Yunhong Zhou, Deeparnab Chakrabarty, and Rajan Lukose.
  Proc. WINE 2008(short paper), December 17--20, 2008, Shanghai, China.
  Proc. WWW2008 (poster), April 21 - 25, 2008, Beijing, China. (ps, pdf)
  An extended version appears as HPL Technical Report HPL-2008-9. (pdf)
  A preliminary version appears in SSA'07, May 8, 2007, Banff, Canada. (ps, pdf)
  
  
• Server Allocation Algorithms for Tiered Systems.
  Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Tarjan, and Yunhong Zhou.
  Algorithmica, COCOON'05 Special Issue, 48(2):129--146, 2007. (ps, pdf)
  Proc. COCOON'05, LNCS 3595, pages 632-643, 2005. (ps, pdf)
  An early version appeared as HPL Technical Report HPL-2004-151, 2004. (ps, pdf)
  
  
• Vindictive Bidding in Keyword Auctions.
  Yunhong Zhou and Rajan Lukose.
  Invited paper on ICEC'07, August 19-22, 2007, University of Minnesota, MN. (ps, pdf)
  An (almost identical) early version appears at SSA'06, June 11, Ann Arbor, Michigan, 2006. (ps, pdf)
  
  
• Experimental Evaluation of Parametric Max-Flow Algorithms.
  Maxim Babenko, Jonathan Derryberry, Andrew Goldberg, Robert Tarjan, and Yunhong Zhou.
  Proc. of WEA'07, June 6-9, 2007, Rome, Italy. (ps, pdf)
  
  
• Improved Throughput Bounds for Interference-aware Routing in Wireless Networks.
  Chiranjeeb Buraagohain, Subhash Suri, Csaba Toth and Yunhong Zhou.
  Proc. of COCOON'07, July 16-19, 2007, Banff, Canada.
  
  
• Selfish Load Balancing and Atomic Congestion Games.
  Subhash Suri, Csaba Tóth and Yunhong Zhou.
  Algorithmica, 47(1):79-96, 2007. (pdf)
  An early version appeared in SPAA'04, pages 188-195, 2004. (ps, pdf)
  
  
• Bandwidth-Constrained Allocation in Grid Computing.
  Anshul Kothari, Subhash Suri and Yunhong Zhou.
  Algorithmica, forthcoming, 2007. (ps, pdf)
  Proc. WADS'03, LNCS 2748, pages 67-78, 2003. (pdf)
  
  
• Denali: A Practical Algorithm for Generating Optimal Code.
  Rajeev Joshi, Greg Nelson and Yunhong Zhou.
  ACM Transactions on Programming Languages and Systems (TOPLAS) , 28(6):967--989, November, 2006. (ps, pdf)
  An early version appeared as HPL Technical Report HPL-2003-236, HP Labs, Palo Alto, CA, 2003.
  The Straight-Line Automatic Programming Problem. (ps, pdf)
  
  
• Range Counting over Multidimensional Data Streams.
  Subhash Suri, Csaba Tóth and Yunhong Zhou.
  Discrete and Computational Geometry, 36:633--655, 2006. (pdf)
  An early version appeared in SoCG'04, pages 160-169, 2004. (ps, pdf)
  
  
• Balancing Applied to Maximum Network Flow Problems.
  Robert Tarjan, Julie Ward, Bin Zhang, Yunhong Zhou and Jia Mao.
  Proceedings of ESA'06, LNCS 4168, pages 612-623, September 11-13, 2006, ETH Zürich, Switzerland. (ps, pdf)
  
  
• Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.
  Yunhong Zhou.
  Proceedings of ISAAC'06, Kolkata, India, December 18-20, 2006. (ps, pdf)
  
  
• Interval Subset-Sum and Uniform-Price Auction Clearing.
  Anshul Kothari, Subhash Suri and Yunhong Zhou.
  Proceedings of COCOON'05, LNCS 3595, pages 608-620, 2005. (ps, pdf)
  
  
• An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering.
  Yunhong Zhou, Terence Kelly, Janet Wiener and Eric Anderson.
  Proceedings of JSSPP'05. (ps, pdf)
  LNCS 3834, pages 123-145, springer, 2005. (ps, pdf)
  
  
• Value-Maximizing Deadline Scheduling and its Application to Animation Rendering.
  Eric Anderson, Dirk Beyer, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Pano Santos, Ram Swaminathan, Robert Tarjan, Janet Wiener and Yunhong Zhou.
  Proceedings of SPAA'05, 2005. (ps, pdf)
  A two page abstract appeared on Sigmetrics'05 (poster), pages 384-385, 2005. (ps, pdf)
  
  
• Congestion Games, Load Balancing, and Price of Anarchy.
  Anshul Kothari, Subhash Suri, Csaba Tóth and Yunhong Zhou.
  Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN'04), LNCS 3045, pages 13-27, 2004. (ps, pdf)
  
  
• Uncoordinated Load Balancing and Congestion Games in P2P Systems.
  Subhash Suri, Csaba Tóth and Yunhong Zhou.
  In IPTPS'04, LNCS 3279, pages 123-130, 2004. (ps, pdf)
  
  
• On the Complexity of Distance-based Evolutionary Tree Reconstruction.
  Valerie King, Li Zhang and Yunhong Zhou.
  In SODA'03, pages 444-453, 2003. (ps, pdf).
  It also appears as HPL Technical Report HPL-2002-267, 2002. (pdf)
  
  
• TreeJuxtaposer: Scalable Tree Comparison using Focus+Context with Guaranteed Visibility.
  Tamara Munzner, François Guimbretière, Serdar Tasiran, Li Zhang and Yunhong Zhou.
  ACM Transactions on Graphics, 22(3): 453-462, 2003. (pdf)
  Proceedings of SIGGRAPH'03, pages 453-462, 2003.
  
  
• Geometric Permutations of Balls with Bounded Size Disparity.
  Yunhong Zhou and Subhash Suri.
  Computational Geometry: Theory and Applications, 26(1):3-20, 2003. (ps, pdf)
  An early version appeared in CCCG'01, pages 177-180, 2001. (ps)
  
  
• A constant bound for geometric permutations of disjoint unit balls.
  Meir Katchalski, Subhash Suri and Yunhong Zhou.
  Discrete And Computational Geometry, 29(2):161-173, 2003. (ps, pdf)
  
  
• Shape sensitive geometric permutations.
  Yunhong Zhou and Subhash Suri.
  In SODA'01, pages 234-243, 2001. (ps, pdf)
  
  
• Surplus equivalence of leveled commitment contracts.
  Tuomas Sandholm and Yunhong Zhou.
  Artificial Intelligence, 142(2):239-264, 2002. (ps, pdf)
  An early version appeared in ICMAS'00, pages 247-254, 2000. (ps)
  AAAI-99 Workshop on Negotiation: Settling conflicts and identifying opportunities, pp. 38-43, 1999. (ps)
  Washington University, Department of Computer Science, Technical Report WUCS-99-03, 1999. (ps)
  
  
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions.
  Yunhong Zhou and Subhash Suri.
  SIAM Journal of Computing, 31(5):1339-1357, 2002. (ps, pdf)
  An early version appeared on SODA'00, 2000. (ps, pdf)
  
  
• Using data groups to specify and check side effects.
  K. Rustan M., Arnd Poetzsch-Heffter and Yunhong Zhou.
  In PLDI'02, pages 246-257, 2002. (ps, pdf)
  
  
• Collision detection using bounding boxes: Convexity helps.
  Yunhong Zhou and Subhash Suri.
  In ESA'00, LNCS 1879, pages 437-448, 2000. (ps, pdf)
  
  
• Analysis of a Bounding Box Heuristic for Object Intersection.
  Yunhong Zhou and Subhash Suri.
  Journal of the ACM, 46(6): 833-857, November, 1999. (pdf)
  An early version appeared on SODA'99, pages 830-839, 1999. (ps, pdf)
  
  
• Shape Sensitive Geometric Complexity. (ps, pdf)
  Yunhong Zhou, D.Sc. Dissertation, 2000.
  Also appears as Washington University in St. Louis Computer Science Department Technical Report WUCS-00-25, 2000.
  
  

click here to view some unpublished and fun results.