| 2012 | ||
|---|---|---|
| c6 | Nicolò Maria Calcavecchia, Ofer Biran, Erez Hadad, Yosef Moatti: VM Placement Strategies for Cloud Scenarios. IEEE CLOUD 2012: 852-859 | |
| c5 | Ofer Biran, Antonio Corradi, Mario Fanelli, Luca Foschini, Alexander Nus, Danny Raz, Ezra Silvera: A Stable Network-Aware VM Placement for Cloud Systems. CCGRID 2012: 498-506 | |
| 2011 | ||
| c4 | 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 | ||
| j4 | 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) | |
| j3 | 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 | ||
| j2 | 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 | ||
| j1 | Ofer Biran, Shlomo Moran, Shmuel Zaks: A Combinatorial Characterization of the Distributed 1-Solvable Tasks. J. Algorithms 11(3): 420-440 (1990) | |
| c3 | Ofer Biran, Shlomo Moran, Shmuel Zaks: Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. WDAG 1990: 373-389 | |
| c2 | Ofer Biran, Shlomo Moran, Shmuel Zaks: Deciding 1-sovability of distributed task is NP-hard. WG 1990: 206-220 | |
| 1988 | ||
| c1 | 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 | |
Colors in the list of coauthors
Last update Sat May 25 07:51:44 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page