The following pages link to Ulrich Schmid (Q269517):
Displaying 50 items.
- HEX: scaling honeycombs is easier than scaling clock trees (Q269518) (← links)
- Reconciling fault-tolerant distributed computing and systems-on-chip (Q424907) (← links)
- (Q672994) (redirect page) (← links)
- Random trees in queueing systems with deadlines (Q672995) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm (Q1186995) (← links)
- FCFS-scheduling in a hard real-time environment under rush-hour conditions (Q1198965) (← links)
- Some investigations on FCFS scheduling in hard real time applications (Q1201887) (← links)
- The average CRI-length of a controlled ALOHA collision resolution algorithm (Q1208718) (← links)
- Monitoring distributed real-time systems (Q1329095) (← links)
- Interval-based clock synchronization with optimal precision. (Q1426005) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- On the strongest message adversary for consensus in directed dynamic networks (Q1713900) (← links)
- On knowledge and communication complexity in distributed systems (Q1713923) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- The effect of forgetting on the performance of a synchronizer (Q1796436) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- Valency-based consensus under message adversaries without limit-closure (Q2140525) (← links)
- Epistemic reasoning with Byzantine-faulty agents (Q2180234) (← links)
- Optimal strategies for selecting coordinators (Q2217494) (← links)
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss (Q2241637) (← links)
- Reconciling fault-tolerant distributed algorithms and real-time computing (Q2251157) (← links)
- The Theta-Model: achieving synchrony without clocks (Q2377129) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Orthogonal accuracy clock synchronization (Q2709237) (← links)
- Unfaithful Glitch Propagation in Existing Binary Circuit Models (Q2985599) (← links)
- Automated analysis of real-time scheduling using graph games (Q2986919) (← links)
- Static priority scheduling of aperiodic real-time tasks (Q3122916) (← links)
- Impossibility Results and Lower Bounds for Consensus under Link Failures (Q3642868) (← links)
- On a tree collision resolution algorithm in presence of capture (Q3992092) (← links)
- (Q3998187) (← links)
- (Q4024065) (← links)
- Preemptive LCFS scheduling in hard real-time applications (Q4030468) (← links)
- The analysis of the expected successful operation time of slotted ALOHA (Q4307369) (← links)
- On Nonpreemptive LCFS Scheduling with Deadlines (Q4327816) (← links)
- (Q4967183) (← links)
- (Q5018518) (← links)
- How to reconcile fault-tolerant interval intersection with the Lipschitz condition (Q5138355) (← links)
- Topological Characterization of Consensus under General Message Adversaries (Q5145210) (← links)
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects (Q5204319) (← links)
- (Q5207884) (← links)
- Exponential Limiting Distributions in Queueing Systems with Deadlines (Q5286317) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
- (Q5874248) (← links)
- Round-Oblivious Stabilizing Consensus in Dynamic Networks (Q6488436) (← links)
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus (Q6536339) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
