| 2013 | TrustCom | Multivalued and Deterministic Peer-to-Peer Polling in Social Networks with Reputation Conscious Participants. | Burkhard Englert, Reza Gheissari |
| 2009 | OPODIS | On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. | Burkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman |
| 2006 | ISPA | Implementing Overlapping Domain Decomposition Methods on a Virtual Parallel Machine. | David Darjany, Burkhard Englert, Eun Heui Kim |
| 2006 | ISPA | Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform. | Burkhard Englert |
| 2006 | OPODIS | On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention. | Burkhard Englert |
| 2005 | ICPADS | An efficient long-lived adaptive collect algorithm. | Burkhard Englert |
| 2005 | OPODIS | Can Memory Be Used Adaptively by Uniform Algorithms? | Burkhard Englert, Darin Goldstein |
| 2003 | PODC | On using network attached disks as shared memory. | Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni |
| 2002 | ICDCS | Fast Collect in the absence of contention. | Burkhard Englert, Eli Gafni |
| 2001 | ICDCS | Developing and Refining an Adaptive Token-Passing Strategy. | Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman |
| 2000 | ICDCS | Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory. | Burkhard Englert, Alexander A. Shvartsman |