Thomas J. Sager

According to our database, Thomas J. Sager authored at least 8 papers between 1982 and 1994.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

1994

An Improved Characterization of 1-Step Recoverable Embeddings: Rings in Hypercubes.

Jun-Lin Liu, Thomas J. Sager, Bruce M. McMillin

Proceedings of the Proceedings 1994 International Conference on Parallel and Distributed Systems, 1994

1991

A Pruning Procedure for Exact Graph Coloring.

Thomas J. Sager, Shi-Jen Lin

INFORMS J. Comput., 1991

1989

A Color-Exchange Algorithm for Exact Graph Coloring.

Thomas J. Sager, Shi-Jen Lin

Proceedings of the Computing in the 90's, 1989

1988

A CAD system for the capture of combat casualty care information.

Thomas J. Sager, William M. Pugh

Proceedings of the Sixteenth ACM Annual Conference on Computer Science, 1988

1986

A Short Proof of a Conjecture of DeRemer and Pennello.

Thomas J. Sager

ACM Trans. Program. Lang. Syst., 1986

1985

A technique for creating small fast compiler frontends.

Thomas J. Sager

ACM SIGPLAN Notices, 1985

A Polynomial Time Generator for Minimal Perfect Hash Functions.

Thomas J. Sager

Commun. ACM, 1985

1982

On the use of extended grammars.

Thomas J. Sager

Proceedings of the 20th Annual Southeast Regional Conference, 1982