Chaoping Xing, Chen Yuan. Beating the probabilistic lower bound on perfect hashing. Electronic Colloquium on Computational Complexity (ECCC), 26:108, 2019. [doi]
@article{XingY19-0,
title = {Beating the probabilistic lower bound on perfect hashing},
author = {Chaoping Xing and Chen Yuan},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/108},
researchr = {https://researchr.org/publication/XingY19-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {26},
pages = {108},
}