๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] WALCOM: Algorithms and Computation Volume 6552 || Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems

โœ Scribed by Katoh, Naoki; Kumar, Amit


Book ID
120459257
Publisher
Springer Berlin Heidelberg
Year
2011
Weight
273 KB
Category
Article
ISBN
3642190944

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Agen
โœ Beneventano, Domenico; Despotovic, Zoran; Guerra, Francesco; Joseph, Sam; Moro, ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 269 KB

This Book Constitutes The Thoroughly Refereed Post-workshop Proceedings Of The 7th International Workshop On Agents And Peer-to-peer Computing, Ap2pc 2008, Held In Estoril, Portugal, In May 2008 And The 8th International Workshop On Agents And Peer-to-peer Computing, Ap2pc 2009, Held In Budapest, Hu

[Lecture Notes in Computer Science] Data
โœ Ng, Wee Siong; Ooi, Beng-Chin; Ouksel, Aris M.; Sartori, Claudio ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 129 KB

Peer-to-peer (P2P) computing promises to o?er exciting new possibilities in d- tributed information processing and database technologies. The realization of this promise lies fundamentally in the availability of enhanced services such as structured ways for classifying and registering shared informa