The following pages link to Zhi-Yi Huang (Q1933051):
Displayed 44 items.
- Item:Q1933051 (redirect page) (← links)
- Fast multipole boundary element analysis of 2D viscoelastic composites with imperfect interfaces (Q617272) (← links)
- Item:Q1933051 (redirect page) (← links)
- Modeling of multi-inclusion composites with interfacial imperfections: micromechanical and numerical simulations (Q987254) (← links)
- Staggered car-following induced by lateral separation effects in traffic flow (Q1933052) (← links)
- A fast multipole boundary element method for 2D viscoelastic problems (Q1944399) (← links)
- Micromechanics-based analysis for predicting asphalt concrete modulus (Q1956404) (← links)
- Welfare maximization with production costs: a primal dual approach (Q2278952) (← links)
- Private Matchings and Allocations (Q2832895) (← links)
- Testing Coverage Functions (Q2843245) (← links)
- Recognizing Coverage Functions (Q2944461) (← links)
- On Sampling from Multivariate Distributions (Q3088131) (← links)
- Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (Q3638059) (← links)
- Reconstructing Numbers from Pairwise Function Values (Q3652200) (← links)
- Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms (Q4554950) (← links)
- Principal Component Analysis Based Filtering for Scalable, High Precision k-NN Search (Q4567299) (← links)
- Jointly Private Convex Programming (Q4575620) (← links)
- (Q4607902) (← links)
- Online Submodular Maximization with Free Disposal (Q4629970) (← links)
- Making the Most of Your Samples (Q4641589) (← links)
- Online Vertex-Weighted Bipartite Matching (Q4972684) (← links)
- (Q5002758) (← links)
- (Q5009506) (← links)
- (Q5091232) (← links)
- Fully Online Matching (Q5133972) (← links)
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue (Q5145000) (← links)
- Algorithmic Price Discrimination (Q5146940) (← links)
- Dynamic and Non-uniform Pricing Strategies for Revenue Maximization (Q5171215) (← links)
- Settling the sample complexity of single-parameter revenue maximization (Q5212807) (← links)
- How to match when all vertices arrive online (Q5230273) (← links)
- Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model (Q5236370) (← links)
- Private matchings and allocations (Q5259535) (← links)
- The sample complexity of auctions with side information (Q5361849) (← links)
- Welfare Maximization with Production Costs: A Primal Dual Approach (Q5363021) (← links)
- (Q5365076) (← links)
- (Q5381115) (← links)
- Exploiting Metric Structure for Efficient Private Query Release (Q5383999) (← links)
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms (Q5384045) (← links)
- Dynamic and Nonuniform Pricing Strategies for Revenue Maximization (Q5408772) (← links)
- Algorithms for the Generalized Sorting Problem (Q5494998) (← links)
- Simple and Nearly Optimal Multi-Item Auctions (Q5741749) (← links)
- Online Combinatorial Optimization Problems with Non-linear Objectives (Q5864852) (← links)
- The power of multiple choices in online stochastic matching (Q6083465) (← links)
- Online stochastic matching, poisson arrivals, and the natural linear program (Q6087036) (← links)