A Letter-oriented Minimal Perfect Hashing Scheme | Zendy

ChiaChen Chang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Letter-oriented Minimal Perfect Hashing Scheme

Author(s) -

ChiaChen Chang

Publication year - 1986

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/29.3.277

Subject(s) - perfect hash function , hash function , computer science , ascii , dynamic perfect hashing , pascal (unit) , identifier , universal hashing , hash table , theoretical computer science , algorithm , programming language , double hashing

[[abstract]]In this paper, we shall describe a minimal perfect hashing scheme suitable for letter-oriented keys. We successfully applied this minimal perfect hashing function to four non-trivial set of keys: 12 months in English, 34 non-printable ASCII identifiers, 31 most frequently used English words and 36 Pascal reserved words.[[fileno]]2030256010018[[department]]資訊工程學

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research