The SCEAS System
| |||||||

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

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |