Renfei Zhou

Orcid: 0000-0002-0095-0626

According to our database1, Renfei Zhou authored at least 15 papers between 2023 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Optimal Static Dictionary with Worst-Case Constant Query Time.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Optimal Non-oblivious Open Addressing.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

More Asymmetry Yields Faster Matrix Multiplication.
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Optimal Static Fully Indexable Dictionaries.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation.
Proceedings of the ACM on Web Conference 2024, 2024

Listing 6-Cycles.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

New Bounds for Matrix Multiplication: from Alpha to Omega.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Dynamic Dictionary with Subconstant Wasted Bits per Key.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Tight Bounds for Classical Open Addressing.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Bidder Selection Problem in Position Auctions via Poisson Approximation.
CoRR, 2023

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Dynamic "Succincter".
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Faster Matrix Multiplication via Asymmetric Hashing.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023


  Loading...