M. A. Sridhar

Publication Activity (10 Years)

Years Active: 1987-1998
Publications (10 Years): 0

Publications

Cauligi S. Raghavendra, M. A. Sridhar
Improved algorithms for computing with faulty SIMD hypercubes. Telecommun. Syst. 10 (1) (1998)
Cauligi S. Raghavendra, M. A. Sridhar
Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes. IEEE Trans. Computers 45 (4) (1996)
Cauligi S. Raghavendra, M. A. Sridhar
Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes. J. Parallel Distributed Comput. 35 (1) (1996)
Cauligi S. Raghavendra, M. A. Sridhar
Exact Solutions to Diameter and Routing Problems in PEC Networks. J. Parallel Distributed Comput. 34 (2) (1996)
M. A. Sridhar, Cauligi S. Raghavendra
Computing Large Subcubes in Residual Hypercubes. J. Parallel Distributed Comput. 24 (2) (1995)
Cauligi S. Raghavendra, M. A. Sridhar
Routing Permutations on Hypercube Machines with Half-Duplex Links. J. Parallel Distributed Comput. 20 (1) (1994)
Suresh Singh, M. A. Sridhar
Gossiping on Interval Graphs. IPPS (1993)
Cauligi S. Raghavendra, M. A. Sridhar, S. Harikumar
Prefix Computation On a Faulty Hypercube. ICPP (3) (1993)
Cauligi S. Raghavendra, M. A. Sridhar
Global Semigroup Operations in Faulty SIMD Hypercubes. IPPS (1993)
Cauligi S. Raghavendra, M. A. Sridhar
Exact Solutions to Diameter and Routing Problems in PEC Networks. SPDP (1993)
Cauligi S. Raghavendra, M. A. Sridhar
Broadcasting Algorithms in Faulty SIMD Hypercubes. SPDP (1992)
M. A. Sridhar, Cauligi S. Raghavendra
Fault-Tolerant Networks Based on the de Bruijn Graph. IEEE Trans. Computers 40 (10) (1991)
M. A. Sridhar, Shri K. Goyal
Efficient Parallel Computation of Hamilton Paths and Circuits in Interval Graphs. ICPP (3) (1991)
M. A. Sridhar, Shri K. Goyal
Routing Algorithms in Interval and Circular-Arc Networks. IPPS (1991)
Cauligi S. Raghavendra, M. A. Sridhar
Optimal Routing of Bit-Permutes on Hypercube Machines. ICPP (1) (1990)
M. A. Sridhar, Cauligi S. Raghavendra
Minimal Full-Access Networks: Enumeration and Characterization. J. Parallel Distributed Comput. 9 (4) (1990)
M. A. Sridhar, Cauligi S. Raghavendra
On finding maximal subcubes in residual hypercubes. SPDP (1990)
Cauligi S. Raghavendra, M. A. Sridhar
On Dynamic Full Access in Multistage Interconnection Networks. Reliability Of Computer And Communication Networks (1989)
M. A. Sridhar
A Fast Algorithm for Testing Isomorphism of Permutation Networks. IEEE Trans. Computers 38 (6) (1989)
M. A. Sridhar
On the Connectivity of the De Bruijn Graph. Inf. Process. Lett. 27 (6) (1988)
M. A. Sridhar, Cauligi S. Raghavendra
Uniform Minimal Full-Access Networks. J. Parallel Distributed Comput. 5 (4) (1988)
M. A. Sridhar
Testing Permutation Network Equivalence. ICPP (1987)
M. A. Sridhar, Cauligi S. Raghavendra
Uniform Minimal Full-Access Networks. ICPP (1987)