|
Search the dblp DataBase
Balakrishnan Krishnamurthy:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Balakrishnan Krishnamurthy
An Improved Min-Cut Algorithm for Partitioning VLSI Networks. [Citation Graph (1, 0)][DBLP] IEEE Trans. Computers, 1984, v:33, n:5, pp:438-446 [Journal]
- Deepak Kapur, Balakrishnan Krishnamurthy
A Natural Proof System Based on rewriting Techniques. [Citation Graph (0, 0)][DBLP] CADE, 1984, pp:53-64 [Conf]
- Dov Harel, Balakrishnan Krishnamurthy
A Graph Compaction Approach to Fault Simulation. [Citation Graph (0, 0)][DBLP] DAC, 1988, pp:601-604 [Conf]
- Balakrishnan Krishnamurthy
A Dynamic Programming Approach to the Test Point Insertion Problem. [Citation Graph (0, 0)][DBLP] DAC, 1987, pp:695-705 [Conf]
- Sheldon B. Akers, Balakrishnan Krishnamurthy
: A Group Theoretic Model for Symmetric Interconnection Networks. [Citation Graph (0, 0)][DBLP] ICPP, 1986, pp:216-223 [Conf]
- Sheldon B. Akers, Balakrishnan Krishnamurthy, Dov Harel
The Star Graph: An Attractive Alternative to the n-Cube. [Citation Graph (0, 0)][DBLP] ICPP, 1987, pp:393-400 [Conf]
- Dilip K. Bhavsar, Balakrishnan Krishnamurthy
Can We Eliminate Fault Escape in Self-Testing by Polynomial Division (Signature Analysis) ? [Citation Graph (0, 0)][DBLP] ITC, 1984, pp:134-139 [Conf]
- Balakrishnan Krishnamurthy, Richard Li-Cheng Sheng
A New Approach to the Use of Testability Analysis in Test Generation. [Citation Graph (0, 0)][DBLP] ITC, 1985, pp:769-778 [Conf]
- Balakrishnan Krishnamurthy, Ioannis G. Tollis
Improved Techniques for Estimating Signal Probabilities. [Citation Graph (0, 0)][DBLP] ITC, 1986, pp:244-251 [Conf]
- Balakrishnan Krishnamurthy, Robert N. Moll
Examples of Hard Tautologies in the Propositional Calculus [Citation Graph (0, 0)][DBLP] STOC, 1981, pp:28-37 [Conf]
- Balakrishnan Krishnamurthy
Short Proofs for Tricky Formulas. [Citation Graph (0, 0)][DBLP] Acta Inf., 1985, v:22, n:3, pp:253-275 [Journal]
- Balakrishnan Krishnamurthy, Robert N. Moll
On the Number of Affine Families of Boolean Functions [Citation Graph (0, 0)][DBLP] Information and Control, 1979, v:43, n:3, pp:327-337 [Journal]
- Sheldon B. Akers, Balakrishnan Krishnamurthy
On Group Graphs and Their Fault Tolerance. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1987, v:36, n:7, pp:885-888 [Journal]
- Sheldon B. Akers, Balakrishnan Krishnamurthy
A Group-Theoretic Model for Symmetric Interconnection Networks. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1989, v:38, n:4, pp:555-566 [Journal]
- Balakrishnan Krishnamurthy
Constructing Test Cases for Partitioning Heuristics. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1987, v:36, n:9, pp:1112-1114 [Journal]
- Balakrishnan Krishnamurthy, Sheldon B. Akers
On the Complexity of Estimating the Size of a Test Set. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1984, v:33, n:8, pp:750-753 [Journal]
- Balakrishnan Krishnamurthy, Ioannis G. Tollis
Improved Techniques for Estimating Signal Probabilities. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1989, v:38, n:7, pp:1041-1045 [Journal]
Search in 0.002secs, Finished in 0.002secs
|