Pinyan Lu
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 5 in the filters
on a stage with
- Tao Xiaoonce
- Yaonan Jinonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Learning Reserve Prices in Second-Price Auctions | ITCS 2023 | 2023-01-10 |
Proves that learning an optimal anonymous reserve for second-price auctions needs nearly-tight sample complexity equal to prior Myerson bounds while crucially… | ||
| Counting Independent Sets and Colorings on Almost Every Random Regular Bipartite Graph | Deterministic Counting, Probability, and Zeros of Partition Functions (Simons Institute workshop, 2019) | 2019-03-18 |
Shows a deterministic FPTAS for counting independent sets and q‑colorings on almost every random Δ‑regular bipartite graph when Δ is sufficiently large (Δ is a… | ||
| The Complexity of Approximating Small Degree Boolean #CSP | The Classification Program of Counting Complexity | 2016-03-28 |
Pinyan Lu, Shanghai University of Finance and Economics
The Classification Program of Counting Complexity
https://simons.berkeley.edu/talks/pinyan-lu-2016-03-30 | ||
| FPTAS for #BIS with Degree Bounds on One Side | Approximate Counting, Markov Chains and Phase Transitions | 2016-02-22 |
Pinyan Lu, Shanghai University of Finance and Economics
Approximate Counting, Markov Chains and Phase… | ||
| Approximate Counting via Correlation Decay | Geometric Complexity Theory 2014 | 2014-09-15 |
Gives a concrete criterion (the uniqueness/contracting condition) that guarantees a deterministic FPTAS for partition functions and vertex marginals of… | ||
| nothing matches | ||