| 1990 | ITC | Why is less information from logic simulation more useful in fault simulation? | Sheldon B. Akers Jr., Sungju Park, Balakrishnan Krishnamurthy, Ashok Swaminathan |
| 1988 | DAC | A Graph Compaction Approach to Fault Simulation. | Dov Harel, Balakrishnan Krishnamurthy |
| 1987 | DAC | A Dynamic Programming Approach to the Test Point Insertion Problem. | Balakrishnan Krishnamurthy |
| 1987 | ICPP | The Star Graph: An Attractive Alternative to the n-Cube. | Sheldon B. Akers Jr., Balakrishnan Krishnamurthy, Dov Harel |
| 1986 | ICPP | : A Group Theoretic Model for Symmetric Interconnection Networks. | Sheldon B. Akers Jr., Balakrishnan Krishnamurthy |
| 1986 | ITC | Improved Techniques for Estimating Signal Probabilities. | Balakrishnan Krishnamurthy, Ioannis G. Tollis |
| 1985 | ITC | A New Approach to the Use of Testability Analysis in Test Generation. | Balakrishnan Krishnamurthy, Richard Li-Cheng Sheng |
| 1984 | CADE | A Natural Proof System Based on rewriting Techniques. | Deepak Kapur, Balakrishnan Krishnamurthy |
| 1984 | ITC | Can We Eliminate Fault Escape in Self-Testing by Polynomial Division (Signature Analysis) ? | Dilip K. Bhavsar, Balakrishnan Krishnamurthy |
| 1981 | STOC | Examples of Hard Tautologies in the Propositional Calculus | Balakrishnan Krishnamurthy, Robert N. Moll |