M. A. Sridhar

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