# Balakrishnan Krishnamurthy

According to our database

Collaborative distances:

^{1}, Balakrishnan Krishnamurthy authored at least 17 papers between 1979 and 1990.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1990

Why is less information from logic simulation more useful in fault simulation?

Proceedings of the Proceedings IEEE International Test Conference 1990, 1990

1989

A Group-Theoretic Model for Symmetric Interconnection Networks.

IEEE Trans. Computers, 1989

1988

A Graph Compaction Approach to Fault Simulation.

Proceedings of the 25th ACM/IEEE Conference on Design Automation, 1988

1987

Constructing Test Cases for Partitioning Heuristics.

IEEE Trans. Computers, 1987

On Group Graphs and Their Fault Tolerance.

IEEE Trans. Computers, 1987

The Star Graph: An Attractive Alternative to the n-Cube.

Proceedings of the International Conference on Parallel Processing, 1987

A Dynamic Programming Approach to the Test Point Insertion Problem.

Proceedings of the 24th ACM/IEEE Design Automation Conference. Miami Beach, FL, USA, June 28, 1987

1986

Improved Techniques for Estimating Signal Probabilities.

Proceedings of the Proceedings International Test Conference 1986, 1986

: A Group Theoretic Model for Symmetric Interconnection Networks.

Proceedings of the International Conference on Parallel Processing, 1986

1985

Short Proofs for Tricky Formulas.

Acta Inf., 1985

A New Approach to the Use of Testability Analysis in Test Generation.

Proceedings of the Proceedings International Test Conference 1985, 1985

1984

On the Complexity of Estimating the Size of a Test Set.

IEEE Trans. Computers, 1984

An Improved Min-Cut Algorithm for Partitioning VLSI Networks.

IEEE Trans. Computers, 1984

Can We Eliminate Fault Escape in Self-Testing by Polynomial Division (Signature Analysis) ?

Proceedings of the Proceedings International Test Conference 1984, 1984

A Natural Proof System Based on rewriting Techniques.

Proceedings of the 7th International Conference on Automated Deduction, 1984

1981

Examples of Hard Tautologies in the Propositional Calculus

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1979

On the Number of Affine Families of Boolean Functions

Information and Control, December, 1979