English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Fault Tolerant Gradient Clock Synchronization

Bund, J., Lenzen, C., & Rosenbaum, W. (2019). Fault Tolerant Gradient Clock Synchronization. In PODC '19 (pp. 357-365). New York, NY: ACM. doi:10.1145/3293611.3331637.

Item is

Basic

show hide
Genre: Conference Paper

Files

show Files
hide Files
:
1902.08042.pdf (Preprint), 388KB
Name:
1902.08042.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
© 2019 Association for Computing Machinery. This is the author’s version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, https://doi.org/10.1145/3293611.3331637
License:
-

Locators

show

Creators

show
hide
 Creators:
Bund, Johannes1, Author           
Lenzen, Christoph1, Author           
Rosenbaum, Will1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2019
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bund_PODC2019
DOI: 10.1145/3293611.3331637
 Degree: -

Event

show
hide
Title: ACM Symposium on Principles of Distributed Computing
Place of Event: Toronto, Canada
Start-/End Date: 2019-07-29 - 2019-08-02

Legal Case

show

Project information

show hide
Project name : ToRH
Grant ID : 716562
Funding program : Horizon 2020 (H2020)
Funding organization : European Commission (EC)

Source 1

show
hide
Title: PODC '19
  Subtitle : Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
  Abbreviation : PODC 2019
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 357 - 365 Identifier: ISBN: 978-1-4503-6217-7