Edward T. Ordman

According to our database, Edward T. Ordman authored at least 10 papers between 1985 and 2006.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2006

No Three Faces with the Same Number of Edges: 10856.

Andrei Jorza, Edward T. Ordman, Richard Stong

Am. Math. Mon., 2006

1999

Generalized Mutual Exclusion with Semaphores Only.

Edward T. Ordman, Eugene Eberbach, A. Anwar

Fundam. Informaticae, 1999

1995

Limitations of Using Tokens for Mutual Exclusion.

Edward T. Ordman

Proceedings of the 1995 ACM 23rd Annual Conference on Computer Science, CSC '95, Nashville, TN, USA, February 28, 1995

1993

Clique Partitions of Chordal Graphs.

Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein

Comb. Probab. Comput., 1993

1989

Minimal Threshold Separators and Memory Requirements for Synchronization.

Edward T. Ordman

SIAM J. Comput., 1989

The size of chordal, interval and threshold subgraphs.

Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein

Comb., 1989

1988

Clique partitions and clique coverings.

Paul Erdös, Ralph J. Faudree, Edward T. Ordman

Discret. Math., 1988

1987

Byzantine Firing Squad Using a Faulty External Source.

Edward T. Ordman

Proceedings of the Distributed Algorithms, 1987

1985

Mimimal threshold separators and memory requirements for synchronization (abstract only).

Edward T. Ordman

Proceedings of the 13th ACM Annual Conference on Computer Science, 1985

Bounds on threshold dimension and disjoint threshold coverings (abstract only).

Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein

Proceedings of the 13th ACM Annual Conference on Computer Science, 1985