default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRenfei Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]Michael A. Bender, William Kuszmaul, Renfei Zhou:
Tight Bounds for Classical Open Addressing. FOCS 2024: 636-657- [c8]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou
:
Dynamic Dictionary with Subconstant Wasted Bits per Key. SODA 2024: 171-207 - [c7]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
New Bounds for Matrix Multiplication: from Alpha to Omega. SODA 2024: 3792-3835 - [c6]Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
Listing 6-Cycles. SOSA 2024: 19-27 - [c5]Nikolai Gravin, Yixuan Even Xu, Renfei Zhou:
Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation. WWW 2024: 89-98 - [i11]Josh Alman, Ran Duan, Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
More Asymmetry Yields Faster Matrix Multiplication. CoRR abs/2404.16349 (2024) - [i10]Michael A. Bender, William Kuszmaul, Renfei Zhou:
Tight Bounds for Classical Open Addressing. CoRR abs/2409.11280 (2024) - [i9]William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou:
Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. CoRR abs/2410.10002 (2024) - 2023
- [c4]Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou:
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. ESA 2023: 80:1-80:15 - [c3]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic "Succincter". FOCS 2023: 1715-1733 - [c2]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. FOCS 2023: 1842-1862 - [c1]Ran Duan, Hongxun Wu, Renfei Zhou:
Faster Matrix Multiplication via Asymmetric Hashing. FOCS 2023: 2129-2138 - [i8]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. CoRR abs/2306.02253 (2023) - [i7]Nick Gravin, Yixuan Even Xu, Renfei Zhou:
Bidder Selection Problem in Position Auctions via Poisson Approximation. CoRR abs/2306.10648 (2023) - [i6]Virginia Vassilevska Williams, Yinzhan Xu, Zixuan Xu, Renfei Zhou:
New Bounds for Matrix Multiplication: from Alpha to Omega. CoRR abs/2307.07970 (2023) - [i5]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic "Succincter". CoRR abs/2309.12950 (2023) - [i4]Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
Listing 6-Cycles. CoRR abs/2310.14575 (2023) - [i3]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic Dictionary with Subconstant Wasted Bits per Key. CoRR abs/2310.20536 (2023) - 2022
- [i2]Ran Duan, Hongxun Wu, Renfei Zhou:
Faster Matrix Multiplication via Asymmetric Hashing. CoRR abs/2210.10173 (2022) - [i1]Jingxun Liang, Zhihao Gavin Tang, Yixuan Even Xu, Yuhao Zhang, Renfei Zhou:
On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching. CoRR abs/2210.10370 (2022)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
