 | 2009 |
|---|
| 13 |       | Michael Okun:
On the round complexity of Byzantine agreement without initial set-up.
Inf. Comput. 207(12): 1351-1368 (2009) |
| 12 | | Michael Okun,
Ilan Lampl:
Balance of excitation and inhibition.
Scholarpedia 4(8): 7467 (2009) |
| 2008 |
|---|
| 11 | | Michael Okun:
Byzantine Agreement.
Encyclopedia of Algorithms 2008 |
| 10 | | Michael Okun,
Amnon Barak,
Eli Gafni:
Renaming in synchronous message passing systems with Byzantine failures.
Distributed Computing 20(6): 403-413 (2008) |
| 9 | | Michael Okun,
Amnon Barak:
Efficient Algorithms for Anonymous Byzantine Agreement.
Theory Comput. Syst. 42(2): 222-238 (2008) |
| 2007 |
|---|
| 8 | | Lior Amar,
Amnon Barak,
Ely Levy,
Michael Okun:
An On-line Algorithm for Fair-Share Node Allocations in a Cluster.
CCGRID 2007: 83-91 |
| 7 | | Michael Okun:
On the Power of Impersonation Attacks.
DISC 2007: 494-495 |
| 2006 |
|---|
| 6 | | Michael Okun,
Amnon Barak:
Renaming in Message Passing Systems with Byzantine Failures.
DISC 2006: 16-30 |
| 2005 |
|---|
| 5 | | Michael Okun:
Agreement Among Unacquainted Byzantine Generals.
DISC 2005: 499-500 |
| 4 | | Michael Okun:
On approximation of the vertex cover problem in hypergraphs.
Discrete Optimization 2(1): 101-111 (2005) |
| 2004 |
|---|
| 3 | | Michael Okun,
Amnon Barak:
Atomic Writes for data integrity and consistency in shared storage devices for clusters.
Future Generation Comp. Syst. 20(4): 539-547 (2004) |
| 2003 |
|---|
| 2 | | Michael Okun,
Amnon Barak:
A new approach for approximating node deletion problems.
Inf. Process. Lett. 88(5): 231-236 (2003) |
| 2002 |
|---|
| 1 | | Michael Okun,
Amnon Barak:
On Node State Reconstruction for Fault Tolerant Distributed Algorithms.
SRDS 2002: 160- |
