Skip Navigation

The Computer Journal 1986 29(3):277-281; doi:10.1093/comjnl/29.3.277
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (9)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chang, C. C.
Right arrow Articles by Lee, R. C. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Letter-oriented Minimal Perfect Hashing Scheme

C. C. Chang1 * § and R. C. T. Lee2 ¶

1 Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan 400, Republic of China, 2 National Tsing Hua University, Hsinchu, Taiwan 300, Republic of China and Academia Sinica, Taipei, Taiwan 115, Republic of China

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.

Received September 1984.

* To whom correspondence should be addressed.

§ Institute of Applied Mathematics, National Chung Hsing University, Taichung, Taiwan 400, Republic of China

National Tsing Hua University, Hsinchu, Taiwan 300, and Academia Sinica, Taipei, Taiwan 115, Republic of China


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.