 | 1999 |
|---|
| 9 |       | Edward T. Ordman,
Eugene Eberbach,
A. Anwar:
Generalized Mutual Exclusion with Semaphores Only.
Fundam. Inform. 40(4): 407-422 (1999) |
| 1995 |
|---|
| 8 |  | Edward T. Ordman:
Limitations of Using Tokens for Mutual Exclusion.
ACM Conference on Computer Science 1995: 26-29 |
| 1993 |
|---|
| 7 | | Paul Erdös,
Edward T. Ordman,
Yechezkel Zalcstein:
Clique Partitions of Chordal Graphs.
Combinatorics, Probability & Computing 2: 409-415 (1993) |
| 1989 |
|---|
| 6 | | Paul Erdös,
András Gyárfás,
Edward T. Ordman,
Yechezkel Zalcstein:
The size of chordal, interval and threshold subgraphs.
Combinatorica 9(3): 245-253 (1989) |
| 5 | | Edward T. Ordman:
Minimal Threshold Separators and Memory Requirements for Synchronization.
SIAM J. Comput. 18(1): 152-165 (1989) |
| 1988 |
|---|
| 4 | | Paul Erdös,
Ralph J. Faudree,
Edward T. Ordman:
Clique partitions and clique coverings.
Discrete Mathematics 72(1-3): 93-101 (1988) |
| 1987 |
|---|
| 3 | | Edward T. Ordman:
Byzantine Firing Squad Using a Faulty External Source.
WDAG 1987: 76-83 |
| 1985 |
|---|
| 2 | | Paul Erdös,
Edward T. Ordman,
Yechezkel Zalcstein:
Bounds on threshold dimension and disjoint threshold coverings (abstract only).
ACM Conference on Computer Science 1985: 422 |
| 1 | | Edward T. Ordman:
Mimimal threshold separators and memory requirements for synchronization (abstract only).
ACM Conference on Computer Science 1985: 430 |
