The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects. - Ulrich Schmid 001 (ICALP, 1992)

Monitoring of Distributed Real-Time Systems. - Ulrich Schmid 001 (NATO ASI RTC, 1992)

The Role of Standards in Real-Time Computing. - Ulrich Schmid 001 (NATO ASI RTC, 1992)

FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions. - Johann Blieberger; Ulrich Schmid 001 (BIT, 1992)

On a tree collision resolution algorithm in presence of capture. - Ulrich Schmid 001 (RAIRO Theor. Informatics Appl., 1992)

Some Investigations on FCFS Scheduling in Hard Real Time Applications. - Ulrich Schmid 001; Johann Blieberger (J. Comput. Syst. Sci., 1992)

Preemptive LCFS Scheduling in Hard Real-Time Applications. - Johann Blieberger; Ulrich Schmid 001 (Perform. Evaluation, 1992)

Exponential Limiting Distributions in Queueing Systems with Deadlines. - Michael Drmota; Ulrich Schmid 001 (SIAM J. Appl. Math., 1993)

The Average CRI-Length of a Controlled ALOHA Collision Resolution Algorithm. - Ulrich Schmid 001 (Theor. Comput. Sci., 1993)

The analysis of the expected successful operation time of slotted Aloha. - Michael Drmota; Ulrich Schmid 001 (IEEE Trans. Inf. Theory, 1993)

Monitoring Distributed Real-Times. - Ulrich Schmid 001 (Real Time Syst., 1994)

SSCMP: The Sequenced Synchronized Clock Message Protocol. - Ulrich Schmid 001; Alfred Pusterhofer (Comput. Networks ISDN Syst., 1995)

On Nonpreemptive LCFS Scheduling with Deadlines. - Ulrich Schmid 001; Johann Blieberger (J. Algorithms, 1995)

Random Trees in Queueing Systems with Deadlines. - Ulrich Schmid 001 (Theor. Comput. Sci., 1995)

Static priority scheduling of aperiodic real-time tasks. - Ulrich Schmid 001 (Random Struct. Algorithms, 1997)

Interval-based Clock Synchronization. - Ulrich Schmid 001; Klaus Schossmaier (Real Time Syst., 1997)

Specification and Implementation of the Universal Time Coordinated Synchronization Unit (UTCSU). - Klaus Schossmaier; Ulrich Schmid 001; Martin Horauer; Dietmar Loy (Real Time Syst., 1997)

Real-Time Systems - Panel Overview. - Wolfgang A. Halang; K. H. Kim; Kinji Mori; Ulrich Schmid 001; Horst F. Wedde (COMPSAC, 1998)

NTI: A Network Time Interface M-Module for High-Accuracy Clock-Synchronization. - Martin Horauer; Ulrich Schmid 001; Klaus Schossmaier (IPPS/SPDP Workshops, 1998)

The SimUTC Fault-Tolerant Distributed Systems Simulation Toolkit. - Bettina Weiss; Günther Gridling; Ulrich Schmid 001; Klaus Schossmaier (MASCOTS, 1999)

Orthogonal Accuracy Clock Synchronization. - Ulrich Schmid 001 (Chic. J. Theor. Comput. Sci., 2000)

A Network Time Interface M-Module for Distributing GPS-Time over LANs. - Ulrich Schmid 001; Johann Klasek; Thomas Mandl 003; Herbert Nachtnebel; Gerhard R. Cadek; Nikolaus Kerö (Real Time Syst., 2000)

How to Model Link Failures: A Perception-Based Fault Model. - Ulrich Schmid 001 (DSN, 2001)

Consensus with Written Messages Under Link Faults. - Bettina Weiss; Ulrich Schmid 001 (SRDS, 2001)

Applied research: a scientist's perspective. - Ulrich Schmid 001 (Annu. Rev. Control., 2001)

How to reconcile fault-tolerant interval intersection with the Lipschitz condition. - Ulrich Schmid 001; Klaus Schossmaier (Distributed Comput., 2001)

Formally Verified Byzantine Agreement in Presence of Link Faults. - Ulrich Schmid 001; Bettina Weiss; John M. Rushby (ICDCS, 2002)

