<<The>> hash function and the principle of duality
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F01%3A00065360" target="_blank" >RIV/49777513:23520/01:00065360 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
<<The>> hash function and the principle of duality
Original language description
An algorithm complexity is a very crucial issue in the algorithm design, expecially if large data sets are to be processed. Data search is very often used in many algorithms and hash function use gives us a possibility to speed up the process significantly. Nevertheless, it is very difficult do design a good hash function expecially for geometric applications. This paper describes a new hash function, its behaviour and use for non-trivial problems. Some problems can be solved effectively using the principle of duality and the hash data structure.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
<<The>> hash function and the principle of duality
ISBN
0769510078
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
IEEE Computer Society
Place of publication
Los Alamitos
Event location
Los Alamitos
Event date
Jan 1, 2001
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—