Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Balakrishnan Krishnamurthy
Observed name:
B. Krishnamurthy
Institution:
Tektronix (United States)
Observed institutions:
Tektronix (United States),
General Electric (United States)
OpenAlex ID:
A5037485826
A group-theoretic model for symmetric interconnection networks
1989
·
S.B. Akers
, B. Krishnamurthy
·
IEEE Transactions on Computers
·
1,283
The Star Graph: An Attractive Alternative to the n-Cube.
1987
·
Sheldon B. Akers
, Balakrishnan Krishnamurthy
, et al.
·
Proceedings of the International Conference on Parallel Processing
·
618
Fault diameter of interconnection networks
1987
·
M.S. Krishnamoorthy
, B. Krishnamurthy
·
Computers & Mathematics with Applications
·
191
Short proofs for tricky formulas
1985
·
Balakrishnan Krishnamurthy
·
Acta Informatica
·
161
Improved techniques for estimating signal probabilities
1989
·
B. Krishnamurthy
, I.G. Tollis
·
IEEE Transactions on Computers
·
102
A dynamic programming approach to the test point insertion problem
1987
·
B. Krishnamurthy
·
ACM/IEEE Design Automation Conference (DAC)
·
67
PDF
On the Complexity of Estimating the Size of a Test Set
1984
·
Balakrishnan Krishnamurthy
, Sheldon B. Akers
·
IEEE Transactions on Computers
·
60
Examples of hard tautologies in the propositional calculus
1981
·
Balakrishnan Krishnamurthy
, Robert N. Moll
·
ACM Symposium on Theory of Computing (STOC)
·
52
Constructing Test Cases for Partitioning Heuristics
1987
·
Balakrishnan Krishnamurthy
·
IEEE Transactions on Computers
·
30
Test counting: a tool for VLSI testing
1989
·
S.B. Akers
, B. Krishnamurthy
·
IEEE Design & Test of Computers
·
26
A New Approach to the Use of Testability Analysis in Test Generation.
1985
·
Balakrishnan Krishnamurthy
, Richard Sheng
·
IEEE International Test Conference (ITC)
·
11
What is the path to fast fault simulation?
2003
·
M. Abramovici
, B. Krishnamurthy
, et al.
·
IEEE International Test Conference (ITC)
·
10
Examples of hard tautologies and worst-case complexity results for propositional proof systems
1981
·
Balakrishnan Krishnamurthy
·
4
On the number of affine families of boolean functions
1979
·
Balakrishnan Krishnamurthy
, Robert N. Moll
·
Information and Control
·
3
A Natural Proof System Based on Rewriting Techniques
1984
·
Deepak Kapur
, Balakrishnan Krishnamurthy
·
Lecture notes in computer science
·
2
News & Letters
1987
·
Daniel E. Otero
, Balakrishnan Krishnamurthy
, et al.
·
Mathematics Magazine
Show more works
View as search
Works count:
16
Citation count:
2,620
H-index:
11
I10-index:
12
Year
Topic
Type