Randomized Asynchronous Consensus with Imperfect Communications. - Ulrich Schmid 001; Christof Fetzer (SRDS, 2003)

Interval-based clock synchronization with optimal precision. - Ulrich Schmid 001; Klaus Schossmaier (Inf. Comput., 2003)

Brief announcement: on the possibility of consensus in asynchronous systems with finite average response times. - Christof Fetzer; Ulrich Schmid 001 (PODC, 2004)

Failure Detection with Booting in Partially Synchronous Systems. - Josef Widder; Gérard Le Lann; Ulrich Schmid 001 (EDCC, 2005)

On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times. - Christof Fetzer; Ulrich Schmid 001; Martin Süßkraut (ICDCS, 2005)

Proof-Based System Engineering Using a Virtual System Model. - Martin Biely; Gérard Le Lann; Ulrich Schmid 001 (ISAS, 2005)

Fault-Tolerant Distributed Clock Generation in VLSI Systems-on-Chip. - Matthias Függer; Ulrich Schmid 001; Gottfried Fuchs; Gerald Kempf (EDCC, 2006)

Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems. - Heinrich Moser; Ulrich Schmid 001 (OPODIS, 2006)

Brief Announcement: Chasing the Weakest System Model for Implementing Omega and Consensus. - Martin Hutle; Dahlia Malkhi; Ulrich Schmid 001; Lidong Zhou (SSS, 2006)

Booting clock synchronization in partially synchronous systems with hybrid process and link failures. - Josef Widder; Ulrich Schmid 001 (Distributed Comput., 2007)

FIT-IT-Projekt DARTS: dezentrale fehlertolerante Taktgenerierung. - Ulrich Schmid 001; Andreas Steininger; Manfred Sust (Elektrotech. Informationstechnik, 2007)

08371 Abstracts Collection - Fault-Tolerant Distributed Algorithms on VLSI Chips. - Bernadette Charron-Bost; Shlomi Dolev; Jo C. Ebergen; Ulrich Schmid 001 (Fault-Tolerant Distributed Algorithms on VLSI Chips, 2008)

08371 Summary - Fault-Tolerant Distributed Algorithms on VLSI Chips. - Bernadette Charron-Bost; Shlomi Dolev; Jo C. Ebergen; Ulrich Schmid 001 (Fault-Tolerant Distributed Algorithms on VLSI Chips, 2008)

Mapping a Fault-Tolerant Distributed Algorithm to Systems on Chip. - Gottfried Fuchs; Matthias Függer; Ulrich Schmid 001; Andreas Steininger (DSD, 2008)

Optimal Deterministic Remote Clock Estimation in Real-Time Systems. - Heinrich Moser; Ulrich Schmid 001 (OPODIS, 2008)

Keynote: Distributed Algorithms and VLSI. - Ulrich Schmid 001 (SSS, 2008)

Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (OPODIS, 2009)

Brief announcement: how to speed-up fault-tolerant clock generation in VLSI systems-on-chip via pipelining. - Andreas Dielacher; Matthias Függer; Ulrich Schmid 001 (PODC, 2009)

Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (DISC, 2009)

The Theta-Model: achieving synchrony without clocks. - Josef Widder; Ulrich Schmid 001 (Distributed Comput., 2009)

Impossibility Results and Lower Bounds for Consensus under Link Failures. - Ulrich Schmid 001; Bettina Weiss; Idit Keidar (SIAM J. Comput., 2009)

Chasing the Weakest System Model for Implementing Ω and Consensus. - Martin Hutle; Dahlia Malkhi; Ulrich Schmid 001; Lidong Zhou (IEEE Trans. Dependable Secur. Comput., 2009)

How to Speed-Up Fault-Tolerant Clock Generation in VLSI Systems-on-Chip via Pipelining. - Matthias Függer; Andreas Dielacher; Ulrich Schmid 001 (EDCC, 2010)

Synchrony and Time in Fault-Tolerant Distributed Algorithms - (Invited Tutorial). - Ulrich Schmid 001 (FORMATS, 2010)

Topology control for fault-tolerant communication in wireless ad hoc networks. - Bernd Thallner; Heinrich Moser; Ulrich Schmid 001 (Wirel. Networks, 2010)

