| 1998 |
|---|
| 22 | | C. S. Raghavendra,
M. A. Sridhar:
Improved algorithms for computing with faulty SIMD hypercubes.
Telecommunication Systems 10(1): 149-156 (1998) |
| 1996 |
|---|
| 21 | | C. S. Raghavendra,
M. A. Sridhar:
Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes.
IEEE Trans. Computers 45(4): 495-498 (1996) |
| 20 | | C. S. Raghavendra,
M. A. Sridhar:
Exact Solutions to Diameter and Routing Problems in PEC Networks.
J. Parallel Distrib. Comput. 34(2): 202-210 (1996) |
| 19 | | C. S. Raghavendra,
M. A. Sridhar:
Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes.
J. Parallel Distrib. Comput. 35(1): 57-66 (1996) |
| 1995 |
|---|
| 18 | | M. A. Sridhar,
C. S. Raghavendra:
Computing Large Subcubes in Residual Hypercubes.
J. Parallel Distrib. Comput. 24(2): 213-217 (1995) |
| 1994 |
|---|
| 17 | | C. S. Raghavendra,
M. A. Sridhar:
Routing Permutations on Hypercube Machines with Half-Duplex Links.
J. Parallel Distrib. Comput. 20(1): 14-19 (1994) |
| 1993 |
|---|
| 16 | | C. S. Raghavendra,
M. A. Sridhar,
S. Harikumar:
Prefix Computation On a Faulty Hypercube.
ICPP 1993: 280-283 |
| 15 | | Suresh Singh,
M. A. Sridhar:
Gossiping on Interval Graphs.
IPPS 1993: 338-343 |
| 14 | | C. S. Raghavendra,
M. A. Sridhar:
Global Semigroup Operations in Faulty SIMD Hypercubes.
IPPS 1993: 706-711 |
| 13 | | C. S. Raghavendra,
M. A. Sridhar:
Exact Solutions to Diameter and Routing Problems in PEC Networks.
SPDP 1993: 574-581 |
| 1992 |
|---|
| 12 | | C. S. Raghavendra,
M. A. Sridhar:
Broadcasting Algorithms in Faulty SIMD Hypercubes.
SPDP 1992: 4-11 |
| 1991 |
|---|
| 11 | | M. A. Sridhar,
Shri K. Goyal:
Efficient Parallel Computation of Hamilton Paths and Circuits in Interval Graphs.
ICPP (3) 1991: 83-90 |
| 10 | | M. A. Sridhar,
Shri K. Goyal:
Routing Algorithms in Interval and Circular-Arc Networks.
IPPS 1991: 51-55 |
| 9 | | M. A. Sridhar,
C. S. Raghavendra:
Fault-Tolerant Networks Based on the de Bruijn Graph.
IEEE Trans. Computers 40(10): 1167-1174 (1991) |
| 1990 |
|---|
| 8 | | C. S. Raghavendra,
M. A. Sridhar:
Optimal Routing of Bit-Permutes on Hypercube Machines.
ICPP (1) 1990: 286-290 |
| 7 | EE | M. A. Sridhar,
C. S. Raghavendra:
On finding maximal subcubes in residual hypercubes.
SPDP 1990: 870-873 |
| 6 | | M. A. Sridhar,
C. S. Raghavendra:
Minimal Full-Access Networks: Enumeration and Characterization.
J. Parallel Distrib. Comput. 9(4): 347-356 (1990) |
| 1989 |
|---|
| 5 | | M. A. Sridhar:
A Fast Algorithm for Testing Isomorphism of Permutation Networks.
IEEE Trans. Computers 38(6): 903-909 (1989) |
| 1988 |
|---|
| 4 | | M. A. Sridhar:
On the Connectivity of the De Bruijn Graph.
Inf. Process. Lett. 27(6): 315-318 (1988) |
| 3 | | M. A. Sridhar,
C. S. Raghavendra:
Uniform Minimal Full-Access Networks.
J. Parallel Distrib. Comput. 5(4): 383-403 (1988) |
| 1987 |
|---|
| 2 | | M. A. Sridhar,
C. S. Raghavendra:
Uniform Minimal Full-Access Networks.
ICPP 1987: 401-406 |
| 1 | | M. A. Sridhar:
Testing Permutation Network Equivalence.
ICPP 1987: 752-754 |
