Sebastian Kniesburges, Christian Scheideler. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In Naoki Katoh, Amit Kumar, editors, WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings. Volume 6552 of Lecture Notes in Computer Science, pages 170-181, Springer, 2011. [doi]
@inproceedings{KniesburgesS11,
title = {Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems},
author = {Sebastian Kniesburges and Christian Scheideler},
year = {2011},
doi = {10.1007/978-3-642-19094-0_18},
url = {http://dx.doi.org/10.1007/978-3-642-19094-0_18},
tags = {source-to-source, peer-to-peer, open-source},
researchr = {https://researchr.org/publication/KniesburgesS11},
cites = {0},
citedby = {0},
pages = {170-181},
booktitle = {WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings},
editor = {Naoki Katoh and Amit Kumar},
volume = {6552},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-19093-3},
}