Sciweavers

41 search results - page 9 / 9
» Union-Find with Constant Time Deletions
Sort
View
ANCS
2005
ACM
13 years 11 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley