[{"doi":"10.1145/1582716.1582741","_version":5,"author":[{"last_name":"Jacob","full_name":"Jacob, Riko","first_name":"Riko"},{"full_name":"W. Richa, Andrea","first_name":"Andrea","last_name":"W. Richa"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Täubig, Hanjo","first_name":"Hanjo","last_name":"Täubig"}],"type":"conference","user_id":"15504","_id":"1932","citation":{"ieee":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “A distributed polylogarithmic time algorithm for self-stabilizing skip graphs,” in <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 2009, pp. 131--140.","apa":"Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i> (pp. 131--140). <a href=\"https://doi.org/10.1145/1582716.1582741\">https://doi.org/10.1145/1582716.1582741</a>","mla":"Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 2009, pp. 131--140, doi:<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>.","ama":"Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In: <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>. ; 2009:131--140. doi:<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>","short":"R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140.","chicago":"Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.” In <i>Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009</i>, 131--140, 2009. <a href=\"https://doi.org/10.1145/1582716.1582741\">https://doi.org/10.1145/1582716.1582741</a>.","bibtex":"@inproceedings{Jacob_W. Richa_Scheideler_Schmid_Täubig_2009, title={A distributed polylogarithmic time algorithm for self-stabilizing skip graphs}, DOI={<a href=\"https://doi.org/10.1145/1582716.1582741\">10.1145/1582716.1582741</a>}, booktitle={Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009}, author={Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2009}, pages={131--140} }"},"creator":{"login":"florida","id":"15504"},"page":"131--140","date_created":"2018-03-29T09:16:22Z","year":"2009","publication":"Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009","status":"public","date_updated":"2019-01-03T13:12:30Z","title":"A distributed polylogarithmic time algorithm for self-stabilizing skip graphs","publication_identifier":{"isbn":["978-1-60558-396-9"]},"department":[{"tree":[{"_id":"7"},{"_id":"34"},{"_id":"44"},{"_id":"43"}],"_id":"79"}]}]