default search action
Balakrishnan Krishnamurthy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1990
- [c10]Sheldon B. Akers Jr., Sungju Park, Balakrishnan Krishnamurthy, Ashok Swaminathan:
Why is less information from logic simulation more useful in fault simulation? ITC 1990: 786-800
1980 – 1989
- 1989
- [j9]Sheldon B. Akers Jr., Balakrishnan Krishnamurthy:
Test counting: a tool for VLSI testing. IEEE Des. Test 6(5): 58-77 (1989) - [j8]Sheldon B. Akers Jr., Balakrishnan Krishnamurthy:
A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Trans. Computers 38(4): 555-566 (1989) - [j7]Balakrishnan Krishnamurthy, Ioannis G. Tollis:
Improved Techniques for Estimating Signal Probabilities. IEEE Trans. Computers 38(7): 1041-1045 (1989) - 1988
- [c9]Dov Harel, Balakrishnan Krishnamurthy:
A Graph Compaction Approach to Fault Simulation. DAC 1988: 601-604 - 1987
- [j6]Sheldon B. Akers Jr., Balakrishnan Krishnamurthy:
On Group Graphs and Their Fault Tolerance. IEEE Trans. Computers 36(7): 885-888 (1987) - [j5]Balakrishnan Krishnamurthy:
Constructing Test Cases for Partitioning Heuristics. IEEE Trans. Computers 36(9): 1112-1114 (1987) - [c8]Balakrishnan Krishnamurthy:
A Dynamic Programming Approach to the Test Point Insertion Problem. DAC 1987: 695-705 - [c7]Sheldon B. Akers Jr., Balakrishnan Krishnamurthy, Dov Harel:
The Star Graph: An Attractive Alternative to the n-Cube. ICPP 1987: 393-400 - 1986
- [c6]Sheldon B. Akers Jr., Balakrishnan Krishnamurthy:
: A Group Theoretic Model for Symmetric Interconnection Networks. ICPP 1986: 216-223 - [c5]Balakrishnan Krishnamurthy, Ioannis G. Tollis:
Improved Techniques for Estimating Signal Probabilities. ITC 1986: 244-251 - 1985
- [j4]Balakrishnan Krishnamurthy:
Short Proofs for Tricky Formulas. Acta Informatica 22(3): 253-275 (1985) - [c4]Balakrishnan Krishnamurthy, Richard Li-Cheng Sheng:
A New Approach to the Use of Testability Analysis in Test Generation. ITC 1985: 769-778 - 1984
- [j3]Balakrishnan Krishnamurthy:
An Improved Min-Cut Algorithm for Partitioning VLSI Networks. IEEE Trans. Computers 33(5): 438-446 (1984) - [j2]Balakrishnan Krishnamurthy, Sheldon B. Akers Jr.:
On the Complexity of Estimating the Size of a Test Set. IEEE Trans. Computers 33(8): 750-753 (1984) - [c3]Deepak Kapur, Balakrishnan Krishnamurthy:
A Natural Proof System Based on rewriting Techniques. CADE 1984: 53-64 - [c2]Dilip K. Bhavsar, Balakrishnan Krishnamurthy:
Can We Eliminate Fault Escape in Self-Testing by Polynomial Division (Signature Analysis) ? ITC 1984: 134-139 - 1981
- [c1]Balakrishnan Krishnamurthy, Robert N. Moll:
Examples of Hard Tautologies in the Propositional Calculus. STOC 1981: 28-37
1970 – 1979
- 1979
- [j1]Balakrishnan Krishnamurthy, Robert N. Moll:
On the Number of Affine Families of Boolean Functions. Inf. Control. 43(3): 327-337 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: