[{"publisher":"Springer","_id":"1899","series_title":"Lecture Notes in Computer Science","page":"170--181","volume":6552,"doi":"10.1007/978-3-642-19094-0_18","user_id":"15504","publication_identifier":{"isbn":["978-3-642-19093-3"]},"author":[{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"year":"2011","title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","status":"public","intvolume":"      6552","date_updated":"2022-01-06T06:53:56Z","date_created":"2018-03-28T07:17:05Z","department":[{"_id":"79"}],"type":"conference","citation":{"ieee":"S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, 2011, vol. 6552, pp. 170--181.","apa":"Kniesburges, S., &#38; Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i> (Vol. 6552, pp. 170--181). Springer. <a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">https://doi.org/10.1007/978-3-642-19094-0_18</a>","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, vol. 6552, Springer, 2011, pp. 170--181, doi:<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>.","bibtex":"@inproceedings{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={<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>}, 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} }","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>","short":"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.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, 6552:170--181. Lecture Notes in Computer Science. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">https://doi.org/10.1007/978-3-642-19094-0_18</a>."},"publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings"}]