Mark A. Heap

According to our database, Mark A. Heap authored at least 5 papers between 1989 and 1994.

Collaborative distances:

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

1994

Least Upper Bounds an OBDD Sizes.

Mark A. Heap, M. Ray Mercer

IEEE Trans. Computers, 1994

1993

On the exact ordered binary decision diagram size of totally symmetric functions.

Mark A. Heap

J. Electron. Test., 1993

1992

A Synthesis Algorithm for Two-Level XOR Based Circuits.

Mark A. Heap, William A. Rogers, M. Ray Mercer

Proceedings of the Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1992

1991

STarS: a target switching algorithm for sequential test generation.

Mark A. Heap, William A. Rogers, William B. Burns

Proceedings of the 9th IEEE VLSI Test Symposium (VTS'91), 1991

1989

Generating Single-Stuck-Fault Coverage from a Collapsed-Fault Set.

Mark A. Heap, William A. Rogers

Computer, 1989