Balakrishnan Krishnamurthy

According to our database, Balakrishnan Krishnamurthy authored at least 17 papers between 1979 and 1990.

Collaborative distances:

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

1990

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

Sheldon B. Akers Jr., Sungju Park, Balakrishnan Krishnamurthy, Ashok Swaminathan

Proceedings of the Proceedings IEEE International Test Conference 1990, 1990

1989

Improved Techniques for Estimating Signal Probabilities.

Balakrishnan Krishnamurthy, Ioannis G. Tollis

IEEE Trans. Computers, 1989

A Group-Theoretic Model for Symmetric Interconnection Networks.

Sheldon B. Akers Jr., Balakrishnan Krishnamurthy

IEEE Trans. Computers, 1989

Test counting: a tool for VLSI testing.

Sheldon B. Akers Jr., Balakrishnan Krishnamurthy

IEEE Des. Test, 1989

1988

A Graph Compaction Approach to Fault Simulation.

Dov Harel, Balakrishnan Krishnamurthy

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

1987

Constructing Test Cases for Partitioning Heuristics.

Balakrishnan Krishnamurthy

IEEE Trans. Computers, 1987

On Group Graphs and Their Fault Tolerance.

Sheldon B. Akers Jr., Balakrishnan Krishnamurthy

IEEE Trans. Computers, 1987

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

Sheldon B. Akers Jr., Balakrishnan Krishnamurthy, Dov Harel

Proceedings of the International Conference on Parallel Processing, 1987

A Dynamic Programming Approach to the Test Point Insertion Problem.

Balakrishnan Krishnamurthy

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

1985

Short Proofs for Tricky Formulas.

Balakrishnan Krishnamurthy

Acta Informatica, 1985

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

Balakrishnan Krishnamurthy, Richard Li-Cheng Sheng

Proceedings of the Proceedings International Test Conference 1985, 1985

1984

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

Balakrishnan Krishnamurthy, Sheldon B. Akers Jr.

IEEE Trans. Computers, 1984

An Improved Min-Cut Algorithm for Partitioning VLSI Networks.

Balakrishnan Krishnamurthy

IEEE Trans. Computers, 1984

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

Dilip K. Bhavsar, Balakrishnan Krishnamurthy

Proceedings of the Proceedings International Test Conference 1984, 1984

A Natural Proof System Based on rewriting Techniques.

Deepak Kapur, Balakrishnan Krishnamurthy

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

1981

Examples of Hard Tautologies in the Propositional Calculus

Balakrishnan Krishnamurthy, Robert N. Moll

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

1979

On the Number of Affine Families of Boolean Functions

Balakrishnan Krishnamurthy, Robert N. Moll

Inf. Control., December, 1979