Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

* | 1989 | |
---|---|---|

17 | Sheldon B. Akers, Balakrishnan Krishnamurthy: A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Trans. Computers 38(4): 555-566 (1989) | |

16 | Balakrishnan Krishnamurthy, Ioannis G. Tollis: Improved Techniques for Estimating Signal Probabilities. IEEE Trans. Computers 38(7): 1041-1045 (1989) | |

1988 | ||

15 | EE | Dov Harel, Balakrishnan Krishnamurthy: A Graph Compaction Approach to Fault Simulation. DAC 1988: 601-604 |

1987 | ||

14 | EE | Balakrishnan Krishnamurthy: A Dynamic Programming Approach to the Test Point Insertion Problem. DAC 1987: 695-705 |

13 | Sheldon B. Akers, Balakrishnan Krishnamurthy, Dov Harel: The Star Graph: An Attractive Alternative to the n-Cube. ICPP 1987: 393-400 | |

12 | Sheldon B. Akers, Balakrishnan Krishnamurthy: On Group Graphs and Their Fault Tolerance. IEEE Trans. Computers 36(7): 885-888 (1987) | |

11 | Balakrishnan Krishnamurthy: Constructing Test Cases for Partitioning Heuristics. IEEE Trans. Computers 36(9): 1112-1114 (1987) | |

1986 | ||

10 | Sheldon B. Akers, Balakrishnan Krishnamurthy: : A Group Theoretic Model for Symmetric Interconnection Networks. ICPP 1986: 216-223 | |

9 | Balakrishnan Krishnamurthy, Ioannis G. Tollis: Improved Techniques for Estimating Signal Probabilities. ITC 1986: 244-251 | |

1985 | ||

8 | Balakrishnan Krishnamurthy, Richard Li-Cheng Sheng: A New Approach to the Use of Testability Analysis in Test Generation. ITC 1985: 769-778 | |

7 | Balakrishnan Krishnamurthy: Short Proofs for Tricky Formulas. Acta Inf. 22(3): 253-275 (1985) | |

1984 | ||

6 | EE | Deepak Kapur, Balakrishnan Krishnamurthy: A Natural Proof System Based on rewriting Techniques. CADE 1984: 53-64 |

5 | Dilip K. Bhavsar, Balakrishnan Krishnamurthy: Can We Eliminate Fault Escape in Self-Testing by Polynomial Division (Signature Analysis) ? ITC 1984: 134-139 | |

4 | Balakrishnan Krishnamurthy: An Improved Min-Cut Algorithm for Partitioning VLSI Networks. IEEE Trans. Computers 33(5): 438-446 (1984) | |

3 | Balakrishnan Krishnamurthy, Sheldon B. Akers: On the Complexity of Estimating the Size of a Test Set. IEEE Trans. Computers 33(8): 750-753 (1984) | |

1981 | ||

2 | Balakrishnan Krishnamurthy, Robert N. Moll: Examples of Hard Tautologies in the Propositional Calculus STOC 1981: 28-37 | |

1979 | ||

1 | Balakrishnan Krishnamurthy, Robert N. Moll: On the Number of Affine Families of Boolean Functions Information and Control 43(3): 327-337 (1979) |

1 | Sheldon B. Akers | [3] [10] [12] [13] [17] |

2 | Dilip K. Bhavsar | [5] |

3 | Dov Harel | [13] [15] |

4 | Deepak Kapur | [6] |

5 | Robert Moll (Robert N. Moll) | [1] [2] |

6 | Richard Li-Cheng Sheng | [8] |

7 | Ioannis G. Tollis | [9] [16] |