Balakrishnan Krishnamurthy
From MaRDI portal
Person:800908
Available identifiers
zbMath Open krishnamurthy.balakrishnanMaRDI QIDQ800908
List of research outcomes
 | This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon! |
| Publication | Date of Publication | Type |
|---|---|---|
| A group-theoretic model for symmetric interconnection networks | 1989-01-01 | Paper |
| On Group Graphs and Their Fault Tolerance | 1987-01-01 | Paper |
| Short proofs for tricky formulas | 1985-01-01 | Paper |
| An Improved Min-Cut Algonthm for Partitioning VLSI Networks | 1984-01-01 | Paper |
| On the Complexity of Estimating the Size of a Test Set | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3336734 | 1984-01-01 | Paper |
| On the number of affine families of boolean functions | 1979-01-01 | Paper |
Research outcomes over time
This page was built for person: Balakrishnan Krishnamurthy
