Corona: A stabilizing deterministic message-passing skip list
We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We pro...
Saved in:
| Published in | Theoretical computer science Vol. 512; pp. 119 - 129 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
11.11.2013
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0304-3975 1879-2294 |
| DOI | 10.1016/j.tcs.2012.08.029 |
Cover
Loading…
| Abstract | We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in a message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identifiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph. |
|---|---|
| AbstractList | We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in a message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identifiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph. |
| Author | Nor, Rizal Mohd Nesterenko, Mikhail Scheideler, Christian |
| Author_xml | – sequence: 1 givenname: Rizal Mohd surname: Nor fullname: Nor, Rizal Mohd organization: Department of Computer Science, International Islamic University Malaysia, Kuala Lumpur, Malaysia – sequence: 2 givenname: Mikhail surname: Nesterenko fullname: Nesterenko, Mikhail email: mikhail@cs.kent.edu organization: Department of Computer Science, Kent State University, Kent, OH, USA – sequence: 3 givenname: Christian surname: Scheideler fullname: Scheideler, Christian organization: Department of Computer Science, University of Paderborn, Paderborn, Germany |
| BookMark | eNp9j8tKAzEYhYMo2FYfwN28wIxJZiYXxUUp3qDgRtchk_xT_jrNlCQI-vROqSsXPZuzOHwHvjk5D2MAQm4YrRhl4nZbZZcqThmvqKoo12dkxpTUJee6OSczWtOmrLVsL8k8pS2d0koxIw-rMY7B3hXLImXb4YA_GDaFhwxxhwFTRlfsICW7gXJvUzqs6RP3xTBtV-Sit0OC679ekI-nx_fVS7l-e35dLdel41rmsgEBUPes10o45WjftUI3jXZUOe4ZiM5yZpWTrBY97bQQnlneCuul9oLX9YKw46-LY0oRerOPuLPx2zBqDv5mayZ_c_A3VJnJf2LkP8ZhthnHkKPF4SR5fyRhUvpCiCY5hODAYwSXjR_xBP0LjkJ31g |
| CitedBy_id | crossref_primary_10_1016_j_ic_2016_12_006 crossref_primary_10_1142_S0218126618502183 crossref_primary_10_1007_s13369_016_2288_y crossref_primary_10_1145_3397190 |
| Cites_doi | 10.1145/78973.78977 10.1109/P2P.2005.34 10.1145/361179.361202 10.1007/s00446-007-0038-9 10.1142/S012962641000003X 10.1145/1290672.1290674 10.1109/TNET.2002.808407 10.1145/1835698.1835790 10.1007/978-3-642-12200-2_27 10.1145/1582716.1582741 10.1007/11558989_2 10.1145/226643.226647 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier B.V. |
| Copyright_xml | – notice: 2012 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.tcs.2012.08.029 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 129 |
| ExternalDocumentID | 10_1016_j_tcs_2012_08_029 S0304397512008055 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGHFR AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN BNPGV CITATION FGOYB G-2 HZ~ R2- SEW SSH TAE WUQ XJT ZY4 |
| ID | FETCH-LOGICAL-c297t-4e6ee3f1f986c8c0fb569449c08c2d1e6ba21a8c7136f0b966d1a256ad79d6233 |
| IEDL.DBID | IXB |
| ISSN | 0304-3975 |
| IngestDate | Sun Jul 06 05:08:31 EDT 2025 Thu Apr 24 23:04:12 EDT 2025 Fri Feb 23 02:30:25 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Self-stabilization Overlay networks Peer-to-peer networks Message-passing |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c297t-4e6ee3f1f986c8c0fb569449c08c2d1e6ba21a8c7136f0b966d1a256ad79d6233 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S0304397512008055 |
| PageCount | 11 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2012_08_029 crossref_citationtrail_10_1016_j_tcs_2012_08_029 elsevier_sciencedirect_doi_10_1016_j_tcs_2012_08_029 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-11-11 |
| PublicationDateYYYYMMDD | 2013-11-11 |
| PublicationDate_xml | – month: 11 year: 2013 text: 2013-11-11 day: 11 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2013 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Bianchi, Datta, Felber, Gradinariu (br000035) 2007 F. Kuhn, S. Schmid, R. Wattenhofer, A self-repairing peer-to-peer system resilient to dynamic adversarial churn, in: Proc. of the 4th International Workshop on Peer-To-Peer Systems (IPTPS), 2005. Ratnasamy, Francis, Handley, Karp, Schenker (br000120) 2001 C. Scheideler, R. Jacob, S. Ritscher, S. Schmid, A self-stabilizing local delaunay graph construction, in: 20th Intl. Symp. on Algorithms and Computation (ISAAC), 2009. Awerbuch, Scheideler (br000020) 2004 Curt Cramer, Thomas Fuhrmann, Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe, 2005. Bhargava, Kothapalli, Riley, Scheideler, Thober (br000030) 2004 Andersen, Balakrishnan, Kaashoek, Morris (br000010) 2001 Hérault, Lemarinier, Peres, Pilard, Beauquier (br000080) 2006; vol. 4280 R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig, A distributed polylogarithmic time algorithm for self-stabilizing skip graphs, in: Proc. of the 28th ACM Symp. on Principles of Distributed Computing (PODC), 2009, pp. 131–140. Onus, Richa, Scheideler (br000100) 2007 Rowstron, Druschel (br000125) 2001 Stoica, Morris, Liben-Nowell, Karger, Kaashoek, Dabek, Balakrishnan (br000135) 2003; 11 Pugh (br000110) 1990; 33 Dolev, Kat (br000065) 2008; 20 Onus, Richa, Scheideler (br000105) 2007 Ayman Shaker, Douglas S. Reeves, Self-stabilizing structured ring topology P2P systems, in: Proc. 5th IEEE International Conference on Peer-to-Peer Computing, 2005, pp. 39–46. Aspnes, Shah (br000015) 2007; 3 A. Berns, S. Ghosh, S. V. Pemmaraju, Brief announcement: a framework for building self-stabilizing overlay networks, in: Proc. of the 29th ACM Symp. on Principles of Distributed Computing (PODC), 2010, pp. 398–399. Chandra, Toueg (br000045) 1996; 43 Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman, Skipnet: a scalable overlay network with practical locality properties, in: USITS’03: Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems, Berkeley, CA, USA, 2003. USENIX Association, pp. 9–9. Caron, Desprez, Petit, Tedeschi (br000040) 2010; 20 Dijkstra (br000060) 1974; 17 Alima, Haridi, Ghodsi, El-Ansary, Brand (br000005) 2004; vol. 3460 Clouser, Nesterenko, Scheideler (br000050) 2008; vol. 5340 D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig, Time complexity of distributed topological self-stabilization: The case of graph linearization, 2010, pp. 294–305. Malkhi, Naor, Ratajczak (br000095) 2002 Bianchi (10.1016/j.tcs.2012.08.029_br000035) 2007 Andersen (10.1016/j.tcs.2012.08.029_br000010) 2001 Dolev (10.1016/j.tcs.2012.08.029_br000065) 2008; 20 Pugh (10.1016/j.tcs.2012.08.029_br000110) 1990; 33 Bhargava (10.1016/j.tcs.2012.08.029_br000030) 2004 Onus (10.1016/j.tcs.2012.08.029_br000105) 2007 10.1016/j.tcs.2012.08.029_br000055 Hérault (10.1016/j.tcs.2012.08.029_br000080) 2006; vol. 4280 Dijkstra (10.1016/j.tcs.2012.08.029_br000060) 1974; 17 Awerbuch (10.1016/j.tcs.2012.08.029_br000020) 2004 10.1016/j.tcs.2012.08.029_br000115 10.1016/j.tcs.2012.08.029_br000090 10.1016/j.tcs.2012.08.029_br000070 Alima (10.1016/j.tcs.2012.08.029_br000005) 2004; vol. 3460 10.1016/j.tcs.2012.08.029_br000075 10.1016/j.tcs.2012.08.029_br000130 Ratnasamy (10.1016/j.tcs.2012.08.029_br000120) 2001 Stoica (10.1016/j.tcs.2012.08.029_br000135) 2003; 11 Malkhi (10.1016/j.tcs.2012.08.029_br000095) 2002 Caron (10.1016/j.tcs.2012.08.029_br000040) 2010; 20 Rowstron (10.1016/j.tcs.2012.08.029_br000125) 2001 Onus (10.1016/j.tcs.2012.08.029_br000100) 2007 10.1016/j.tcs.2012.08.029_br000025 Aspnes (10.1016/j.tcs.2012.08.029_br000015) 2007; 3 Clouser (10.1016/j.tcs.2012.08.029_br000050) 2008; vol. 5340 Chandra (10.1016/j.tcs.2012.08.029_br000045) 1996; 43 10.1016/j.tcs.2012.08.029_br000085 |
| References_xml | – start-page: 318 year: 2004 end-page: 327 ident: br000020 article-title: The hyperring: a low-congestion deterministic data structure for distributed environments publication-title: SODA’04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms – reference: Curt Cramer, Thomas Fuhrmann, Self-stabilizing ring networks on connected graphs. Technical Report 2005-5, System Architecture Group, University of Karlsruhe, 2005. – volume: 17 start-page: 643 year: 1974 end-page: 644 ident: br000060 article-title: Self-stabilization in spite of distributed control publication-title: Communications of the ACM – start-page: 183 year: 2002 end-page: 192 ident: br000095 article-title: Viceroy: a scalable and dynamic emulation of the butterfly publication-title: PODC’02: Proceedings of the twenty-first annual symposium on Principles of distributed computing – reference: A. Berns, S. Ghosh, S. V. Pemmaraju, Brief announcement: a framework for building self-stabilizing overlay networks, in: Proc. of the 29th ACM Symp. on Principles of Distributed Computing (PODC), 2010, pp. 398–399. – volume: 43 start-page: 225 year: 1996 end-page: 267 ident: br000045 article-title: Unreliable failure detectors for reliable distributed systems publication-title: Journal of the ACM – reference: C. Scheideler, R. Jacob, S. Ritscher, S. Schmid, A self-stabilizing local delaunay graph construction, in: 20th Intl. Symp. on Algorithms and Computation (ISAAC), 2009. – reference: F. Kuhn, S. Schmid, R. Wattenhofer, A self-repairing peer-to-peer system resilient to dynamic adversarial churn, in: Proc. of the 4th International Workshop on Peer-To-Peer Systems (IPTPS), 2005. – start-page: 161 year: 2001 end-page: 172 ident: br000120 article-title: A scalable content-addressable network publication-title: SIGCOMM’01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications – start-page: 131 year: 2001 end-page: 145 ident: br000010 article-title: Resilient overlay networks publication-title: SOSP ’01: Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles – reference: D. Gall, R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig, Time complexity of distributed topological self-stabilization: The case of graph linearization, 2010, pp. 294–305. – volume: vol. 3460 year: 2004 ident: br000005 article-title: Position paper: Self-.properties in distributed k-ary structured overlay networks publication-title: Proceedings of SELF-STAR: International Workshop on Self-* Properties in Complex Information Systems – year: 2007 ident: br000100 article-title: Linearization: Locally self-stabilizing sorting in graphs publication-title: Proc. 9th Workshop on Algorithm Engineering and Experiments (ALENEX) – volume: vol. 4280 start-page: 574 year: 2006 end-page: 575 ident: br000080 article-title: Brief announcement: Self-stabilizing spanning tree algorithm for large scale systems publication-title: SSS – volume: 33 start-page: 668 year: 1990 end-page: 676 ident: br000110 article-title: Skip lists: A probabilistic alternative to balanced trees publication-title: Communications of the ACM – reference: Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman, Skipnet: a scalable overlay network with practical locality properties, in: USITS’03: Proceedings of the 4th Conference on USENIX Symposium on Internet Technologies and Systems, Berkeley, CA, USA, 2003. USENIX Association, pp. 9–9. – volume: 3 year: 2007 ident: br000015 article-title: Skip graphs publication-title: ACM Transactions on Algorithms – volume: 20 start-page: 375 year: 2008 end-page: 388 ident: br000065 article-title: Hypertree for self-stabilizing peer-to-peer systems publication-title: Distributed Computing – start-page: 329 year: 2001 end-page: 350 ident: br000125 article-title: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems publication-title: Middleware ’01: Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg – volume: 20 start-page: 15 year: 2010 end-page: 30 ident: br000040 article-title: Snap-stabilizing prefix tree for peer-to-peer systems publication-title: Parallel Processing Letters – year: 2007 ident: br000105 article-title: Linearization: Locally self-stabilizing sorting in graphs publication-title: ALENEX 2007: Proceedings of the Workshop on Algorithm Engineering and Experiments – reference: R. Jacob, A. Richa, C. Scheideler, S. Schmid, H. Täubig, A distributed polylogarithmic time algorithm for self-stabilizing skip graphs, in: Proc. of the 28th ACM Symp. on Principles of Distributed Computing (PODC), 2009, pp. 131–140. – reference: Ayman Shaker, Douglas S. Reeves, Self-stabilizing structured ring topology P2P systems, in: Proc. 5th IEEE International Conference on Peer-to-Peer Computing, 2005, pp. 39–46. – volume: vol. 5340 start-page: 124 year: 2008 end-page: 140 ident: br000050 article-title: Tiara: A self-stabilizing deterministic skip list publication-title: SSS – start-page: 27 year: 2007 ident: br000035 article-title: Stabilizing peer-to-peer spatial filters publication-title: ICDCS’07: Proceedings of the 27th International Conference on Distributed Computing Systems – start-page: 170 year: 2004 end-page: 179 ident: br000030 article-title: Pagoda: a dynamic overlay network for routing, data management, and multicasting publication-title: SPAA’04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures – volume: 11 start-page: 17 year: 2003 end-page: 32 ident: br000135 article-title: Chord: a scalable peer-to-peer lookup protocol for Internet applications publication-title: IEEE/ACM Transactions on Networking – start-page: 131 year: 2001 ident: 10.1016/j.tcs.2012.08.029_br000010 article-title: Resilient overlay networks – start-page: 170 year: 2004 ident: 10.1016/j.tcs.2012.08.029_br000030 article-title: Pagoda: a dynamic overlay network for routing, data management, and multicasting – start-page: 27 year: 2007 ident: 10.1016/j.tcs.2012.08.029_br000035 article-title: Stabilizing peer-to-peer spatial filters – volume: 33 start-page: 668 issue: 6 year: 1990 ident: 10.1016/j.tcs.2012.08.029_br000110 article-title: Skip lists: A probabilistic alternative to balanced trees publication-title: Communications of the ACM doi: 10.1145/78973.78977 – ident: 10.1016/j.tcs.2012.08.029_br000130 doi: 10.1109/P2P.2005.34 – volume: 17 start-page: 643 issue: 11 year: 1974 ident: 10.1016/j.tcs.2012.08.029_br000060 article-title: Self-stabilization in spite of distributed control publication-title: Communications of the ACM doi: 10.1145/361179.361202 – start-page: 161 year: 2001 ident: 10.1016/j.tcs.2012.08.029_br000120 article-title: A scalable content-addressable network – volume: vol. 3460 year: 2004 ident: 10.1016/j.tcs.2012.08.029_br000005 article-title: Position paper: Self-.properties in distributed k-ary structured overlay networks – year: 2007 ident: 10.1016/j.tcs.2012.08.029_br000100 article-title: Linearization: Locally self-stabilizing sorting in graphs – year: 2007 ident: 10.1016/j.tcs.2012.08.029_br000105 article-title: Linearization: Locally self-stabilizing sorting in graphs – volume: 20 start-page: 375 issue: 5 year: 2008 ident: 10.1016/j.tcs.2012.08.029_br000065 article-title: Hypertree for self-stabilizing peer-to-peer systems publication-title: Distributed Computing doi: 10.1007/s00446-007-0038-9 – start-page: 329 year: 2001 ident: 10.1016/j.tcs.2012.08.029_br000125 article-title: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems – volume: vol. 5340 start-page: 124 year: 2008 ident: 10.1016/j.tcs.2012.08.029_br000050 article-title: Tiara: A self-stabilizing deterministic skip list – start-page: 183 year: 2002 ident: 10.1016/j.tcs.2012.08.029_br000095 article-title: Viceroy: a scalable and dynamic emulation of the butterfly – start-page: 318 year: 2004 ident: 10.1016/j.tcs.2012.08.029_br000020 article-title: The hyperring: a low-congestion deterministic data structure for distributed environments – volume: 20 start-page: 15 issue: 1 year: 2010 ident: 10.1016/j.tcs.2012.08.029_br000040 article-title: Snap-stabilizing prefix tree for peer-to-peer systems publication-title: Parallel Processing Letters doi: 10.1142/S012962641000003X – ident: 10.1016/j.tcs.2012.08.029_br000075 – volume: 3 issue: 4 year: 2007 ident: 10.1016/j.tcs.2012.08.029_br000015 article-title: Skip graphs publication-title: ACM Transactions on Algorithms doi: 10.1145/1290672.1290674 – volume: 11 start-page: 17 issue: 1 year: 2003 ident: 10.1016/j.tcs.2012.08.029_br000135 article-title: Chord: a scalable peer-to-peer lookup protocol for Internet applications publication-title: IEEE/ACM Transactions on Networking doi: 10.1109/TNET.2002.808407 – ident: 10.1016/j.tcs.2012.08.029_br000025 doi: 10.1145/1835698.1835790 – ident: 10.1016/j.tcs.2012.08.029_br000070 doi: 10.1007/978-3-642-12200-2_27 – ident: 10.1016/j.tcs.2012.08.029_br000115 – ident: 10.1016/j.tcs.2012.08.029_br000055 – ident: 10.1016/j.tcs.2012.08.029_br000085 doi: 10.1145/1582716.1582741 – ident: 10.1016/j.tcs.2012.08.029_br000090 doi: 10.1007/11558989_2 – volume: 43 start-page: 225 issue: 2 year: 1996 ident: 10.1016/j.tcs.2012.08.029_br000045 article-title: Unreliable failure detectors for reliable distributed systems publication-title: Journal of the ACM doi: 10.1145/226643.226647 – volume: vol. 4280 start-page: 574 year: 2006 ident: 10.1016/j.tcs.2012.08.029_br000080 article-title: Brief announcement: Self-stabilizing spanning tree algorithm for large scale systems |
| SSID | ssj0000576 |
| Score | 2.1373947 |
| Snippet | We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 119 |
| SubjectTerms | Message-passing Overlay networks Peer-to-peer networks Self-stabilization |
| Title | Corona: A stabilizing deterministic message-passing skip list |
| URI | https://dx.doi.org/10.1016/j.tcs.2012.08.029 |
| Volume | 512 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VssDAo4AojyoDE1LaOLETh60gqgJqF6jULUocGxVKiWhZGPjt3OVRQAIGpkixT4rO9t13ufN9ACduLKUXC2EbbhQFKMwOteG2HztoGQw-cprOwdDvj_j1WIxrcFHdhaGyytL2FzY9t9blm06pzU42mXRuKamH3hQ9FsEeQRfNPS7zS3zj809rLIIiX0kZAJxdZTbzGq-Foo7d9DtQtp0cZf7gm774m94WbJRA0eoW37INNT1rwGZFwmCVZ7IB64Nl49X5DlBnYsTWZ1bXQthHha9v6JustCx6ybsyW09Ee3Kv7QyBM43OHyeZNcWxXRj1Lu8u-nbJkGArNwwWNte-1p5hJpS-ksoxifBDzkPlSOWmTPtJ7LJYKoxEfeMkGNqkLEaQE6dBmCLw8fagPnue6X2weKKI_pMbXDvOEBcKXDLOUqEDkcSBbIJT6SZSZftwYrGYRlWd2EOE6oxInRExW7phE06XIlnRO-OvybxSePRtA0Ro238XO_if2CGsucRrQfV87Ajqi5dXfYzoYpG0YKX9zlqw2r266Q9b-Wb6AGCszmc |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT8JAEJ4gHtSDD9SIzz14Mqm0ZbcPb0gkoMBFSLg17XbXoIiN1Iu_3pk-UBP14KlJdydpZrcz33a-zgdwboee1wyFMDTXkg4oluErzQ0nNDEyaLxkMp2DodMd89uJmFSgXf4LQ7TKIvbnMT2L1sWdRuHNRjKdNu6pqIfZFDMWwR4hVmAV0YBL-g29yfVnOBZuXrCkEgBOL0ubGckrldSym74HepdmBjN_SE5fEk5nGzYLpMha-cPsQEXNa7BVqjCw4qWswcZg2Xl1sQvUmhjB9RVrMcR9xHx9x-TE4oL1krVlZs-ke_KgjASRM40unqYJm-HYHow7N6N21ygkEgxp-25qcOUo1dSW9j1HetLUkXB8zn1petKOLeVEoW2FnsSjqKPNCM82sRUiyglj148R-TT3oTp_masDYDySpP_JNS4etxAYClwzbsVCuSIKXa8OZumbQBb9w0nGYhaURLHHAN0ZkDsDkra0_TpcLE2SvHnGX5N56fDg2w4IMLj_bnb4P7MzWOuOBv2g3xveHcG6TSIXRO6zjqGavr6pE4QaaXSabaUPd_LO-g |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Corona%3A+A+stabilizing+deterministic+message-passing+skip+list&rft.jtitle=Theoretical+computer+science&rft.au=Nor%2C+Rizal+Mohd&rft.au=Nesterenko%2C+Mikhail&rft.au=Scheideler%2C+Christian&rft.date=2013-11-11&rft.issn=0304-3975&rft.volume=512&rft.spage=119&rft.epage=129&rft_id=info:doi/10.1016%2Fj.tcs.2012.08.029&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2012_08_029 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |