Singhi, N. M. ; Shriniwas, Iyengar ; Antony, T. A. (1996) Combinatorial techniques and objects in computer science: fault-tolerance and other interesting applications European Journal of Combinatorics, 17 (2-3). pp. 97-111. ISSN 0195-6698
Full text not available from this repository.
Official URL: http://www.sciencedirect.com/science/article/pii/S...
Related URL: http://dx.doi.org/10.1006/eujc.1996.0009
Abstract
The main objective of this contribution is to outline briefly, a set of interesting problems in computer science that involve the use of combinatorial objects and techniques. We also present our results for the case of fault-tolerance in hypercube-based parallel computer architectures, where we show the involvement of t-designs and t-covers in the structure of extremal fault-sets, which is useful in the construction of fault-tolerant m-partitions of the n-cube.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Elsevier Science. |
| ID Code: | 50431 |
| Deposited On: | 23 Jul 2011 12:06 |
| Last Modified: | 23 Jul 2011 12:06 |
Repository Staff Only: item control page
