Perfect hash function: Difference between revisions

Content deleted Content added
replace Range (mathematics) (a redirect to a disambig page) with plain english word -- not being used in a technical sense here
Citation bot (talk | contribs)
Alter: pages. Add: citeseerx. Removed URL that duplicated unique identifier. Formatted dashes. | You can use this bot yourself. Report bugs here. | Activated by Headbomb | via #UCB_webform
Line 81:
| title = Algorithms—ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009, Proceedings
| volume = 5757
| year = 2009| citeseerx = 10.1.1.568.130
| url = http://cmph.sourceforge.net/papers/esa09.pdf
}}.</ref> The best currently known minimal perfect hashing schemes can be represented using less than 1.56 bits/key if given enough time.
<ref name="RecSplit">{{citation
Line 90 ⟶ 91:
| contribution-url = https://arxiv.org/abs/1910.06416
| doi = 10.1137/1.9781611976007.14
| pages = 175-185175–185
| series = [[Proceedings]]
| title = 2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)
| year = 2020
| url = https://epubs.siam.org/doi/pdf/10.1137/1.9781611976007.14
| doi-access = free
}}.</ref>