Bounds on threshold dimension and disjoint threshold coverings (abstract only). - Paul Erdös; Edward T. Ordman; Yechezkel Zalcstein (ACM Conference on Computer Science, 1985)

Mimimal threshold separators and memory requirements for synchronization (abstract only). - Edward T. Ordman (ACM Conference on Computer Science, 1985)

Byzantine Firing Squad Using a Faulty External Source. - Edward T. Ordman (WDAG, 1987)

Clique partitions and clique coverings. - Paul Erdös; Ralph J. Faudree; Edward T. Ordman (Discret. Math., 1988)

The size of chordal, interval and threshold subgraphs. - Paul Erdös; András Gyárfás; Edward T. Ordman; Yechezkel Zalcstein (Comb., 1989)

Minimal Threshold Separators and Memory Requirements for Synchronization. - Edward T. Ordman (SIAM J. Comput., 1989)

Clique Partitions of Chordal Graphs. - Paul Erdös; Edward T. Ordman; Yechezkel Zalcstein (Comb. Probab. Comput., 1993)

Limitations of Using Tokens for Mutual Exclusion. - Edward T. Ordman (ACM Conference on Computer Science, 1995)

Generalized Mutual Exclusion with Semaphores Only. - Edward T. Ordman; Eugene Eberbach; A. Anwar (Fundam. Informaticae, 1999)

No Three Faces with the Same Number of Edges: 10856. - Andrei Jorza; Edward T. Ordman; Richard Stong (Am. Math. Mon., 2006)