National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
Representation of chains in hash tables
Urbánek, Vít ; Koubková, Alena (advisor) ; Koubek, Václav (referee)
The essential problem of hashing is a solving of collisions of elements. One of possible solutions of this problem is chaining of colliding elements. The chains are stored inside or outside the table and they are usually represented as unsorted linear lists. The aim of this thesis is to design some alternative structures (sorted linear lists, self-organizing linear lists, etc.) for representation of colliding elements, to implement them into known algorithms and experimentally evaluate their effect on efficiency of dictionary operations (Insert, Member, Delete).
Representation of chains in hash tables
Urbánek, Vít ; Koubek, Václav (referee) ; Koubková, Alena (advisor)
The essential problem of hashing is a solving of collisions of elements. One of possible solutions of this problem is chaining of colliding elements. The chains are stored inside or outside the table and they are usually represented as unsorted linear lists. The aim of this thesis is to design some alternative structures (sorted linear lists, self-organizing linear lists, etc.) for representation of colliding elements, to implement them into known algorithms and experimentally evaluate their effect on efficiency of dictionary operations (Insert, Member, Delete).

See also: similar author names
4 Urbánek, Vladimír
7 Urbánek, Vojtěch
1 Urbánek, Václav
Interested in being notified about new results for this query?
Subscribe to the RSS feed.