With the increasing scale of communication networks, the likelihood of
f...
Gradient clock synchronization (GCS) algorithms minimize the worst-case ...
Given a discrete-state continuous-time reactive system, like a digital
c...
Many critical computing applications rely on secure and dependable time ...
Cryptographic signatures can be used to increase the resilience of
distr...
In this work we refine the analysis of the distributed Laplacian solver
...
This work presents a producer-consumer link between two independent cloc...
The vast majority of hardware architectures use a carefully timed refere...
Consider an arbitrary network of communicating modules on a chip, each
r...
In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW...
Friedrichs et al. (TC 2018) showed that metastability can be contained w...
In many models for large-scale computation, decomposition of the problem...
We study parallel algorithms for the classical balls-into-bins problem, ...
Many graph problems are locally checkable: a solution is globally feasib...
Synchronizing clocks in distributed systems is well-understood, both in ...
Recently, an unconditional exponential separation between the hazard-fre...
When setup/hold times of bistable elements are violated, they may become...
The problem of constructing hazard-free Boolean circuits dates back to t...
We introduce a novel lower bound technique for distributed graph algorit...