連想値を用いるハッシング関数について
スポンサーリンク
概要
- 論文の詳細を見る
A new type of hashing functions which make use of associated values of keys is introduced. Necessary and sufficient conditions of minimality and perfectness of such functions are presented. A similar condition for Cichelli's hashing functions is also presented. The time complexities of deciding the perfectness and the minimality are discussed. The cost of our functions is numerically evaluated.
- 九州大学大学院総合理工学研究科の論文
- 1982-06-30
九州大学大学院総合理工学研究科 | 論文
- 汎用マイクロプロセッサを用いたDatarol-IIプロセッサエレメントにおける細粒度スレッド処理機構
- 体積法による高圧下のガラス転移の研究
- Synthesis of 3,4-Dibromo-2,5-bis-substituted Thiophenes
- Reaction of 3a, 5, 6a-Tripheny1-3, 3a-dihydro-2H-furo[3,2-b]-pyrrole-2,6 (6aH)-dione with Hydrazine, Phenylhydrazine, and Benzoylhydrazine
- Pressure Effect on the Cycloaddition of Tropone to 2,3-Dihydrofuran