Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Chaoping Xing, Chen Yuan 0003. Beating the Probabilistic Lower Bound on q-Perfect Hashing. Combinatorica, 43(2):347-366, April 2023. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Beating the probabilistic lower bound on perfect hashingChaoping Xing, Chen Yuan. eccc, 26:108, 2019. [doi] Beating the probabilistic lower bound on perfect hashingChaoping Xing, Chen Yuan 0003. soda 2022: 33-41 [doi] Beating the probabilistic lower bound on perfect hashingChaoping Xing, Chen Yuan 0003. soda 2021: 33-41 [doi]
The following publications are possibly variants of this publication: