post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

On the problem of hash-addressing collisions without a permanent array of keys

Mnatsakanov A.V., Kuznetsov A.A.

In article the problem of designing of the perfect hash-addressing for a constant set of keys is investigated. The algorithm of designing of the perfect hash-addressing as hierarchical system of Boolean functions is developed. The algorithm allows to significant reduce of volume of computing resources which is necessary for design of the perfect hash-transformation with the prescribed limit of hash-function complexity. The analysis has shown the advantages of proposed perfect hash-addressing designing algorithm in comparison to known algorithms of this problem decision.


Full text (pdf)