Internet Archive Scholar
Filters
























20 Hits in 6.6 sec

Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus [article]

Christoph Lenzen, Joel Rybicki
<span title="2019-06-11">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (3.2 MB)
https://web.archive.org/web/20200912070357/https://arxiv.org/pdf/1705.06173v3.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1705.06173v3.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:

<span title="2018-01-28">2018</span> <span class="release-stage" >pre-print</span> <span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.06173v3">arXiv:1705.06173v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/orsle2qrhrfmfp7n7ckied23ge">fatcat:orsle2qrhrfmfp7n7ckied23ge</a> </span>

Other Versions

<span title="2017-05-17">2017</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.06173v1">arXiv:1705.06173v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mskp6kjurjcaned3ygvqk5z5eq">fatcat:mskp6kjurjcaned3ygvqk5z5eq</a> </span>
<span title="2017-07-14">2017</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.06173v2">arXiv:1705.06173v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fifkz6w3f5aghclvwhh47ncuca">fatcat:fifkz6w3f5aghclvwhh47ncuca</a> </span>
These results are obtained by means of a recursive approach reducing the above task of self-stabilising pulse synchronisation in the bounded-delay model to non-self-stabilising binary consensus in the  ...  In this model, we study the pulse synchronisation problem, where the task is to guarantee that eventually all correct nodes generate well-separated local pulse events (i.e., unlabelled logical clock ticks  ...  Acknowledgements We are grateful to Danny Dolev for numerous discussions on the pulse synchronisation problem and detailed comments on early dra s of this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.06173v4">arXiv:1705.06173v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/c3c5z73nxbcuxbczhs2fj2ovmu">fatcat:c3c5z73nxbcuxbczhs2fj2ovmu</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span> <span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200912070357/https://arxiv.org/pdf/1705.06173v3.pdf" title="fulltext PDF download [not primary version]" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ac/14/ac14c53c5bf8db3052c0d50765e52d3852a336f1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.06173v4" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Christoph Lenzen, Joel Rybicki. "Self-stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus." arXiv (2019)

Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus *

Christoph Lenzen, Joel Rybicki
<span class="release-stage">unpublished</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (881.8 kB)
https://web.archive.org/web/20180507142559/http://drops.dagstuhl.de/opus/volltexte/2017/7991/pdf/LIPIcs-DISC-2017-32.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="http://drops.dagstuhl.de/opus/volltexte/2017/7991/pdf/LIPIcs-DISC-2017-32.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

These results are obtained by means of a recursive approach reducing the above task of self-stabilising pulse synchronisation in the bounded-delay model to non-self-stabilising binary consensus in the  ...  In this model, we study the pulse synchronisation problem, where the task is to guarantee that eventually all correct nodes generate well-separated local pulse events (i.e., unlabelled logical clock ticks  ...  We are grateful to Danny Dolev for numerous discussions on the pulse synchronisation problem and detailed comments on early drafts of this paper. We also wish to thank Borzoo Bonakdarpour, Janne H.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4zfse6kvobgovglup6jbg5bxvq">fatcat:4zfse6kvobgovglup6jbg5bxvq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180507142559/http://drops.dagstuhl.de/opus/volltexte/2017/7991/pdf/LIPIcs-DISC-2017-32.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/39/23/392323acd8e6e6593dae565d5f607e4dac854b91.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
Citation

Christoph Lenzen, Joel Rybicki. "Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus *."

Near-Optimal Self-stabilising Counting and Firing Squads [chapter]

Christoph Lenzen, Joel Rybicki
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (578.8 kB)
https://web.archive.org/web/20170921212824/http://pubman.mpdl.mpg.de/pubman/item/escidoc:2351083/component/escidoc:2351082/arXiv:1608.00214.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://pubman.mpdl.mpg.de/pubman/item/escidoc:2351083/component/escidoc:2351082/arXiv:1608.00214.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f < n/3, asymptotically optimal stabilisation and response time O(f ), and message  ...  Our results resolve various open questions on the two problems, most prominently whether (communication-efficient) self-stabilising Byzantine firing squads or (randomised) sublinear-time solutions for  ...  Acknowledgements We thank Danny Dolev for inspiring discussions and valuable comments, especially concerning silent consensus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-49259-9_21">doi:10.1007/978-3-319-49259-9_21</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/r7emo6mh75dmri65nrrk3f4gwu">fatcat:r7emo6mh75dmri65nrrk3f4gwu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921212824/http://pubman.mpdl.mpg.de/pubman/item/escidoc:2351083/component/escidoc:2351082/arXiv:1608.00214.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d8/98/d898d368c57ad98d0e1be92c97a1c77c63a0902b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-49259-9_21"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
Citation

Christoph Lenzen, Joel Rybicki. "Near-Optimal Self-stabilising Counting and Firing Squads." Lecture Notes in Computer Science (2016) 263-280

Near-Optimal Self-Stabilising Counting and Firing Squads [article]

Christoph Lenzen, Joel Rybicki
<span title="2017-01-17">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (660.5 kB)
https://web.archive.org/web/20200917231308/https://arxiv.org/pdf/1608.00214v2.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1608.00214v2.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Other Versions

<span title="2016-07-31">2016</span> <span class="release-stage" >pre-print</span>
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.00214v1">arXiv:1608.00214v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/46zuzyfbvfb7ri6c6yfi3mmwnq">fatcat:46zuzyfbvfb7ri6c6yfi3mmwnq</a> </span>
For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f<n/3, asymptotically optimal stabilisation and response time O(f), and message size  ...  In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external  ...  Acknowledgements We are grateful to Danny Dolev for inspiring discussions and valuable comments, especially concerning silent consensus.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.00214v2">arXiv:1608.00214v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tl5ilnadavhndhvsq55gns7gdm">fatcat:tl5ilnadavhndhvsq55gns7gdm</a> </span>
<span class="ui label basic blue small">Multiple Versions</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200917231308/https://arxiv.org/pdf/1608.00214v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c7/7b/c77b64a562fb5b7e4637cda0b55003386e578ee5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1608.00214v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Christoph Lenzen, Joel Rybicki. "Near-Optimal Self-Stabilising Counting and Firing Squads." arXiv (2017)

Near-optimal self-stabilising counting and firing squads

Christoph Lenzen, Joel Rybicki
<span title="2018-09-12">2018</span> <i title="Springer Nature America, Inc"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (799.3 kB)
https://web.archive.org/web/20190501202903/https://link.springer.com/content/pdf/10.1007%2Fs00446-018-0342-6.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://link.springer.com/content/pdf/10.1007%2Fs00446-018-0342-6.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

For example, we obtain a deterministic algorithm for self-stabilising Byzantine firing squads with optimal resilience f < n/3, asymptotically optimal stabilisation and response time O( f ), and message  ...  In the self-stabilising firing squad problem, the task is to eventually guarantee that all non-faulty nodes have simultaneous responses to external inputs: if a subset of the correct nodes receive an external  ...  We are grateful to Danny Dolev for inspiring discussions and valuable comments, especially concerning silent consensus. We thank the anonymous reviewers for their comments and helpful suggestions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-018-0342-6">doi:10.1007/s00446-018-0342-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nfd5trtvyzevhpmfv45kpylxua">fatcat:nfd5trtvyzevhpmfv45kpylxua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190501202903/https://link.springer.com/content/pdf/10.1007%2Fs00446-018-0342-6.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/14/81/1481d695d2304069199cf1271ee65f06f7a7ff05.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-018-0342-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
Citation

Christoph Lenzen, Joel Rybicki. "Near-optimal self-stabilising counting and firing squads." Distributed computing 32.4 (2018)

Towards Optimal Synchronous Counting [article]

Christoph Lenzen, Joel Rybicki, Jukka Suomela
<span title="2015-03-23">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (542.6 kB)
https://web.archive.org/web/20191020133252/https://arxiv.org/pdf/1503.06702v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1503.06702v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Thus, we are considering algorithms that are self-stabilizing despite Byzantine failures.  ...  In particular, we achieve an exponential improvement in the space complexity of deterministic algorithms, while still achieving linear stabilisation time and almost-linear resilience.  ...  Introduction In this work, we design space-efficient, self-stabilising, Byzantine fault-tolerant algorithms for the synchronous counting problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1503.06702v1">arXiv:1503.06702v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fudyevbhi5fo7dobgkvsf37lga">fatcat:fudyevbhi5fo7dobgkvsf37lga</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191020133252/https://arxiv.org/pdf/1503.06702v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/49/d1/49d1a5f6ad51759483e3b3c9b282f433b1baddfc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1503.06702v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Christoph Lenzen, Joel Rybicki, Jukka Suomela. "Towards Optimal Synchronous Counting." arXiv (2015)

Towards Optimal Synchronous Counting

Christoph Lenzen, Joel Rybicki, Jukka Suomela
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC &#39;15</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (548.1 kB)
https://web.archive.org/web/20160429211749/http://people.mpi-inf.mpg.de:80/~clenzen/pubs/LRS15counting.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit <a rel="external noopener" href="http://people.mpi-inf.mpg.de:80/~clenzen/pubs/LRS15counting.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Thus, we are considering algorithms that are self-stabilising despite Byzantine failures.  ...  In particular, we achieve an exponential improvement in the state complexity of deterministic algorithms, while still achieving linear stabilisation time and almost-linear resilience.  ...  INTRODUCTION In this work, we design space-efficient, self-stabilising, Byzantine fault-tolerant algorithms for the synchronous counting problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2767386.2767423">doi:10.1145/2767386.2767423</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/LenzenRS15.html">dblp:conf/podc/LenzenRS15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2dws2ewt2vblfmdqyxuqy5l6ai">fatcat:2dws2ewt2vblfmdqyxuqy5l6ai</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160429211749/http://people.mpi-inf.mpg.de:80/~clenzen/pubs/LRS15counting.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ce/c0/cec0f1f9c62ddfee9d476ba73dfb3806b0ddd1db.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2767386.2767423"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
Citation

Christoph Lenzen, Joel Rybicki, Jukka Suomela. "Towards Optimal Synchronous Counting." Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15 (2015) 441-450

Fault Tolerant Gradient Clock Synchronization [article]

Johannes Bund, Christoph Lenzen, Will Rosenbaum
<span title="2019-02-21">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (391.4 kB)
https://web.archive.org/web/20200906135104/https://arxiv.org/pdf/1902.08042v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1902.08042v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Note that tolerating f faulty neighbors trivially requires degree larger than f, so this is asymptotically optimal as well.  ...  However, so far nothing non-trivial is known about the local skew that can be achieved in topologies that are not fully connected even under a single Byzantine fault.  ...  Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. In Proc. 31st Symposium on Distributed Computing (DISC), pages 32:1-32:15, 2017.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.08042v1">arXiv:1902.08042v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ukgh6yf7f5fs5jitd2beycswdy">fatcat:ukgh6yf7f5fs5jitd2beycswdy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200906135104/https://arxiv.org/pdf/1902.08042v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/f7/93f7a5ca5cd7623510deb667ceba2f04c65cee1f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1902.08042v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Johannes Bund, Christoph Lenzen, Will Rosenbaum. "Fault Tolerant Gradient Clock Synchronization." arXiv (2019)

A formal analysis of bluetooth device discovery

Marie Duflot, Marta Kwiatkowska, Gethin Norman, David Parker
<span title="2006-07-05">2006</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zzy5ovlifvatfirg4js7u4uetq" style="color: black;">International Journal on Software Tools for Technology Transfer (STTT)</a> </i> &nbsp;

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (256.6 kB)
https://web.archive.org/web/20161020104637/http://www.prismmodelchecker.org:80/papers/isola04.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit <a rel="external noopener" href="http://www.prismmodelchecker.org:80/papers/isola04.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

The performance of this process is the result of a complex interaction between several devices, some of which exhibit random behaviour.  ...  It has also been used to verify randomised distributed algorithms for leader election, self-stabilisation, mutual exclusion, consensus and Byzantine agreement, and probabilistic security protocols for  ...  During the first step, information about slave clock times is exchanged for the purposes of synchronisation. This can be used during the second step, which is hence much faster.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10009-006-0014-x">doi:10.1007/s10009-006-0014-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7tc3zi2unvajnhq5lmh5gjbqem">fatcat:7tc3zi2unvajnhq5lmh5gjbqem</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20161020104637/http://www.prismmodelchecker.org:80/papers/isola04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/d3/a2d3b1bbde42a1ef1ed3c906b28df681ea9b9b88.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10009-006-0014-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
Citation

Marie Duflot, Marta Kwiatkowska, Gethin Norman, David Parker. "A formal analysis of bluetooth device discovery." International Journal on Software Tools for Technology Transfer (STTT) 8.6 (2006) 621-632

A Fault-tolerance Linguistic Structure for Distributed Applications [article]

Vincenzo De Florio
<span title="2016-11-05">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (4.9 MB)
https://web.archive.org/web/20200823150149/https://arxiv.org/pdf/1611.01690v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1611.01690v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

This recovery language comes into play as soon as an error is detected by an underlying error detection layer, or when some erroneous condition is signaled by the application processes.  ...  The main thesis of this dissertation is that this new structuring technique is capable of exhibiting satisfactory values of the structural attributes in the domain of soft real-time, distributed and parallel  ...  As soon as a disagreement occurs, the system is shut down [Pow97] . Another possibility is to use self-checking capabilities.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.01690v1">arXiv:1611.01690v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mtyx6ubjafhzter5zream33d5u">fatcat:mtyx6ubjafhzter5zream33d5u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823150149/https://arxiv.org/pdf/1611.01690v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7d/a7/7da7c78d3bfca5ab8c3b9446df57d1c00e811d66.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1611.01690v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>
Citation

Vincenzo De Florio. "A Fault-tolerance Linguistic Structure for Distributed Applications." arXiv (2016)

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Fatemeh Borran
<span title="2010-09-09">2010</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (1.3 MB)
https://web.archive.org/web/20190307120703/https://infoscience.epfl.ch/record/151491/files/EPFL_TH4839.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://infoscience.epfl.ch/record/151491/files/EPFL_TH4839.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

In this context, there is a gap between theoretical consensus algorithms and practical Byzantine fault-tolerant protocols.  ...  The goal of the thesis is first to decouple the consensus algorithm from irrelevant details of implementations, such as synchronization, then study different possible implementations for a given consensus  ...  lead to almost the same result, which is no more the case with large clock drift.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5075/epfl-thesis-4839">doi:10.5075/epfl-thesis-4839</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pqqpxpzra5fa7po3ft6juyqbzy">fatcat:pqqpxpzra5fa7po3ft6juyqbzy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307120703/https://infoscience.epfl.ch/record/151491/files/EPFL_TH4839.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/e9/d4e9ab85634aa9e9dd930f8264295c4da26d2860.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5075/epfl-thesis-4839"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

Fatemeh Borran. "Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis." (2010)

"As Time Goes By? " Monumentality, Landscapes And The Temporal Perspective. Proceedings Of The International Workshop "Socio-Environmental Dynamics Over The Last 12,000 Years: The Creation Of Landscapes Ii (14 Th –18 Th March 2011)" In Kiel. Volume 2

Martin Furholt, Martin Hinz, Doris Mischka
<span title="2012-01-01">2012</span> <i title="Zenodo"> Zenodo </i> &nbsp;

Preserved Fulltext

Web Archive Capture PDF (76.0 MB)
https://web.archive.org/web/20201226235340/https://zenodo.org/record/1185237/files/As_time_goes_by_Monumentality_Landscapes.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://zenodo.org/record/1185237/files/As_time_goes_by_Monumentality_Landscapes.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

This volume is concerned with one session of the workshop. The session title "As time goes by" refers to the temporal perspective of monuments.  ...  The main idea was to change focus from the notion of durability that is commonly emphasised when discussing monuments in the historical and archaeological disciplines towards a perspective highlighting  ...  In contrast to the dispersal patterns, visibility is not as easy to reconsider.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1185237">doi:10.5281/zenodo.1185237</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/agffal2s55bwtn7prwjokb73d4">fatcat:agffal2s55bwtn7prwjokb73d4</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201226235340/https://zenodo.org/record/1185237/files/As_time_goes_by_Monumentality_Landscapes.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.1185237"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>
Citation

Martin Furholt, Martin Hinz, Doris Mischka. ""As Time Goes By? " Monumentality, Landscapes And The Temporal Perspective. Proceedings Of The International Workshop "Socio-Environmental Dynamics Over The Last 12,000 Years: The Creation Of Landscapes Ii (14 Th –18 Th March 2011)" In Kiel. Volume 2." Zenodo (2012)

Iron Age Vulnerability. The Fimbulwinter hypothesis and the archaeology of the inlands of eastern Norway

Ingar Mørkestøl Gundersen
<span title="2021-12-15">2021</span> <i title="Zenodo"> Zenodo </i> &nbsp;

Preserved Fulltext

Web Archive Capture PDF (20.7 MB)
https://web.archive.org/web/20220207150857/https://zenodo.org/record/5782896/files/Gundersen_dissertation_2021.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit <a rel="external noopener" href="https://zenodo.org/record/5782896/files/Gundersen_dissertation_2021.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

One hypothesis suggests that the population of the Scandinavian Peninsula may have been halved as a result.  ...  The combination of prolonged cooling and presumed crop failure is often compared to Norse myths about the Fimbulwinter, but critics argue that the Fimbulwinter hypothesis is rife with the uncritical use  ...  easy to account for.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.5782895">doi:10.5281/zenodo.5782895</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jqj7wwoup5hu3kdllioo4srp5u">fatcat:jqj7wwoup5hu3kdllioo4srp5u</a> </span>
<span class="ui label basic orange small" title="Open Access">Open Access</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220207150857/https://zenodo.org/record/5782896/files/Gundersen_dissertation_2021.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.5782895"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>
Citation

Ingar Mørkestøl Gundersen. "Iron Age Vulnerability. The Fimbulwinter hypothesis and the archaeology of the inlands of eastern Norway." Zenodo (2021)

Past and Present in Medieval Chronicles Edited by Mari Isoaho Editors-in-Chief Board of Consulting Editors Past and Present in Medieval Chronicles

Sari Kivistö, Johanna Sumiala, Managing Maija, Väätämöinen Board, Elvira Brattico, Eva Holmberg, Nora Hämäläinen, Juliette Kennedy, Simo Knuuttila, Klaus Laalo, Merja Polvinen, Silvija Serafimova (+25 others)
<span title="">2015</span> <span class="release-stage">unpublished</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (3.9 MB)
https://web.archive.org/web/20180410065330/https://helda.helsinki.fi/bitstream/handle/10138/153800/VOL17_Past_and_Present.pdf?sequence=1

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://helda.helsinki.fi/bitstream/handle/10138/153800/VOL17_Past_and_Present.pdf?sequence=1">the original URL</a>. The file type is <code>application/pdf</code>.

We all know that in the telling and retelling of an event, or series of events, there will be as many accounts as there are tellers. An event should be recorded.  ...  Then it must be agreed by whoever's task it is that this version rather than that must be committed to memory. -Doris Lessing, The Cleft  ...  I would go as far as to say that Adam is treated as a kind of proto-Byzantine emperor.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/sr4x5bvouzbarijvbnw5jgzw64">fatcat:sr4x5bvouzbarijvbnw5jgzw64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180410065330/https://helda.helsinki.fi/bitstream/handle/10138/153800/VOL17_Past_and_Present.pdf?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/be/53be6c833f848d0f4f6d88ea5771e73a455df315.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>
Citation

Sari Kivistö, Johanna Sumiala, Managing Maija, Väätämöinen Board, Elvira Brattico, Eva Holmberg, Nora Hämäläinen, Juliette Kennedy, Simo Knuuttila, Klaus Laalo, Merja Polvinen, Silvija Serafimova, Mikko Tolonen, Flutur Troshani, Laura Assmuth, Marghareta Carucci, Denis Casey, Douglas Davies, Charles Husband, Mika Kajava, Leena Kaunonen, Kuisma Korhonen, Dan Lloyd, Petri Luomanen, Matti Miestamo, Marianna Muravyeva, Andrew Newby, Mika Ojakangas, Tom Popkewitz, Katariina Salmela-Aro, Hanna Snellman, Koen Stapelbroek, Ian Thatcher, Kristiina Taivalkoski-Shilov, Miira Tuominen, Karen Vedel, Alan Warde. "Past and Present in Medieval Chronicles Edited by Mari Isoaho Editors-in-Chief Board of Consulting Editors Past and Present in Medieval Chronicles." (2015)

The role of the Catholic Church in regional development in Northern Ghana

Stephen Aayagryeb Koya, Technische Universität Dortmund, Technische Universität Dortmund
<span title="2010-11-25">2010</span>

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (25.4 MB)
https://web.archive.org/web/20170815055557/https://eldorado.tu-dortmund.de/bitstream/2003/27497/1/Koya.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://eldorado.tu-dortmund.de/bitstream/2003/27497/1/Koya.pdf">the original URL</a>. The file type is <code>application/pdf</code>.

Another common proverb translates "one who works around the clock, eats around the clock" -("Tokpen mutong,nu mi di kpen mutong").  ...  In Table 7 .8, there is almost parity in the engagement of teachers as 57% to 43% demonstrates: The parity improves with pupils' and students' enrolment as shown in Table 7 .9.  ...  Mention briefly three to five specific and / or general functions or roles religion plays in society and in nation building, that is why do you think religion is important for society?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.17877/de290r-15883">doi:10.17877/de290r-15883</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lldu2lufmbd77bghd5o5vfndvi">fatcat:lldu2lufmbd77bghd5o5vfndvi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170815055557/https://eldorado.tu-dortmund.de/bitstream/2003/27497/1/Koya.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/41/dd/41dd201203e6367442ad4ba5db01a0edbb382f06.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.17877/de290r-15883"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
Citation

Stephen Aayagryeb Koya, Technische Universität Dortmund, Technische Universität Dortmund. "The role of the Catholic Church in regional development in Northern Ghana." (2010)

&laquo; Previous Showing results 1 &mdash; 15 out of 20 results