Beating the Probabilistic Lower Bound on q-Perfect Hashing

Chaoping Xing, Chen Yuan 0003. Beating the Probabilistic Lower Bound on q-Perfect Hashing. Combinatorica, 43(2):347-366, April 2023. [doi]

@article{XingY23-0,
  title = {Beating the Probabilistic Lower Bound on q-Perfect Hashing},
  author = {Chaoping Xing and Chen Yuan 0003},
  year = {2023},
  month = {April},
  doi = {10.1007/s00493-023-00014-x},
  url = {https://doi.org/10.1007/s00493-023-00014-x},
  researchr = {https://researchr.org/publication/XingY23-0},
  cites = {0},
  citedby = {0},
  journal = {Combinatorica},
  volume = {43},
  number = {2},
  pages = {347-366},
}