| Publication | Date of Publication | Type |
|---|
Fire!
| 2024-11-24 | Paper |
The time complexity of consensus under oblivious message adversaries
| 2024-09-25 | Paper |
The time complexity of consensus under oblivious message adversaries
Algorithmica | 2024-05-30 | Paper |
Logic of Communication Interpretation: How to Not Get Lost in Translation
| 2024-05-03 | Paper |
A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
| 2024-04-19 | Paper |
Continuity of Thresholded Mode-Switched ODEs and Digital Circuit Delay Models
Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control | 2024-02-21 | Paper |
On specifications and proofs of timed circuits
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Round-Oblivious Stabilizing Consensus in Dynamic Networks
| 2023-04-21 | Paper |
scientific article; zbMATH DE number 7650867 (Why is no real title available?)
| 2023-02-07 | Paper |
Valency-based consensus under message adversaries without limit-closure
| 2022-05-20 | Paper |
scientific article; zbMATH DE number 7450035 (Why is no real title available?)
| 2021-12-20 | Paper |
Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
Methodology and Computing in Applied Probability | 2021-11-09 | Paper |
Topological Characterization of Consensus under General Message Adversaries
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Optimal strategies for selecting coordinators
Discrete Applied Mathematics | 2020-12-29 | Paper |
How to reconcile fault-tolerant interval intersection with the Lipschitz condition
Distributed Computing | 2020-12-03 | Paper |
Epistemic reasoning with Byzantine-faulty agents
| 2020-05-13 | Paper |
scientific article; zbMATH DE number 7150620 (Why is no real title available?)
| 2020-01-13 | Paper |
The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
Automata, Languages and Programming | 2019-12-04 | Paper |
Consensus in rooted dynamic networks with short-lived stability
Distributed Computing | 2019-11-27 | Paper |
scientific article; zbMATH DE number 7075887 (Why is no real title available?)
| 2019-07-03 | Paper |
On linear-time data dissemination in dynamic rooted trees
Discrete Applied Mathematics | 2019-02-20 | Paper |
On knowledge and communication complexity in distributed systems
| 2019-01-30 | Paper |
On the strongest message adversary for consensus in directed dynamic networks
| 2019-01-30 | Paper |
The effect of forgetting on the performance of a synchronizer
| 2018-10-17 | Paper |
Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
Theoretical Computer Science | 2018-04-16 | Paper |
Automated competitive analysis of real-time scheduling with graph games
Real-Time Systems | 2018-02-16 | Paper |
Automated analysis of real-time scheduling using graph games
Proceedings of the 16th international conference on Hybrid systems: computation and control | 2017-05-16 | Paper |
Unfaithful Glitch Propagation in Existing Binary Circuit Models
IEEE Transactions on Computers | 2017-05-16 | Paper |
HEX: scaling honeycombs is easier than scaling clock trees
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
Journal of the ACM | 2015-08-14 | Paper |
Reconciling fault-tolerant distributed algorithms and real-time computing
Distributed Computing | 2014-07-11 | Paper |
Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
Journal of Computer and System Sciences | 2014-02-13 | Paper |
The Theta-Model: achieving synchrony without clocks
Distributed Computing | 2013-06-28 | Paper |
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
Distributed Computing | 2013-06-20 | Paper |
Reconciling fault-tolerant distributed computing and systems-on-chip
Distributed Computing | 2012-06-07 | Paper |
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science | 2011-10-10 | Paper |
The asynchronous bounded-cycle model
Theoretical Computer Science | 2011-10-10 | Paper |
Impossibility Results and Lower Bounds for Consensus under Link Failures
SIAM Journal on Computing | 2009-11-06 | Paper |
Interval-based clock synchronization with optimal precision.
Information and Computation | 2004-03-14 | Paper |
Orthogonal accuracy clock synchronization
Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
scientific article; zbMATH DE number 986997 (Why is no real title available?)
| 1997-10-20 | Paper |
Random trees in queueing systems with deadlines
Theoretical Computer Science | 1997-02-28 | Paper |
On Nonpreemptive LCFS Scheduling with Deadlines
Journal of Algorithms | 1995-04-09 | Paper |
The analysis of the expected successful operation time of slotted ALOHA
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
Monitoring distributed real-time systems
Real-Time Systems | 1994-06-29 | Paper |
Exponential Limiting Distributions in Queueing Systems with Deadlines
SIAM Journal on Applied Mathematics | 1993-06-29 | Paper |
The average CRI-length of a controlled ALOHA collision resolution algorithm
Theoretical Computer Science | 1993-05-16 | Paper |
Preemptive LCFS scheduling in hard real-time applications
Performance Evaluation | 1993-04-01 | Paper |
scientific article; zbMATH DE number 108592 (Why is no real title available?)
| 1993-01-23 | Paper |
Some investigations on FCFS scheduling in hard real time applications
Journal of Computer and System Sciences | 1993-01-17 | Paper |
FCFS-scheduling in a hard real-time environment under rush-hour conditions
BIT | 1993-01-16 | Paper |
scientific article; zbMATH DE number 49394 (Why is no real title available?)
| 1992-09-17 | Paper |
On a tree collision resolution algorithm in presence of capture
RAIRO - Theoretical Informatics and Applications | 1992-06-28 | Paper |
On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
Applied Mathematics and Computation | 1992-06-28 | Paper |
