According to our database1, Martin Hutle authored at least 24 papers between 2002 and 2016.
Legend:Book In proceedings Article PhD thesis Other
Analysing cyber-physical attacks to a Smart Grid: A voltage control use case.
Proceedings of the Power Systems Computation Conference, 2016
Adaptive Modelling for Security Analysis of Networked Control Systems.
Proceedings of the 4th International Symposium for ICS & SCADA Cyber Security Research 2016, 2016
Analyzing the Security and Privacy of Cloud-based Video Surveillance Systems.
Proceedings of the 2nd ACM International Workshop on IoT Privacy, Trust, and Security, 2016
Tolerating permanent and transient value faults.
Distributed Computing, 2014
Quantitative Analysis of Consensus Algorithms.
IEEE Trans. Dependable Sec. Comput., 2012
Timing analysis of leader-based and decentralized Byzantine consensus algorithms.
J. Braz. Comp. Soc., 2012
Brief announcement: tolerating permanent and transient value faults.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Consensus when all processes may be Byzantine for some time.
Theor. Comput. Sci., 2011
Structured Derivation of Semi-Synchronous Algorithms.
Proceedings of the Distributed Computing - 25th International Symposium, 2011
On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults.
Proceedings of the 30th IEEE Symposium on Reliable Distributed Systems (SRDS 2011), 2011
In search of lost time.
Inf. Process. Lett., 2010
Swift Algorithms for Repeated Consensus.
Proceedings of the 29th IEEE Symposium on Reliable Distributed Systems (SRDS 2010), New Delhi, Punjab, India, October 31, 2010
Chasing the Weakest System Model for Implementing Ω and Consensus.
IEEE Trans. Dependable Sec. Comput., 2009
Latency-aware leader election.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009
Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009
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
Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults.
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007
Brief Announcement: Chasing the Weakest System Model for Implementing Omega and Consensus.
Proceedings of the Stabilization, 2006
On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection.
Proceedings of the Self-Stabilizing Systems, 2005
Brief announcement: on the possibility and the impossibility of message-driven self-stabilizing failure detection.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005
Self-Stabilizing Failure Detector Algorithms.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2005
An efficient failure detector for sparsely connected networks.
Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, 2004
Combining hypertree, bicomp, and hinge decomposition.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002