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)

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)

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)

On the Strongest Message Adversary for Consensus in Directed Dynamic Networks. - Ulrich Schmid 001; Manfred Schwarz; Kyrill Winkler (SIROCCO, 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)

A Characterization of Consensus Solvability for Closed Message Adversaries. - Kyrill Winkler; Ulrich Schmid 001; Yoram Moses (OPODIS, 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)

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)

Lösbarkeit von Consensus unter Nachrichtengegnern. - Kyrill Winkler (Ausgezeichnete Informatikdissertationen, 2019)

On the radius of nonsplit graphs and information dissemination in dynamic networks. - Matthias Függer; Thomas Nowak; Kyrill Winkler (Discret. Appl. Math., 2020)

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

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)

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

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)