Peter Robinson

Peter Robinson Projektass.(FWF) Dipl.-Ing.
E-Mail
Phone	+43 (1) 58801-18253
Fax	+43 (1) 58801-18297
Address	Vienna University of Technology Institute of Computer Engineering Embedded Computing Systems Group Treitlstrasse 3, 2nd floor, 1040 Wien, Austria

In Oct and Nov 2009 he was working at the Distributed Computing Group at the Texas A&M University.

Research

• Computing models with weak synchrony assumptions for implementing failure detectors.
  
• The k-set agreement problem: exploring the borderland between synchrony and asynchrony.
  

Publications

• Martin Biely, Peter Robinson, and Ulrich Schmid. Just Enough Synchrony for Message Passing k-Set Agreement. 2009. (under submission).
  
• Martin Biely, Peter Robinson, and Ulrich Schmid. Weak Synchrony Models and Failure Detectors for Message Passing k-Set Agreement. 13th International Conference On Principle Of Distributed Systems (OPODIS 2009). Nimes, France. 2009. Publisher: Springer Verlag.
  
• Martin Biely, Peter Robinson, and Ulrich Schmid. Brief Announcement: Weak Synchrony Models and Failure Detectors for Message Passing k-Set Agreement. 23rd International Symposium on Distributed Computing (DISC 2009). Elche/Elx, Spain, 2009. Publisher: Springer Verlag.
  
• Peter Robinson and Ulrich Schmid. The Asynchronous Bounded-Cycle Model.
  "Best Paper" Award at the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2008). Detroit (USA), 2008. Publisher: Springer Verlag.
• Peter Robinson and Ulrich Schmid. Brief Announcement: The Asynchronous Bounded-Cycle Model. Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), Toronto (Canada), 2008. Publisher: ACM New York.
• Peter Robinson. Log File Processing by Machine Learning and Information Extraction. Master Thesis. TU Vienna, Institute of Computer Languages, 2006. Nominated for Distinguished Young Alumnus Award.

Interests

• Distributed computing models and algorithms.
• Haskell, a lazy, purely functional programming language with outstanding support for parallelism, multicore programming, and software transactional memory (STM).
  
• Go, a board game far more complex than chess despite having simple rules.