book chapter · Lecture notes in computer science · 2012

Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems

Sebastian Kniesburges, Christian Scheideler

Cited by 0Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. Lecture notes in computer science, 435–436. https://doi.org/10.1007/978-3-642-33651-5_45

MLA 9

Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Lecture notes in computer science, 2012, pp. 435–36, https://doi.org/10.1007/978-3-642-33651-5_45.

Chicago

Kniesburges, Sebastian, and Christian Scheideler. 2012. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Lecture notes in computer science: 435–36. https://doi.org/10.1007/978-3-642-33651-5_45.

Harvard

Kniesburges, S. and Scheideler, C. (2012) ‘Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems’, Lecture notes in computer science, pp. 435–436. Available at: https://doi.org/10.1007/978-3-642-33651-5_45.

BibTeX

@incollection{kniesburges2012brief,
  title = {{Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}},
  author = {Kniesburges, Sebastian and Scheideler, Christian},
  booktitle = {Lecture notes in computer science},
  pages = {435--436},
  year = {2012},
  doi = {10.1007/978-3-642-33651-5_45}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.