Solving k-Set Agreement with Stable Skeleton Graphs. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (IPDPS Workshops, 2011)

Easy impossibility proofs for k-set agreement in message passing systems. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (PODC, 2011)

Reconciling Fault-Tolerant Distributed Algorithms and Real-Time Computing - (Extended Abstract). - Heinrich Moser; Ulrich Schmid 001 (SIROCCO, 2011)

Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract]. - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Ulrich Schmid 001 (SSS, 2011)

Synchronous consensus under hybrid process and link failures. - Martin Biely; Ulrich Schmid 001; Bettina Weiss (Theor. Comput. Sci., 2011)

The Asynchronous Bounded-Cycle model. - Peter Robinson 002; Ulrich Schmid 001 (Theor. Comput. Sci., 2011)

Architecture and Design Analysis of a Digital Single-Event Transient/Upset Measurement Chip. - Varadan Savulimedu Veeravalli; Thomas Polzer; Andreas Steininger; Ulrich Schmid 001 (DSD, 2012)

Agreement in Directed Dynamic Networks. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (SIROCCO, 2012)

FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Markus Posch; Ulrich Schmid 001; Andreas Steininger (CoRR, 2012)

Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms - Annu John; Igor Konnov 001; Ulrich Schmid 001; Helmut Veith; Josef Widder (CoRR, 2012)

Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms - Annu John; Igor Konnov 001; Ulrich Schmid 001; Helmut Veith; Josef Widder (CoRR, 2012)

Reconciling fault-tolerant distributed computing and systems-on-chip. - Matthias Függer; Ulrich Schmid 001 (Distributed Comput., 2012)

Efficient Construction of Global Time in SoCs Despite Arbitrary Faults. - Christoph Lenzen 001; Matthias Függer; Markus Hofstatter; Ulrich Schmid 001 (DSD, 2013)

Large-scale autostereoscopic outdoor display. - Jörg Reitterer; Franz Fidler; Ferdinand Saint Julien-Wallsee; Gerhard Schmid; Wolfgang Gartner; Walter Leeb; Ulrich Schmid 001 (SD&A, 2013)

Parameterized model checking of fault-tolerant distributed algorithms by abstraction. - Annu John; Igor Konnov 001; Ulrich Schmid 001; Helmut Veith; Josef Widder (FMCAD, 2013)

Automated analysis of real-time scheduling using graph games. - Krishnendu Chatterjee; Alexander Kößler; Ulrich Schmid 001 (HSCC, 2013)

Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction. - Annu John; Igor Konnov 001; Ulrich Schmid 001; Helmut Veith; Josef Widder (PODC, 2013)

Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms. - Annu John; Igor Konnov 001; Ulrich Schmid 001; Helmut Veith; Josef Widder (SPIN, 2013)

An infrastructure for accurate characterization of single-event transients in digital circuits. - Varadan Savulimedu Veeravalli; Thomas Polzer; Ulrich Schmid 001; Andreas Steininger; Michael Hofbauer; Kurt Schweiger; Horst Dietrich; Kerstin Schneider-Hornstein; Horst Zimmermann; Kay-Obbe Voss; Bruno Merk; Michael Hajek (Microprocess. Microsystems, 2013)

Measuring SET pulsewidths in logic gates using digital infrastructure. - Varadan Savulimedu Veeravalli; Andreas Steininger; Ulrich Schmid 001 (ISQED, 2014)

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures. - Manfred Schwarz; Kyrill Winkler; Ulrich Schmid 001; Martin Biely; Peter Robinson 002 (PODC, 2014)

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. - Krishnendu Chatterjee; Andreas Pavlogiannis; Alexander Kößler; Ulrich Schmid 001 (RTSS, 2014)

Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms. - Annu Gmeiner; Igor Konnov 001; Ulrich Schmid 001; Helmut Veith; Josef Widder (SFM, 2014)

Faithful Glitch Propagation in Binary Circuit Models. - Matthias Függer; Robert Najvirt; Thomas Nowak; Ulrich Schmid 001 (CoRR, 2014)

