Author of the publication

Divide and discriminate: algorithm for deterministic and fast hash lookups.

, , , and . ANCS, page 133-142. ACM, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Network Topology Discovery Based on a Finite Set of Hypotheses., , , , and . GLOBECOM, page 2409-2413. IEEE, (2008)Blooming Trees for Minimal Perfect Hashing., , , , and . GLOBECOM, page 1567-1571. IEEE, (2008)Noise Reduction Techniques for Network Topology Discovery., , , , and . PIMRC, page 1-5. IEEE, (2007)Enhancing Counting Bloom Filters Through Huffman-Coded Multilayer Structures., , , , and . IEEE/ACM Trans. Netw., 18 (6): 1977-1987 (2010)Achieving Perfect Hashing through an Improved Construction of Bloom Filters., , , , , and . ICC, page 1-5. IEEE, (2010)A Randomized Scheme for IP Lookup at Wire Speed on NetFPGA., , , , , and . ICC, page 1-5. IEEE, (2010)Scaling Regular Expression Matching Performance in Parallel Systems through Sampling Techniques., , , , , , and . GLOBECOM, page 1-5. IEEE, (2011)End-to-End Inference of Link Level Queueing Delay Statistics., , , , , and . GLOBECOM, page 1-6. IEEE, (2009)Network Topology Discovery through Self-Constrained Decisions., , , , , and . GLOBECOM, page 1-6. IEEE, (2009)Counting bloom filters for pattern matching and anti-evasion at the wire speed., , , , and . IEEE Netw., 23 (1): 30-35 (2009)