default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. A. Sridhar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j11]Cauligi S. Raghavendra, M. A. Sridhar:
Improved algorithms for computing with faulty SIMD hypercubes. Telecommun. Syst. 10(1): 149-156 (1998)- 1996
- [j10]Cauligi S. Raghavendra, M. A. Sridhar:
Exact Solutions to Diameter and Routing Problems in PEC Networks. J. Parallel Distributed Comput. 34(2): 202-210 (1996) - [j9]Cauligi S. Raghavendra, M. A. Sridhar:
Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes. J. Parallel Distributed Comput. 35(1): 57-66 (1996) - [j8]Cauligi S. Raghavendra, M. A. Sridhar:
Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes. IEEE Trans. Computers 45(4): 495-498 (1996) - 1995
- [j7]M. A. Sridhar, Cauligi S. Raghavendra:
Computing Large Subcubes in Residual Hypercubes. J. Parallel Distributed Comput. 24(2): 213-217 (1995) - 1994
- [j6]Cauligi S. Raghavendra, M. A. Sridhar:
Routing Permutations on Hypercube Machines with Half-Duplex Links. J. Parallel Distributed Comput. 20(1): 14-19 (1994) - 1993
- [c12]Cauligi S. Raghavendra, M. A. Sridhar, S. Harikumar:
Prefix Computation On a Faulty Hypercube. ICPP (3) 1993: 280-283 - [c11]Suresh Singh, M. A. Sridhar:
Gossiping on Interval Graphs. IPPS 1993: 338-343 - [c10]Cauligi S. Raghavendra, M. A. Sridhar:
Global Semigroup Operations in Faulty SIMD Hypercubes. IPPS 1993: 706-711 - [c9]Cauligi S. Raghavendra, M. A. Sridhar:
Exact Solutions to Diameter and Routing Problems in PEC Networks. SPDP 1993: 574-581 - 1992
- [c8]Cauligi S. Raghavendra, M. A. Sridhar:
Broadcasting Algorithms in Faulty SIMD Hypercubes. SPDP 1992: 4-11 - 1991
- [j5]M. A. Sridhar, Cauligi S. Raghavendra:
Fault-Tolerant Networks Based on the de Bruijn Graph. IEEE Trans. Computers 40(10): 1167-1174 (1991) - [c7]M. A. Sridhar, Shri K. Goyal:
Efficient Parallel Computation of Hamilton Paths and Circuits in Interval Graphs. ICPP (3) 1991: 83-90 - [c6]M. A. Sridhar, Shri K. Goyal:
Routing Algorithms in Interval and Circular-Arc Networks. IPPS 1991: 51-55 - 1990
- [j4]M. A. Sridhar, Cauligi S. Raghavendra:
Minimal Full-Access Networks: Enumeration and Characterization. J. Parallel Distributed Comput. 9(4): 347-356 (1990) - [c5]Cauligi S. Raghavendra, M. A. Sridhar:
Optimal Routing of Bit-Permutes on Hypercube Machines. ICPP (1) 1990: 286-290 - [c4]M. A. Sridhar, Cauligi S. Raghavendra:
On finding maximal subcubes in residual hypercubes. SPDP 1990: 870-873
1980 – 1989
- 1989
- [j3]M. A. Sridhar:
A Fast Algorithm for Testing Isomorphism of Permutation Networks. IEEE Trans. Computers 38(6): 903-909 (1989) - [c3]Cauligi S. Raghavendra, M. A. Sridhar:
On Dynamic Full Access in Multistage Interconnection Networks. Reliability Of Computer And Communication Networks 1989: 229-244 - 1988
- [j2]M. A. Sridhar:
On the Connectivity of the De Bruijn Graph. Inf. Process. Lett. 27(6): 315-318 (1988) - [j1]M. A. Sridhar, Cauligi S. Raghavendra:
Uniform Minimal Full-Access Networks. J. Parallel Distributed Comput. 5(4): 383-403 (1988) - 1987
- [c2]M. A. Sridhar, Cauligi S. Raghavendra:
Uniform Minimal Full-Access Networks. ICPP 1987: 401-406 - [c1]M. A. Sridhar:
Testing Permutation Network Equivalence. ICPP 1987: 752-754
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
