 | 2011 |
|---|
| 8 |       | Eyal Bin,
Ofer Biran,
Odellia Boni,
Erez Hadad,
Elliot K. Kolodner,
Yosef Moatti,
Dean H. Lorenz:
Guaranteeing High Availability Goals for Virtual Machine Placement.
ICDCS 2011: 700-709 |
| 2003 |
|---|
| 7 | | Antonio Abbondanzio,
Yariv Aridor,
Ofer Biran,
Liana L. Fong,
Germán S. Goldszmidt,
Richard E. Harper,
Srirama M. Krishnakumar,
Gregory Brian Pruett,
Ben-Ami Yassur:
Management of application complexes in multitier clustered systems.
IBM Systems Journal 42(1): 189- (2003) |
| 6 | | Prasenjit Sarkar,
Kaladhar Voruganti,
Kalman Z. Meth,
Ofer Biran,
Julian Satran:
Internet Protocol storage area networks.
IBM Systems Journal 42(2): 218-231 (2003) |
| 1995 |
|---|
| 5 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
Theor. Comput. Sci. 145(1&2): 271-290 (1995) |
| 1990 |
|---|
| 4 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks.
WDAG 1990: 373-389 |
| 3 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
Deciding 1-sovability of distributed task is NP-hard.
WG 1990: 206-220 |
| 2 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
A Combinatorial Characterization of the Distributed 1-Solvable Tasks.
J. Algorithms 11(3): 420-440 (1990) |
| 1988 |
|---|
| 1 | | Ofer Biran,
Shlomo Moran,
Shmuel Zaks:
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor.
PODC 1988: 263-275 |
Data released under the ODC-BY 1.0 license — See also our legal information page