| 2008 |
| 39 | EE | Yunhong Zhou,
Dennis Wilkinson,
Robert Schreiber,
Rong Pan:
Large-Scale Parallel Collaborative Filtering for the Netflix Prize.
AAIM 2008: 337-348 |
| 38 | EE | Rong Pan,
Yunhong Zhou,
Bin Cao,
Nathan Nan Liu,
Rajan M. Lukose,
Martin Scholz,
Qiang Yang:
One-Class Collaborative Filtering.
ICDM 2008: 502-511 |
| 37 | EE | Yunhong Zhou,
Deeparnab Chakrabarty,
Rajan M. Lukose:
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems.
WINE 2008: 566-576 |
| 36 | EE | Yunhong Zhou,
Victor Naroditskiy:
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding.
WWW 2008: 1175-1176 |
| 35 | EE | Yunhong Zhou,
Deeparnab Chakrabarty,
Rajan M. Lukose:
Budget constrained bidding in keyword auctions and online knapsack problems.
WWW 2008: 1243-1244 |
| 34 | EE | Anshul Kothari,
Subhash Suri,
Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing.
Algorithmica 52(4): 487-501 (2008) |
| 2007 |
| 33 | EE | Chiranjeeb Buragohain,
Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.
COCOON 2007: 210-221 |
| 32 | EE | Yunhong Zhou,
Rajan M. Lukose:
Vindictive bidding in keyword auctions.
ICEC 2007: 141-146 |
| 31 | EE | Maxim A. Babenko,
Jonathan Derryberry,
Andrew V. Goldberg,
Robert Endre Tarjan,
Yunhong Zhou:
Experimental Evaluation of Parametric Max-Flow Algorithms.
WEA 2007: 256-269 |
| 30 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Selfish Load Balancing and Atomic Congestion Games.
Algorithmica 47(1): 79-96 (2007) |
| 29 | EE | Kamalika Chaudhuri,
Anshul Kothari,
Rudi Pendavingh,
Ram Swaminathan,
Robert Endre Tarjan,
Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems.
Algorithmica 48(2): 129-146 (2007) |
| 2006 |
| 28 | EE | Robert Endre Tarjan,
Julie Ward,
Bin Zhang,
Yunhong Zhou,
Jia Mao:
Balancing Applied to Maximum Network Flow Problems.
ESA 2006: 612-623 |
| 27 | EE | Yunhong Zhou:
Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.
ISAAC 2006: 494-506 |
| 26 | EE | Rajeev Joshi,
Greg Nelson,
Yunhong Zhou:
Denali: A practical algorithm for generating optimal code.
ACM Trans. Program. Lang. Syst. 28(6): 967-989 (2006) |
| 25 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Range Counting over Multidimensional Data Streams.
Discrete & Computational Geometry 36(4): 633-655 (2006) |
| 2005 |
| 24 | EE | Anshul Kothari,
Subhash Suri,
Yunhong Zhou:
Interval Subset Sum and Uniform-Price Auction Clearing.
COCOON 2005: 608-620 |
| 23 | EE | Kamalika Chaudhuri,
Anshul Kothari,
Rudi Pendavingh,
Ram Swaminathan,
Robert Endre Tarjan,
Yunhong Zhou:
Server Allocation Algorithms for Tiered Systems.
COCOON 2005: 632-643 |
| 22 | EE | Yunhong Zhou,
Terence Kelly,
Janet L. Wiener,
Eric Anderson:
An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering.
JSSPP 2005: 123-145 |
| 21 | EE | Eric Anderson,
Dirk Beyer,
Kamalika Chaudhuri,
Terence Kelly,
Norman Salazar,
Cipriano A. Santos,
Ram Swaminathan,
Robert Endre Tarjan,
Janet L. Wiener,
Yunhong Zhou:
Deadline scheduling for animation rendering.
SIGMETRICS 2005: 384-385 |
| 20 | EE | Eric Anderson,
Dirk Beyer,
Kamalika Chaudhuri,
Terence Kelly,
Norman Salazar,
Cipriano A. Santos,
Ram Swaminathan,
Robert Endre Tarjan,
Janet L. Wiener,
Yunhong Zhou:
Value-maximizing deadline scheduling and its application to animation rendering.
SPAA 2005: 299-308 |
| 2004 |
| 19 | EE | Anshul Kothari,
Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Congestion Games, Load Balancing, and Price of Anarchy.
CAAN 2004: 13-27 |
| 18 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Uncoordinated Load Balancing and Congestion Games in P2P Systems.
IPTPS 2004: 123-130 |
| 17 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Selfish load balancing and atomic congestion games.
SPAA 2004: 188-195 |
| 16 | EE | Subhash Suri,
Csaba D. Tóth,
Yunhong Zhou:
Range counting over multidimensional data streams.
Symposium on Computational Geometry 2004: 160-169 |
| 2003 |
| 15 | EE | Valerie King,
Li Zhang,
Yunhong Zhou:
On the complexity of distance-based evolutionary tree reconstruction.
SODA 2003: 444-453 |
| 14 | EE | Anshul Kothari,
Subhash Suri,
Yunhong Zhou:
Bandwidth-Constrained Allocation in Grid Computing.
WADS 2003: 67-78 |
| 13 | EE | Tamara Munzner,
François Guimbretière,
Serdar Tasiran,
Li Zhang,
Yunhong Zhou:
TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility.
ACM Trans. Graph. 22(3): 453-462 (2003) |
| 12 | EE | Yunhong Zhou,
Subhash Suri:
Geometric permutations of balls with bounded size disparity.
Comput. Geom. 26(1): 3-20 (2003) |
| 11 | EE | Meir Katchalski,
Subhash Suri,
Yunhong Zhou:
A Constant Bound for Geometric Permutations of Disjoint Unit Balls.
Discrete & Computational Geometry 29(2): 161-173 (2003) |
| 2002 |
| 10 | EE | K. Rustan M. Leino,
Arnd Poetzsch-Heffter,
Yunhong Zhou:
Using Data Groups to Specify and Check Side Effects.
PLDI 2002: 246-257 |
| 9 | EE | Tuomas Sandholm,
Yunhong Zhou:
Surplus equivalence of leveled commitment contracts.
Artif. Intell. 142(2): 239-264 (2002) |
| 8 | EE | Yunhong Zhou,
Subhash Suri:
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions.
SIAM J. Comput. 31(5): 1339-1357 (2002) |
| 2001 |
| 7 | EE | Yunhong Zhou,
Subhash Suri:
Geometric permutations of balls with bounded size disparity.
CCCG 2001: 177-180 |
| 6 | EE | Yunhong Zhou,
Subhash Suri:
Shape sensitive geometric permutations.
SODA 2001: 234-243 |
| 2000 |
| 5 | | Yunhong Zhou,
Subhash Suri:
Collision Detection Using Bounding Boxes: Convexity Helps.
ESA 2000: 437-448 |
| 4 | EE | Tuomas Sandholm,
Yunhong Zhou:
Surplus Equivalence of Leveled Commitment Contracts.
ICMAS 2000: 247-254 |
| 3 | EE | Yunhong Zhou,
Subhash Suri:
Algorithms for minimum volume enclosing simplex in R3.
SODA 2000: 500-509 |
| 1999 |
| 2 | EE | Yunhong Zhou,
Subhash Suri:
Analysis of a Bounding Box Heuristic for Object Intersection.
SODA 1999: 830-839 |
| 1 | EE | Yunhong Zhou,
Subhash Suri:
Analysis of a bounding box heuristic for object intersection.
J. ACM 46(6): 833-857 (1999) |