| 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 | 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 | 2024-02-21 | Paper |
| On specifications and proofs of timed circuits | 2023-08-10 | Paper |
| Round-Oblivious Stabilizing Consensus in Dynamic Networks | 2023-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874248 | 2023-02-07 | Paper |
| Valency-based consensus under message adversaries without limit-closure | 2022-05-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5018518 | 2021-12-20 | Paper |
| Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss | 2021-11-09 | Paper |
| Topological Characterization of Consensus under General Message Adversaries | 2021-01-20 | Paper |
| Optimal strategies for selecting coordinators | 2020-12-29 | Paper |
| How to reconcile fault-tolerant interval intersection with the Lipschitz condition | 2020-12-03 | Paper |
| Epistemic reasoning with Byzantine-faulty agents | 2020-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207884 | 2020-01-13 | Paper |
| The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects | 2019-12-04 | Paper |
| Consensus in rooted dynamic networks with short-lived stability | 2019-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967183 | 2019-07-03 | Paper |
| On linear-time data dissemination in dynamic rooted trees | 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 | 2018-04-16 | Paper |
| Automated competitive analysis of real-time scheduling with graph games | 2018-02-16 | Paper |
| Automated analysis of real-time scheduling using graph games | 2017-05-16 | Paper |
| Unfaithful Glitch Propagation in Existing Binary Circuit Models | 2017-05-16 | Paper |
| HEX: scaling honeycombs is easier than scaling clock trees | 2016-04-18 | Paper |
| Fault-tolerant algorithms for tick-generation in asynchronous logic | 2015-08-14 | Paper |
| Reconciling fault-tolerant distributed algorithms and real-time computing | 2014-07-11 | Paper |
| Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip | 2014-02-13 | Paper |
| The Theta-Model: achieving synchrony without clocks | 2013-06-28 | Paper |
| Booting clock synchronization in partially synchronous systems with hybrid process and link failures | 2013-06-20 | Paper |
| Reconciling fault-tolerant distributed computing and systems-on-chip | 2012-06-07 | Paper |
| Synchronous consensus under hybrid process and link failures | 2011-10-10 | Paper |
| The asynchronous bounded-cycle model | 2011-10-10 | Paper |
| Impossibility Results and Lower Bounds for Consensus under Link Failures | 2009-11-06 | Paper |
| Interval-based clock synchronization with optimal precision. | 2004-03-14 | Paper |
| Orthogonal accuracy clock synchronization | 2001-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3122916 | 1997-10-20 | Paper |
| Random trees in queueing systems with deadlines | 1997-02-28 | Paper |
| On Nonpreemptive LCFS Scheduling with Deadlines | 1995-04-09 | Paper |
| The analysis of the expected successful operation time of slotted ALOHA | 1994-10-03 | Paper |
| Monitoring distributed real-time systems | 1994-06-29 | Paper |
| Exponential Limiting Distributions in Queueing Systems with Deadlines | 1993-06-29 | Paper |
| The average CRI-length of a controlled ALOHA collision resolution algorithm | 1993-05-16 | Paper |
| Preemptive LCFS scheduling in hard real-time applications | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4024065 | 1993-01-23 | Paper |
| Some investigations on FCFS scheduling in hard real time applications | 1993-01-17 | Paper |
| FCFS-scheduling in a hard real-time environment under rush-hour conditions | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998187 | 1992-09-17 | Paper |
| On a tree collision resolution algorithm in presence of capture | 1992-06-28 | Paper |
| On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm | 1992-06-28 | Paper |
