Frederick V. Qiu

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

The k-Fold Matroid Secretary Problem.

Rishi Gujjar, Kevin Hua, Robert Kleinberg, Frederick V. Qiu

Proceedings of the 2026 Symposium on Simplicity in Algorithms, 2026

The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders.

Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang

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

2025

The <i>k</i>-Fold Matroid Secretary Problem.

Rishi Gujjar, Kevin Hua, Robert Kleinberg, Frederick V. Qiu

CoRR, December, 2025

2024

Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation Guarantees.

Frederick V. Qiu, S. Matthew Weinberg

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024