M. A. Sridhar

According to our database, M. A. Sridhar authored at least 21 papers between 1987 and 1998.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1998

Improved algorithms for computing with faulty SIMD hypercubes.

Cauligi S. Raghavendra, M. A. Sridhar

Telecommun. Syst., 1998

1996

Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes.

Cauligi S. Raghavendra, M. A. Sridhar

IEEE Trans. Computers, 1996

Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes.

Cauligi S. Raghavendra, M. A. Sridhar

J. Parallel Distributed Comput., 1996

Exact Solutions to Diameter and Routing Problems in PEC Networks.

Cauligi S. Raghavendra, M. A. Sridhar

J. Parallel Distributed Comput., 1996

1995

Computing Large Subcubes in Residual Hypercubes.

M. A. Sridhar, Cauligi S. Raghavendra

J. Parallel Distributed Comput., 1995

1994

Routing Permutations on Hypercube Machines with Half-Duplex Links.

Cauligi S. Raghavendra, M. A. Sridhar

J. Parallel Distributed Comput., 1994

1993

Gossiping on Interval Graphs.

Suresh Singh, M. A. Sridhar

Proceedings of the Seventh International Parallel Processing Symposium, 1993

Global Semigroup Operations in Faulty SIMD Hypercubes.

Cauligi S. Raghavendra, M. A. Sridhar

Proceedings of the Seventh International Parallel Processing Symposium, 1993

Prefix Computation On a Faulty Hypercube.

Cauligi S. Raghavendra, M. A. Sridhar, S. Harikumar

Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992

Broadcasting Algorithms in Faulty SIMD Hypercubes.

Cauligi S. Raghavendra, M. A. Sridhar

Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1991

Fault-Tolerant Networks Based on the de Bruijn Graph.

M. A. Sridhar, Cauligi S. Raghavendra

IEEE Trans. Computers, 1991

Routing Algorithms in Interval and Circular-Arc Networks.

M. A. Sridhar, Shri K. Goyal

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

Efficient Parallel Computation of Hamilton Paths and Circuits in Interval Graphs.

M. A. Sridhar, Shri K. Goyal

Proceedings of the International Conference on Parallel Processing, 1991

1990

Minimal Full-Access Networks: Enumeration and Characterization.

M. A. Sridhar, Cauligi S. Raghavendra

J. Parallel Distributed Comput., 1990

On finding maximal subcubes in residual hypercubes.

M. A. Sridhar, Cauligi S. Raghavendra

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Optimal Routing of Bit-Permutes on Hypercube Machines.

Cauligi S. Raghavendra, M. A. Sridhar

Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989

A Fast Algorithm for Testing Isomorphism of Permutation Networks.

M. A. Sridhar

IEEE Trans. Computers, 1989

On Dynamic Full Access in Multistage Interconnection Networks.

Cauligi S. Raghavendra, M. A. Sridhar

Proceedings of the Reliability Of Computer And Communication Networks, 1989

1988

Uniform Minimal Full-Access Networks.

M. A. Sridhar, Cauligi S. Raghavendra

J. Parallel Distributed Comput., 1988

On the Connectivity of the De Bruijn Graph.

M. A. Sridhar

Inf. Process. Lett., 1988

1987

Testing Permutation Network Equivalence.

M. A. Sridhar

Proceedings of the International Conference on Parallel Processing, 1987