Reconciling fault-tolerant distributed algorithms and real-time computing. - Heinrich Moser; Ulrich Schmid 001 (Distributed Comput., 2014)

Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation. - Danny Dolev; Matthias Függer; Ulrich Schmid 001; Christoph Lenzen 001 (J. ACM, 2014)

Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip. - Danny Dolev; Matthias Függer; Markus Posch; Ulrich Schmid 001; Andreas Steininger; Christoph Lenzen 001 (J. Comput. Syst. Sci., 2014)

The Generalized Loneliness Detector and Weak System Models for k-Set Agreement. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001 (IEEE Trans. Parallel Distributed Syst., 2014)

Towards binary circuit models that faithfully capture physical solvability. - Matthias Függer; Robert Najvirt; Thomas Nowak; Ulrich Schmid 001 (DATE, 2015)

Experimental Validation of a Faithful Binary Circuit Model. - Robert Najvirt; Ulrich Schmid 001; Michael Hofbauer; Matthias Függer; Thomas Nowak; Kurt Schweiger (ACM Great Lakes Symposium on VLSI, 2015)

Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001; Manfred Schwarz; Kyrill Winkler (NETYS, 2015)

Fault-tolerant Distributed Systems in Hardware. - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Ulrich Schmid 001; Andreas Steininger (Bull. EATCS, 2015)

Building reliable systems-on-chip in nanoscale technologies. - Andreas Steininger; Horst Zimmermann; Axel Jantsch; Michael Hofbauer; Ulrich Schmid 001; Kurt Schweiger; Varadan Savulimedu Veeravalli (Elektrotech. Informationstechnik, 2015)

The effect of forgetting on the performance of a synchronizer. - Matthias Függer; Alexander Kößler; Thomas Nowak; Ulrich Schmid 001; Martin Zeiner (Perform. Evaluation, 2015)

Fast consensus under eventually stabilizing message adversaries. - Manfred Schwarz; Kyrill Winkler; Ulrich Schmid 001 (ICDCN, 2016)

Consensus in Directed Dynamic Networks with Short-Lived Stability. - Kyrill Winkler; Manfred Schwarz; Ulrich Schmid 001 (CoRR, 2016)

HEX: Scaling honeycombs is easier than scaling clock trees. - Danny Dolev; Matthias Függer; Christoph Lenzen 001; Martin Perner; Ulrich Schmid 001 (J. Comput. Syst. Sci., 2016)

Unfaithful Glitch Propagation in Existing Binary Circuit Models. - Matthias Függer; Thomas Nowak; Ulrich Schmid 001 (IEEE Trans. Computers, 2016)

Linear-Time Data Dissemination in Dynamic Networks. - Manfred Schwarz; Martin Zeiner; Ulrich Schmid 001 (CoRR, 2017)

A versatile architecture for long-term monitoring of single-event transient durations. - Varadan Savulimedu Veeravalli; Andreas Steininger; Ulrich Schmid 001 (Microprocess. Microsystems, 2017)

Verifying nonlinear analog and mixed-signal circuits with inputs. - Chuchu Fan; Yu Meng 001; Jürgen Maier 002; Ezio Bartocci; Sayan Mitra; Ulrich Schmid 001 (ADHS, 2018)

A faithful binary circuit model with adversarial noise. - Matthias Függer; Jürgen Maier 002; Robert Najvirt; Thomas Nowak; Ulrich Schmid 001 (DATE, 2018)

Self-Stabilizing High-Speed Communication in Multi-Synchronous GALS Architectures. - Martin Perner; Ulrich Schmid 001 (IOLTS, 2018)

2018 Edsger W. Dijkstra Prize in Distributed Computing. - Yehuda Afek; Idit Keidar; Boaz Patt-Shamir; Sergio Rajsbaum; Ulrich Schmid 001; Gadi Taubenfeld (PODC, 2018)

On the Strongest Message Adversary for Consensus in Directed Dynamic Networks. - Ulrich Schmid 001; Manfred Schwarz; Kyrill Winkler (SIROCCO, 2018)

On Knowledge and Communication Complexity in Distributed Systems. - Daniel Pfleger; Ulrich Schmid 001 (SIROCCO, 2018)

