--- res: bibo_abstract: - 'This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.@eng' bibo_authorlist: - foaf_Person: foaf_givenName: Stefan foaf_name: Schmid, Stefan foaf_surname: Schmid - foaf_Person: foaf_givenName: Chen foaf_name: Avin, Chen foaf_surname: Avin - foaf_Person: foaf_givenName: Christian foaf_name: Scheideler, Christian foaf_surname: Scheideler foaf_workInfoHomepage: http://www.librecat.org/personId=20792 - foaf_Person: foaf_givenName: Bernhard foaf_name: Häupler, Bernhard foaf_surname: Häupler - foaf_Person: foaf_givenName: Zvi foaf_name: Lotker, Zvi foaf_surname: Lotker bibo_doi: 10.1007/978-3-642-33651-5_47 dct_date: 2012^xs_gYear dct_title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures@' ...