Divide and discriminate: algorithm for deterministic and fast hash lookups

D Ficara, S Giordano, S Kumar, B Lynch - Proceedings of the 5th ACM …, 2009 - dl.acm.org
Exact and approximate membership lookups are among the most widely used primitives in a
number of network applications. Hash tables are commonly used to implement these …
被引用次数：10 相关文章
[PDF] researchgate.net

[PDF][PDF] Divide and Discriminate: Algorithm for Deterministic and Fast Hash Lookups

D Ficara, S Giordano, S Kumar, B Lynch - 2009 - researchgate.net
Exact and approximate membership lookups are among the most widely used primitives in a
number of network applications. Hash tables are commonly used to implement these …

[引用][C] Divide and discriminate: Algorithm for deterministic and fast hash lookups

D Ficara, S Giordano, S Kumar, B Lynch - ANCS'09: Symposium on …, 2009 - arpi.unipi.it
Divide and discriminate: Algorithm for deterministic and fast hash lookups IRIS IRIS Home
Sfoglia Macrotipologie & tipologie Autore Titolo Riviste Serie IT Italiano Italiano English …
[PDF] archive.org

[PDF][PDF] Divide and Discriminate: Algorithm for Deterministic and Fast Hash Lookups

D Ficara, S Giordano, S Kumar, B Lynch - 2009 - scholar.archive.org
Exact and approximate membership lookups are among the most widely used primitives in a
number of network applications. Hash tables are commonly used to implement these …