Selected PUBLICATIONS

"Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors", M. Herlihy and L. D. Penso, DISC 2003 and Distributed Computing: The authors give a new optimal (in terms of resilience) deterministic consensus protocol and its related lower bounds in an asynchronous environment with a special cluster-based failure detection, called limited-scope. For that, techniques borrowed from combinatorial topology are employed.

"Relating Stabilizing Timing Assumptions to Stabilizing Failure Detectors Regarding Solvability and Efficiency", M. Biely, M. Hutle, L. D. Penso and J. Widder, SSS 2007: The authors show, through protocol automatic transformations, that distinct computational models with stabilizing properties are equivalent regarding solvability, and analyze efficiency issues. Such models include the partially synchronous model, where eventually the distributed system obeys bounds on computing speeds and message delays, or the asynchronous distributed system model augmented with unreliable failure detectors, where eventually failure detectors do not make mistakes.

"Optimal Randomized Fair Exchange with Secret Shared Coins", F. C. Freiling, M. Herlihy, and L. D. Penso, OPODIS 2005: The authors present a novel optimal (in terms of resilience and time) randomized consensus protocol in a message omission synchronous setting with trusted coprocessors and shared coins, useful for e-business.

"From Crash-Stop to Permanent Omission: Automatic Transformation and Weak Failure Detectors", C. Delporte-Gallet, H. Fauconnier, F. C. Freiling, L. D. Penso and A. Tielmann, DISC2007: The authors give a new failure detection automatic transformation from the crash model to the message omission model, which is weakest failure detection preserving, more precisely, for the Omega failure detector.

"Secure Failure Detection in TrustedPals", R. Cortinas, F. C. Freiling, M. Ghajar-Azadanlou, A. Lafuente, M. Larrea, L. D. Penso and I. S. Arriola, SSS 2007: The authors investigate the feasibility of providing a deterministic, efficient and secure solution to consensus in the presence of partial synchrony with a certain failure detection, called eventually perfect, in a message omission asynchronous setting with trusted coprocessors.