Frederick V. Qiu

Orcid: 0000-0001-9216-3031

According to our database1, Frederick V. Qiu authored at least 4 papers between 2024 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
The k-Fold Matroid Secretary Problem.
Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
The <i>k</i>-Fold Matroid Secretary Problem.
CoRR, December, 2025

2024
Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024


  Loading...