Automated competitive analysis of real-time scheduling with graph games. - Krishnendu Chatterjee; Andreas Pavlogiannis; Alexander Kößler; Ulrich Schmid 001 (Real Time Syst., 2018)

Gracefully degrading consensus and k-set agreement in directed dynamic networks. - Martin Biely; Peter Robinson 002; Ulrich Schmid 001; Manfred Schwarz; Kyrill Winkler (Theor. Comput. Sci., 2018)

Transistor-Level Analysis of Dynamic Delay Models. - Jürgen Maier 002; Matthias Függer; Thomas Nowak; Ulrich Schmid 001 (ASYNC, 2019)

Epistemic Reasoning with Byzantine-Faulty Agents. - Roman Kuznets; Laurent Prosperi; Ulrich Schmid 001; Krisztina Fruzsa (FroCos, 2019)

A Characterization of Consensus Solvability for Closed Message Adversaries. - Kyrill Winkler; Ulrich Schmid 001; Yoram Moses (OPODIS, 2019)

The Involution Tool for Accurate Digital Timingand Power Analysis. - Daniel Öhlinger; Jürgen Maier 002; Matthias Függer; Ulrich Schmid 001 (PATMOS, 2019)

2019 Principles of Distributed Computing Doctoral Dissertation Award. - Prasad Jayanti; Nancy A. Lynch; Boaz Patt-Shamir; Ulrich Schmid 001 (PODC, 2019)

Topological Characterization of Consensus under General Message Adversaries. - Thomas Nowak; Ulrich Schmid 001; Kyrill Winkler (PODC, 2019)

A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus. - Hugo Rincon Galeana; Kyrill Winkler; Ulrich Schmid 001; Sergio Rajsbaum (SSS, 2019)

Causality and Epistemic Reasoning in Byzantine Multi-Agent Systems. - Roman Kuznets; Laurent Prosperi; Ulrich Schmid 001; Krisztina Fruzsa (TARK, 2019)

On linear-time data dissemination in dynamic rooted trees. - Martin Zeiner; Manfred Schwarz; Ulrich Schmid 001 (Discret. Appl. Math., 2019)

Consensus in rooted dynamic networks with short-lived stability. - Kyrill Winkler; Manfred Schwarz; Ulrich Schmid 001 (Distributed Comput., 2019)

An Overview of Recent Results for Consensus in Directed Dynamic Networks. - Kyrill Winkler; Ulrich Schmid 001 (Bull. EATCS, 2019)

The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks. - Thomas Schlögl; Ulrich Schmid 001; Roman Kuznets (PRIMA, 2020)

