# Yunhong Zhou

According to our database

Collaborative distances:

^{1}, Yunhong Zhou authored at least 38 papers between 1999 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Click Feedback-Aware Query Recommendation Using Adversarial Examples.

Proceedings of the World Wide Web Conference, 2019

2018

The Design and Implementation of Control Strategy and Power Modular for STATCOM Application.

Proceedings of the 6th International Conference on Information Technology: IoT and Smart City, 2018

2014

Optimal reserve prices in weighted GSP auctions.

Electronic Commerce Research and Applications, 2014

2012

On the convergence and robustness of reserve pricing in keyword auctions.

Proceedings of the Fourteenth International Conference on Electronic Commerce, 2012

2010

Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets.

Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010

2009

Efficiently Generating k-Best Solutions to Procurement Auctions.

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding.

Proceedings of the 17th International Conference on World Wide Web, 2008

Budget constrained bidding in keyword auctions and online knapsack problems.

Proceedings of the 17th International Conference on World Wide Web, 2008

Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems.

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

One-Class Collaborative Filtering.

Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), 2008

Large-Scale Parallel Collaborative Filtering for the Netflix Prize.

Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007

Experimental Evaluation of Parametric Max-Flow Algorithms.

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Vindictive bidding in keyword auctions.

Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, 2007

2006

Denali: A practical algorithm for generating optimal code.

ACM Trans. Program. Lang. Syst., 2006

Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems.

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Balancing Applied to Maximum Network Flow Problems.

Proceedings of the Algorithms, 2006

2005

Value-maximizing deadline scheduling and its application to animation rendering.

Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Deadline scheduling for animation rendering.

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

An Extended Evaluation of Two-Phase Scheduling Methods for Animation Rendering.

Proceedings of the Job Scheduling Strategies for Parallel Processing, 2005

Interval Subset Sum and Uniform-Price Auction Clearing.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Server Allocation Algorithms for Tiered Systems.

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Selfish load balancing and atomic congestion games.

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Uncoordinated Load Balancing and Congestion Games in P2P Systems.

Proceedings of the Peer-to-Peer Systems III, Third International Workshop, 2004

Range counting over multidimensional data streams.

Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Congestion Games, Load Balancing, and Price of Anarchy.

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, 2004

2003

TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility.

ACM Trans. Graph., 2003

A Constant Bound for Geometric Permutations of Disjoint Unit Balls.

Discrete & Computational Geometry, 2003

Bandwidth-Constrained Allocation in Grid Computing.

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

On the complexity of distance-based evolutionary tree reconstruction.

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions.

SIAM J. Comput., 2002

Using Data Groups to Specify and Check Side Effects.

Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2002

2001

Shape sensitive geometric permutations.

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Geometric permutations of balls with bounded size disparity.

Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000

Algorithms for minimum volume enclosing simplex in R

^{3}.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Surplus Equivalence of Leveled Commitment Contracts.

Proceedings of the 4th International Conference on Multi-Agent Systems, 2000

Collision Detection Using Bounding Boxes: Convexity Helps.

Proceedings of the Algorithms, 2000

1999

Analysis of a Bounding Box Heuristic for Object Intersection.

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999