Ruiquan Gao

Orcid: 0009-0006-9837-8598

Affiliations:
  • Stanford University, Stanford, CA, USA
  • Tsinghua University, Beijing, China


According to our database1, Ruiquan Gao authored at least 9 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
An Improved Greedy Approximation for (Metric) <i>k</i>-Means.
CoRR, May, 2026

A (4+ϵ)-Approximation for Euclidean k-Means via Non-monotone Dual-Fitting.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2025
High-to-Low Dimensional PPA-completeness: Borsuk-Ulam, Tucker, Consensus Halving, and Ham Sandwich.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

An Improved Greedy Approximation for (Metric) k-Means.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
Parallel Sampling via Counting.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Improved Approximations for Ultrametric Violation Distance.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Practical algorithms and experimentally validated incentives for equilibrium-based fair division (A-CEEI).
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2021
Improved Online Correlated Selection.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021


  Loading...