Martin Biely

Orcid: 0000-0003-0755-5263

According to our database1, Martin Biely authored at least 22 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
On the hardness of the strongly dependent decision problem.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2018
Gracefully degrading consensus and <i>k</i>-set agreement in directed dynamic networks.
Theor. Comput. Sci., 2018

2015
Gracefully Degrading Consensus and k-Set Agreement in Directed Dynamic Networks.
Proceedings of the Networked Systems - Third International Conference, 2015

2014
The Generalized Loneliness Detector and Weak System Models for k-Set Agreement.
IEEE Trans. Parallel Distributed Syst., 2014

On the impact of link faults on Byzantine agreement.
Inf. Comput., 2014

Brief announcement: gracefully degrading consensus and k-set agreement under dynamic link failures.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Bounded Delay in Byzantine-Tolerant State Machine Replication.
Proceedings of the IEEE 32nd Symposium on Reliable Distributed Systems, 2013

Distal: A framework for implementing fault-tolerant distributed algorithms.
Proceedings of the 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2013

2012
Consensus in the presence of mortal Byzantine faulty processes.
Distributed Comput., 2012

S-Paxos: Offloading the Leader for High Throughput State Machine Replication.
Proceedings of the IEEE 31st Symposium on Reliable Distributed Systems, 2012

Agreement in Directed Dynamic Networks.
Proceedings of the Structural Information and Communication Complexity, 2012

2011
Synchronous consensus under hybrid process and link failures.
Theor. Comput. Sci., 2011

Consensus when all processes may be Byzantine for some time.
Theor. Comput. Sci., 2011

Easy impossibility proofs for k-set agreement in message passing systems.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Solving k-Set Agreement with Stable Skeleton Graphs.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

2009
Optimal message-driven implementations of omega with mute processes.
ACM Trans. Auton. Adapt. Syst., 2009

Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing (<i>k</i>-)Set Agreement.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Weak Synchrony Models and Failure Detectors for Message Passing (<i>k</i>-)Set Agreement.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2007
Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency.
Proceedings of the Stabilization, 2007

Tolerating corrupted communication.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Optimal Message-Driven Implementation of Omega with Mute Processes.
Proceedings of the Stabilization, 2006

2005
Proof-Based System Engineering Using a Virtual System Model.
Proceedings of the Service Availability, 2005


  Loading...