The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Balakrishnan Krishnamurthy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Deepak Kapur, Balakrishnan Krishnamurthy
    A Natural Proof System Based on rewriting Techniques. [Citation Graph (0, 0)][DBLP]
    CADE, 1984, pp:53-64 [Conf]
  3. Dov Harel, Balakrishnan Krishnamurthy
    A Graph Compaction Approach to Fault Simulation. [Citation Graph (0, 0)][DBLP]
    DAC, 1988, pp:601-604 [Conf]
  4. Balakrishnan Krishnamurthy
    A Dynamic Programming Approach to the Test Point Insertion Problem. [Citation Graph (0, 0)][DBLP]
    DAC, 1987, pp:695-705 [Conf]
  5. Sheldon B. Akers, Balakrishnan Krishnamurthy
    : A Group Theoretic Model for Symmetric Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:216-223 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. Balakrishnan Krishnamurthy, Ioannis G. Tollis
    Improved Techniques for Estimating Signal Probabilities. [Citation Graph (0, 0)][DBLP]
    ITC, 1986, pp:244-251 [Conf]
  10. Balakrishnan Krishnamurthy, Robert N. Moll
    Examples of Hard Tautologies in the Propositional Calculus [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:28-37 [Conf]
  11. Balakrishnan Krishnamurthy
    Short Proofs for Tricky Formulas. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:3, pp:253-275 [Journal]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. 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
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002