 | 2011 |
| 12 |  | Matthias Majuntke,
Dan Dobre,
Christian Cachin,
Neeraj Suri:
Fork-Consistent Constructions from Registers.
OPODIS 2011: 283-298 |
| 11 |  | Matthias Majuntke,
Dan Dobre,
Neeraj Suri:
Fork-consistent constructions from registers.
PODC 2011: 209-210 |
| 10 |  | Dan Dobre,
Rachid Guerraoui,
Matthias Majuntke,
Neeraj Suri,
Marko Vukolic:
The complexity of robust atomic storage.
PODC 2011: 59-68 |
| 2010 |
| 9 |  | Marco Serafini,
Péter Bokor,
Dan Dobre,
Matthias Majuntke,
Neeraj Suri:
Scrooge: Reducing the costs of fast Byzantine replication in presence of unresponsive replicas.
DSN 2010: 353-362 |
| 8 |  | Dan Dobre,
Matthias Majuntke,
Marco Serafini,
Neeraj Suri:
HP: Hybrid Paxos for WANs.
EDCC 2010: 117-126 |
| 7 |  | Marco Serafini,
Dan Dobre,
Matthias Majuntke,
Péter Bokor,
Neeraj Suri:
Eventually linearizable shared objects.
PODC 2010: 95-104 |
| 6 |  | Dan Dobre:
Time-efficient asynchronous service replication.
Darmstadt University of Technology 2010: 1-176 |
| 2009 |
| 5 |  | Matthias Majuntke,
Dan Dobre,
Marco Serafini,
Neeraj Suri:
Abortable Fork-Linearizable Storage.
OPODIS 2009: 255-269 |
| 4 |  | Dan Dobre,
Matthias Majuntke,
Marco Serafini,
Neeraj Suri:
Efficient Robust Storage Using Secret Tokens.
SSS 2009: 269-283 |
| 2008 |
| 3 |  | Dan Dobre,
Matthias Majuntke,
Neeraj Suri:
On the Time-Complexity of Robust and Amnesic Storage.
OPODIS 2008: 197-216 |
| 2007 |
| 2 |  | Dan Dobre,
HariGovind V. Ramasamy,
Neeraj Suri:
On the Latency Efficiency of Message-Parsimonious Asynchronous Atomic Broadcast.
SRDS 2007: 311-322 |
| 2006 |
| 1 |  | Dan Dobre,
Neeraj Suri:
One-step Consensus with Zero-Degradation.
DSN 2006: 137-146 |