A Faithful Binary Circuit Model. - Matthias Függer; Robert Najvirt; Thomas Nowak; Ulrich Schmid 001 (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. - Andreas Pavlogiannis; Nico Schaumberger; Ulrich Schmid 001; Krishnendu Chatterjee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

Valency-Based Consensus Under Message Adversaries Without Limit-Closure. - Kyrill Winkler; Ulrich Schmid 001; Thomas Nowak (FCT, 2021)

A Composable Glitch-Aware Delay Model. - Jürgen Maier 002; Daniel Öhlinger; Ulrich Schmid 001; Matthias Függer; Thomas Nowak (ACM Great Lakes Symposium on VLSI, 2021)

Round-Oblivious Stabilizing Consensus in Dynamic Networks. - Manfred Schwarz; Ulrich Schmid 001 (SSS, 2021)

Fire! - Krisztina Fruzsa; Roman Kuznets; Ulrich Schmid 001 (TARK, 2021)

Continuous Tasks and the Chromatic Simplicial Approximation Theorem. - Hugo Rincon Galeana; Sergio Rajsbaum; Ulrich Schmid 001 (CoRR, 2021)

Optimal strategies for selecting coordinators. - Martin Zeiner; Ulrich Schmid 001; Krishnendu Chatterjee (Discret. Appl. Math., 2021)

The Involution Tool for Accurate Digital Timing and Power Analysis. - Daniel Öhlinger; Jürgen Maier 002; Matthias Függer; Ulrich Schmid 001 (Integr., 2021)

On Specifications and Proofs of Timed Circuits. - Matthias Függer; Christoph Lenzen 001; Ulrich Schmid 001 (Principles of Systems Design, 2022)

A Simple Hybrid Model for Accurate Delay Modeling of a Multi-Input Gate. - Arman Ferdowsi; Jürgen Maier 002; Daniel Öhlinger; Ulrich Schmid 001 (DATE, 2022)

Continuous Tasks and the Asynchronous Computability Theorem. - Hugo Rincon Galeana; Sergio Rajsbaum; Ulrich Schmid 001 (ITCS, 2022)

Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries. - Ami Paz; Hugo Rincon Galeana; Stefan Schmid 001; Ulrich Schmid 001; Kyrill Winkler (CoRR, 2022)

An Accurate Hybrid Delay Model for Multi-Input Gates. - Arman Ferdowsi; Ulrich Schmid 001; Josef Salzmann (CoRR, 2022)

A Digital Delay Model Supporting Large Adversarial Delay Variations. - Daniel Öhlinger; Ulrich Schmid 001 (DDECS, 2023)

A Hybrid Delay Model for Interconnected Multi-Input Gates. - Arman Ferdowsi; Matthias Függer; Josef Salzmann; Ulrich Schmid 001 (DSD, 2023)

Logic of Communication Interpretation: How to Not Get Lost in Translation. - Giorgio Cignarale; Roman Kuznets; Hugo Rincon Galeana; Ulrich Schmid 001 (FroCoS, 2023)

Continuity of Thresholded Mode-Switched ODEs and Digital Circuit Delay Models. - Arman Ferdowsi; Matthias Függer; Thomas Nowak; Ulrich Schmid 001 (HSCC, 2023)

Accurate Hybrid Delay Models for Dynamic Timing Analysis. - Arman Ferdowsi; Ulrich Schmid 001; Josef Salzmann (ICCAD, 2023)

A Sufficient Condition for Gaining Belief in Byzantine Fault-Tolerant Distributed Systems. - Thomas Schlögl; Ulrich Schmid 001 (TARK, 2023)

Topological Characterization of Consensus Solvability in Directed Dynamic Networks. - Hugo Rincon Galeana; Ulrich Schmid 001; Kyrill Winkler; Ami Paz; Stefan Schmid 001 (CoRR, 2023)

Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). - Armando Castañeda; Hans van Ditmarsch; Roman Kuznets; Yoram Moses; Ulrich Schmid 001 (Dagstuhl Reports, 2023)

The Role of A Priori Belief in the Design and Analysis of Fault-Tolerant Distributed Systems. - Giorgio Cignarale; Ulrich Schmid 001; Tuomas E. Tahko; Roman Kuznets (Minds Mach., 2023)

A Logic for Repair and State Recovery in Byzantine Fault-Tolerant Multi-agent Systems. - Hans van Ditmarsch; Krisztina Fruzsa; Roman Kuznets; Ulrich Schmid 001 (IJCAR (2), 2024)

Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. - Hugo Rincon Galeana; Ulrich Schmid 001 (SIROCCO, 2024)

Faithful Dynamic Timing Analysis of Digital Circuits Using Continuous Thresholded Mode-Switched ODEs. - Arman Ferdowsi; Matthias Függer; Thomas Nowak; Michael Drmota; Ulrich Schmid 001 (CoRR, 2024)

Topological Characterization of Stabilizing Consensus. - Ulrich Schmid 001; Stephan Felber; Hugo Rincon Galeana (CoRR, 2024)

The Time Complexity of Consensus Under Oblivious Message Adversaries. - Kyrill Winkler; Ami Paz; Hugo Rincon Galeana; Stefan Schmid 001; Ulrich Schmid 001 (Algorithmica, 2024)

Topological Characterization of Consensus in Distributed Systems. - Thomas Nowak; Ulrich Schmid 001; Kyrill Winkler (J. ACM, 2024)

Signal Prediction for Digital Circuits by Sigmoidal Approximations Using Neural Networks. - Josef Salzmann; Ulrich Schmid 001 (DATE, 2025)

Lower Bounds for k-Set Agreement in Fault-Prone Networks. - Pierre Fraigniaud; Minh-Hang Nguyen; Ami Paz; Ulrich Schmid 001; Hugo Rincon Galeana (CoRR, 2025)