![]() | ![]() |
1994 | ||
---|---|---|
5 | Kwok-bun Yue, R. T. Jacob: An Optimal Algorithm for Reducing Edge-Solvable Mutual Exclusion Graphs. Comput. J. 37(2): 129-138 (1994) | |
1991 | ||
4 | Kwok-bun Yue, R. T. Jacob: An Efficient Starvation-Free Semaphore Solution for the Graphical Mutual Exclusion Problem. Comput. J. 34(4): 345-349 (1991) | |
1990 | ||
3 | EE | S. E. Chern, R. T. Jacob, Ivor P. Page: Variations on the drinking philosophers algorithm. SPDP 1990: 685-688 |
1989 | ||
2 | Ivor P. Page, R. T. Jacob: The Solution of Mutual Exclusion Problems which can be Described Graphically. Comput. J. 32(1): 45-54 (1989) | |
1 | EE | R. T. Jacob, Ivor P. Page: Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores. IEEE Trans. Software Eng. 15(5): 560-568 (1989) |
1 | S. E. Chern | [3] |
2 | Ivor P. Page | [1] [2] [3] |
3 | Kwok-bun Yue | [4] [5] |