Results 61 to 70 of about 76,072 (189)

Finding succinct ordered minimal perfect hashing functions

open access: yes, 1992
An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused, and the data are placed in the table in order. A new method for creating ordered minimal perfect hashing functions is presented.
Seiden, Steven S., Hirschberg, Daniel S.
openaire   +1 more source

GPU Exploration of Two-Player Games with Perfect Hash Functions

open access: diamond, 2010
Stefan Edelkamp   +2 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy