{"department":[{"_id":"79"}],"title":"Tiara: A self-stabilizing deterministic skip list and skip graph","_id":"574","citation":{"mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, Elsevier, 2012, pp. 18–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>. 2012:18-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>","bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” <i>Theoretical Computer Science</i>, pp. 18–35, 2012.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, 2012, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>.","short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.","apa":"Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>"},"user_id":"477","status":"public","year":"2012","publisher":"Elsevier","author":[{"full_name":"Clouser, Thomas","last_name":"Clouser","first_name":"Thomas"},{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"Theoretical Computer Science","type":"journal_article","date_updated":"2022-01-06T07:02:38Z","file_date_updated":"2018-03-15T09:09:29Z","date_created":"2017-10-17T12:42:44Z","has_accepted_license":"1","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"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.","lang":"eng"}],"doi":"10.1016/j.tcs.2011.12.079","file":[{"file_size":315843,"creator":"florida","date_created":"2018-03-15T09:09:29Z","date_updated":"2018-03-15T09:09:29Z","relation":"main_file","content_type":"application/pdf","access_level":"closed","file_name":"574-tiara.pdf","file_id":"1268","success":1}],"page":"18-35","ddc":["040"]}