Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial) (Englisch)
Freier Zugriff
- Neue Suche nach: Raynal, Michel
- Neue Suche nach: Raynal, Michel
- Neue Suche nach: Anceaume, Emmanuelle
- Neue Suche nach: Cachin, Christian
- Neue Suche nach: Potop-Butucaru, Maria
In:
LIPIcs, Volume 46, OPODIS 2015
: 19th International Conference on Principles of Distributed Systems (OPODIS 2015)
;
46
;
1:1-1:10
;
2016
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial)
-
Beteiligte:Raynal, Michel ( Autor:in ) / Anceaume, Emmanuelle ( Herausgeber:in ) / Cachin, Christian ( Herausgeber:in ) / Potop-Butucaru, Maria ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 46, OPODIS 2015 : 19th International Conference on Principles of Distributed Systems (OPODIS 2015) ; 46 ; 1:1-1:10Leibniz International Proceedings in Informatics (LIPIcs) ; 46 ; 1:1-1:10
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:13.10.2016
-
Format / Umfang:10 pages , 389532 byte
-
Anmerkungen:LIPIcs, Vol. 46, 19th International Conference on Principles of Distributed Systems (OPODIS 2015), pages 1:1-1:10
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Signature-Free Communication and Agreement in the Presence of Byzantine Processes (Tutorial)Raynal, Michel et al. | 2016
- 2
-
Dynamic Reconfiguration: A Tutorial (Tutorial)Spiegelman, Alexander / Keidar, Idit / Malkhi, Dahlia et al. | 2016
- 3
-
Time to Change: On Distributed Computing in Dynamic Networks (Keynote)Santoro, Nicola et al. | 2016
- 4
-
Space Bounds for Reliable Storage: Fundamental Limits of Coding (Keynote)Spiegelman, Alexander / Cassuto, Yuval / Chockler, Gregory / Keidar, Idit et al. | 2016
- 5
-
Blockchain-Based Consensus (Keynote)Garay, Juan A. et al. | 2016
- 6
-
Approximation of Distances and Shortest Paths in the Broadcast Congest CliqueHolzer, Stephan / Pinsker, Nathan et al. | 2016
- 7
-
The Cost of Global Broadcast in Dynamic Radio NetworksAhmadi, Mohamad / Ghodselahi, Abdolhamid / Kuhn, Fabian / Molla, Anisur Rahaman et al. | 2016
- 8
-
Bounds for Blind Rate AdaptationGilbert, Seth / Newport, Calvin / Wang, Tonghe et al. | 2016
- 9
-
Overcoming Obstacles with AntsLangner, Tobias / Keller, Barbara / Uitto, Jara / Wattenhofer, Roger et al. | 2016
- 10
-
Distributed Sparse Cut ApproximationKuhn, Fabian / Molla, Anisur Rahaman et al. | 2016
- 11
-
Distributed Approximation of k-Service AssignmentHalldórsson, Magnús M. / Köhler, Sven / Rawitz, Dror et al. | 2016
- 12
-
On the Uncontended Complexity of Anonymous ConsensusCapdevielle, Claire / Johnen, Colette / Kuznetsov, Petr / Milani, Alessia et al. | 2016
- 13
-
The Relative Power of Composite Loop Agreement TasksSaraph, Vikram / Herlihy, Maurice et al. | 2016
- 14
-
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random NumbersSudo, Yuichi / Ooshita, Fukuhito / Kakugawa, Hirotsugu / Masuzawa, Toshimitsu et al. | 2016
- 15
-
A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel AlgorithmsTamir, Orr / Morrison, Adam / Rinetzky, Noam et al. | 2016
- 16
-
Maximum Matching for Anonymous Trees with Constant Space per ProcessDatta, Ajoy K. / Larmore, Lawrence L. / Masuzawa, Toshimitsu et al. | 2016
- 17
-
Atomic Snapshots from Small RegistersZhu, Leqi / Ellen, Faith et al. | 2016
- 18
-
Anonymous Obstruction-Free (n,k)-Set Agreement with n-k+1 Atomic Read/Write RegistersBouzid, Zohir / Raynal, Michel / Sutra, Pierre et al. | 2016
- 19
-
Making "Fast" Atomic Operations Computationally TractableFernández Anta, Antonio / Nicolaou, Nicolas / Popa, Alexandru et al. | 2016
- 20
-
Robust Shared Objects for Non-Volatile Main MemoryBerryhill, Ryan / Golab, Wojciech / Tripunitara, Mahesh et al. | 2016
- 21
-
The Benefits of Entropy in Population ProtocolsBeauquier, Joffroy / Blanchard, Peva / Burman, Janna / Guerraoui, Rachid et al. | 2016
- 22
-
Byzantine Agreement with Median ValidityStolz, David / Wattenhofer, Roger et al. | 2016
- 23
-
Ensuring Average Recovery with Adversarial SchedulerChen, Jingshu / Roohitavaf, Mohammad / Kulkarni, Sandeep S. et al. | 2016
- 24
-
Towards Establishing Monotonic Searchability in Self-Stabilizing Data StructuresScheideler, Christian / Setzer, Alexander / Strothmann, Thim et al. | 2016
- 25
-
QuickLex: A Fast Algorithm for Consistent Global States Enumeration of Distributed ComputationsChang, Yen-Jung / Garg, Vijay K. et al. | 2016
- 26
-
The Synchronization Power of Atomic Bitwise OperationsImbs, Damien et al. | 2016
- 27
-
Wait-Free Concurrent Graph Objects with Dynamic TraversalsKallimanis, Nikolaos D. / Kanellou, Eleni et al. | 2016
- 28
-
A Faster Counting Protocol for Anonymous Dynamic NetworksMilani, Alessia / Mosteiro, Miguel A. et al. | 2016
- 29
-
ActiveMonitor: Asynchronous Monitor Framework for Scalability and Multi-Object SynchronizationHung, Wei-Lun / Chauhan, Himanshu / Garg, Vijay K. et al. | 2016
- 30
-
Communicating with BeepsCzumaj, Artur / Davies, Peter et al. | 2016
- 31
-
Nontrivial and Universal Helping for Wait-Free Queues and StacksAttiya, Hagit / Castaneda, Armando / Hendler, Danny et al. | 2016
- 32
-
Generic Proofs of Consensus Numbers for Abstract Data TypesTalmage, Edward / Welch, Jennifer et al. | 2016
- 33
-
Non Trivial Computations in Anonymous Dynamic NetworksDi Luna, Giuseppe / Baldoni, Roberto et al. | 2016
- 34
-
Analysis of Bounds on Hybrid Vector ClocksYingchareonthawornchai, Sorrachai / Kulkarni, Sandeep S. / Demirbas, Murat et al. | 2016
- 35
-
Non-Blocking Doubly-Linked Lists with Good Amortized ComplexityShafiei, Niloufar et al. | 2016
- 36
-
Poly-Logarithmic Adaptive Algorithms Require Unconditional PrimitivesAttiya, Hagit / Fouren, Arie et al. | 2016