{"file":[{"file_size":315843,"creator":"florida","file_id":"1268","content_type":"application/pdf","date_updated":"2018-03-15T09:09:29Z","success":1,"relation":"main_file","date_created":"2018-03-15T09:09:29Z","file_name":"574-tiara.pdf","access_level":"closed"}],"publication":"Theoretical Computer Science","file_date_updated":"2018-03-15T09:09:29Z","publisher":"Elsevier","author":[{"last_name":"Clouser","full_name":"Clouser, Thomas","first_name":"Thomas"},{"last_name":"Nesterenko","first_name":"Mikhail","full_name":"Nesterenko, Mikhail"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"date_created":"2017-10-17T12:42:44Z","has_accepted_license":"1","status":"public","abstract":[{"lang":"eng","text":"We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization."}],"user_id":"477","ddc":["040"],"page":"18-35","citation":{"short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” Theoretical Computer Science, pp. 18–35, 2012.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, 2012, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079.","apa":"Clouser, T., Nesterenko, M., & Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35. https://doi.org/10.1016/j.tcs.2011.12.079","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science. 2012:18-35. doi:10.1016/j.tcs.2011.12.079","bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={10.1016/j.tcs.2011.12.079}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079."},"type":"journal_article","year":"2012","_id":"574","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"title":"Tiara: A self-stabilizing deterministic skip list and skip graph","date_updated":"2022-01-06T07:02:38Z","doi":"10.1016/j.tcs.2011.12.079"}