<--- Back to Details
First PageDocument Content
Electrical engineering / Network flow problem / Clock synchronization / Clocks / Synchronization / Distributed computing / Clock skew / Time-Triggered Protocol / Distributed algorithm / Flow network / Physics / Electromagnetism
Date: 2018-09-02 17:25:13
Electrical engineering
Network flow problem
Clock synchronization
Clocks
Synchronization
Distributed computing
Clock skew
Time-Triggered Protocol
Distributed algorithm
Flow network
Physics
Electromagnetism

Theory of Computing Systems manuscript No. (will be inserted by the editor) Self-stabilizing Byzantine Clock Synchronization with Optimal Precision Pankaj Khanchandani · Christoph Lenzen

Add to Reading List

Source URL: www.tik.ee.ethz.ch

Download Document from Source Website

File Size: 371,99 KB

Share Document on Facebook

Similar Documents

Resistive Network Optimal Power Flow: Uniqueness and Algorithms Chee Wei Tan, Senior Member, IEEE, Desmond W. H. Cai, Student Member, IEEE and Xin Lou Abstract—The optimal power flow (OPF) problem minimizes the power l

Resistive Network Optimal Power Flow: Uniqueness and Algorithms Chee Wei Tan, Senior Member, IEEE, Desmond W. H. Cai, Student Member, IEEE and Xin Lou Abstract—The optimal power flow (OPF) problem minimizes the power l

DocID: 1vid6 - View Document

Introduction Network similarity problem Results Acknowledgements  Spectra of the Spike Flow Graphs of Recurrent

Introduction Network similarity problem Results Acknowledgements Spectra of the Spike Flow Graphs of Recurrent

DocID: 1veQT - View Document

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems

DocID: 1rpCH - View Document

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016

DocID: 1rn0k - View Document

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

DocID: 1rjuk - View Document