Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems

S. Kniesburges, C. Scheideler, in:, WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170–181.

Download
No fulltext has been uploaded.
Conference Paper
Author
;
Publishing Year
Proceedings Title
WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings
Volume
6552
Page
170--181
LibreCat-ID

Cite this

Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings.Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170-181. doi:10.1007/978-3-642-19094-0_18.
Kniesburges, S., & Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170–181). Springer. http://doi.org/10.1007/978-3-642-19094-0_18
@inbook{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}, volume={6552}, DOI={10.1007/978-3-642-19094-0_18}, booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170–181}, collection={Lecture Notes in Computer Science}}
Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 6552:170–81. Lecture Notes in Computer Science. Springer, 2011. doi:10.1007/978-3-642-19094-0_18.
S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, 2011, vol. 6552, pp. 170–181.
Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Vol. 6552. Springer, 2011. 170–181. Web. Lecture Notes in Computer Science.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar
ISBN Search