| Publication | Date of Publication | Type |
|---|
| Tractable low-delay atomic memory | 2021-03-12 | Paper |
| The complexity of synchronous iterative Do-All with crashes | 2020-12-04 | Paper |
| Performing tasks on synchronous restartable message-passing processors | 2020-12-03 | Paper |
| In memoriam Paris C. Kanellakis | 2019-08-09 | Paper |
| Writing-all deterministically and optimally using a nontrivial number of asynchronous processors | 2018-11-05 | Paper |
| Specifying and using a partitionable group communication service | 2017-09-29 | Paper |
| Brief Announcement | 2017-09-29 | Paper |
| Doing-it-all with bounded work and communication | 2017-05-18 | Paper |
| Dealing with Undependable Workers in Decentralized Network Supercomputing | 2016-12-19 | Paper |
| Reconfigurable distributed storage for dynamic networks | 2015-12-18 | Paper |
| Counting networks are practically linearizable | 2015-09-11 | Paper |
| Performing work with asynchronous processors | 2015-09-04 | Paper |
| Efficient parallel algorithms on restartable fail-stop processors | 2015-06-19 | Paper |
| Brief announcement | 2014-12-05 | Paper |
| Dealing with undependable workers in decentralized network supercomputing | 2014-12-02 | Paper |
| A formal treatment of an abstract channel implementation using java sockets and TCP | 2014-03-13 | Paper |
| Distributed scheduling for disconnected cooperation | 2013-06-13 | Paper |
| Emulating shared-memory do-all algorithms in asynchronous message-passing systems | 2012-03-07 | Paper |
| \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks | 2012-02-06 | Paper |
| Optimal deployment of eventually-serializable data services | 2011-06-22 | Paper |
| Work-competitive scheduling for cooperative computing with dynamic groups | 2010-08-16 | Paper |
| Collective asynchronous reading with polylogarithmic worst-case overhead | 2010-08-15 | Paper |
| Distributed Computing | 2010-02-23 | Paper |
| At-Most-Once Semantics in Asynchronous Shared Memory | 2009-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396596 | 2009-09-19 | Paper |
| A robust randomized algorithm to perform independent tasks | 2009-02-23 | Paper |
| On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory | 2008-11-20 | Paper |
| Robust Network Supercomputing with Malicious Processes | 2008-09-09 | Paper |
| Long-lived RAMBO: trading knowledge for communication | 2007-09-19 | Paper |
| Dynamic load balancing with group communication | 2007-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5394311 | 2006-10-26 | Paper |
| Performing work with asynchronous processors: Message-delay-sensitive bounds | 2006-01-10 | Paper |
| Efficient gossip and robust distributed computation | 2005-12-29 | Paper |
| Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups | 2005-09-16 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Principles of Distributed Systems | 2005-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668735 | 2005-04-15 | Paper |
| Cooperative computing with fragmentable and mergeable groups | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437122 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437132 | 2003-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436048 | 2003-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413404 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3152802 | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766867 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232882 | 2000-05-18 | Paper |
| Timing conditions for linearizability in uniform counting networks | 1999-06-21 | Paper |
| Eventually-serializable data services | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344152 | 1997-07-15 | Paper |
| IN MEMORIAM Paris C. Kanellakis (1953–1995) | 1996-06-04 | Paper |
| Parallel Algorithms with Processor Failures and Delays | 1996-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847020 | 1995-09-10 | Paper |
| An efficient write-all algorithm for fail-stop PRAM without initialized memory | 1993-05-16 | Paper |
| Efficient parallel algorithms can be made robust | 1992-09-27 | Paper |
| Achieving optimal CRCW PRAM fault-tolerance | 1992-06-27 | Paper |
