Search the dblp DataBase
Ofer Biran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Ofer Biran, Shlomo Moran, Shmuel Zaks
A Combinatorial Characterization of the Distributed Tasks Which Are Solvable in the Presence of One Faulty Processor. [Citation Graph (0, 0)][DBLP]
PODC, 1988, pp:263-275 [Conf] - Ofer Biran, Shlomo Moran, Shmuel Zaks
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP]
WDAG, 1990, pp:373-389 [Conf] - Ofer Biran, Shlomo Moran, Shmuel Zaks
Deciding 1-sovability of distributed task is NP-hard. [Citation Graph (0, 0)][DBLP]
WG, 1990, pp:206-220 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
IBM Systems Journal, 2003, v:42, n:1, pp:189-0 [Journal] - Prasenjit Sarkar, Kaladhar Voruganti, Kalman Z. Meth, Ofer Biran, Julian Satran
Internet Protocol storage area networks. [Citation Graph (0, 0)][DBLP]
IBM Systems Journal, 2003, v:42, n:2, pp:218-231 [Journal] - Ofer Biran, Shlomo Moran, Shmuel Zaks
A Combinatorial Characterization of the Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1990, v:11, n:3, pp:420-440 [Journal] - Ofer Biran, Shlomo Moran, Shmuel Zaks
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:145, n:1&2, pp:271-290 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002