| 1994 |
|---|
| 7 | EE | Yaron Wolfstahl,
Michael Yoeli:
An Equivalence Theorem for Labeled Marked Graphs.
IEEE Trans. Parallel Distrib. Syst. 5(8): 886-891 (1994) |
| 1990 |
|---|
| 6 | EE | Alon Itai,
Shay Kutten,
Yaron Wolfstahl,
Shmuel Zaks:
Optimal Distributed t-Resilient Election in Complete Networks.
IEEE Trans. Software Eng. 16(4): 415-420 (1990) |
| 5 | | Shlomo Moran,
Yaron Wolfstahl:
One-Page Book Embedding Under Vertex-Neighborhood Constraints.
SIAM J. Discrete Math. 3(3): 376-390 (1990) |
| 1989 |
|---|
| 4 | | Yaron Wolfstahl:
Mapping parallel programs to multiprocessors: a dynamic approach.
Parallel Computing 10(1): 45-50 (1989) |
| 1987 |
|---|
| 3 | | Reuven Bar-Yehuda,
Shay Kutten,
Yaron Wolfstahl,
Shmuel Zaks:
Making Distributed Spanning Tree Algorithms Fault-Resilient.
STACS 1987: 432-444 |
| 2 | | Shlomo Moran,
Yaron Wolfstahl:
Extended Impossibility Results for Asynchronous Complete Networks.
Inf. Process. Lett. 26(3): 145-151 (1987) |
| 1 | | Shlomit S. Pinter,
Yaron Wolfstahl:
Embedding Ternary Trees in VLSI Arrays.
Inf. Process. Lett. 26(4): 187-191 (1987) |
