S. Lakshmivarahan
Orcid: 0000-0001-5113-9166Affiliations:
- University of Oklahoma, Norman, USA
According to our database1,
S. Lakshmivarahan
authored at least 70 papers
between 1970 and 2023.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 1995, "For contributions to the theory and applications of learning algorithms, parallel processing and interconnection networks.".
IEEE Fellow
IEEE Fellow 1993, "For contributions to learning algorithms, parallel computing, and their applications.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2023
CoRR, 2023
2021
Applying a Random Projection Algorithm to Optimize Machine Learning Model for Breast Lesion Classification.
IEEE Trans. Biomed. Eng., 2021
Applying a random projection algorithm to optimize machine learning model for predicting peritoneal metastasis in gastric cancer patients using CT images.
Comput. Methods Programs Biomed., 2021
Proceedings of the Medical Imaging 2021: Computer-Aided Diagnosis, 2021
2014
2012
An Approximation Algorithm for Computing a Tipping Set in Super Modular Games for Interdependent Security.
Proceedings of the Complex Adaptive Systems 2012 Conference, 2012
2010
2009
On the number and the distribution of the nash equilibria in supermodular games and their impact on the tipping set.
Proceedings of the 1st International Conference on Game Theory for Networks, 2009
On the Structure of Orthogonal Skew-symmetric Matrices.
Proceedings of the 2009 International Conference on Scientific Computing, 2009
2008
On the Relation between Energy-Conserving Low-Order Models and a System of Coupled Generalized Volterra Gyrostats with Nonlinear Feedback.
J. Nonlinear Sci., 2008
2005
2001
2000
J. Parallel Distributed Comput., 2000
Proceedings of the Applied Computing 2000, 2000
1999
IEEE Trans. Syst. Man Cybern. Part B, 1999
IEEE Trans. Syst. Man Cybern. Part B, 1999
Parallel Comput., 1999
Wormhole Routing in Networks Based on Cayley Graphs: A Performance Comparison.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999
1998
Proceedings of the 1998 ACM symposium on Applied Computing, 1998
1997
Proceedings of the 1997 ACM symposium on Applied Computing, 1997
1996
An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.
SIAM J. Comput., 1996
A comparison of variational data assimilation and nudging using a simple dynamical system with chaotic behavior.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996
1995
J. Parallel Distributed Comput., 1995
Proceedings of the 1995 ACM symposium on applied computing, 1995
1994
Parallel Process. Lett., 1994
Parallel Algorithms Appl., 1994
Tridiagonalizing a Real Symmetric Matrix: a Parallel Direct Approach Using Givens'transformation.
Parallel Algorithms Appl., 1994
J. Circuits Syst. Comput., 1994
A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations.
Inf. Sci., 1994
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.
Inf. Process. Lett., 1994
Analysis of Interconnection Networks Based on Cayley Graphs of Strong Generating Sets.
Proceedings of the 1994 International Conference on Parallel Processing, 1994
Parallel computing using the prefix problem.
Oxford University Press, ISBN: 978-0-19-508849-6, 1994
1993
Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey.
Parallel Comput., 1993
Networks, 1993
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993
Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, 1993
On the Performance of a Direct Parallel Method for Solving Separable Elliptic Equations Based on Block Cyclic Reduction.
Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, 1993
1992
A comparison of performance of algorithms for polar decomposition on a multivector processor.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992
1991
Inf. Process. Lett., 1991
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991
Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991
Efficient parallel algorithms for finding biconnected components of some intersection graphs.
Proceedings of the 19th annual conference on Computer Science, 1991
1990
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990
Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, 1990
1988
J. Supercomput., 1988
Interconnection Networks and Fault Tolerance.
Comput. Syst. Sci. Eng., 1988
1987
Self-routing control algorithms and the passability of random inputs by the base-line network.
Inf. Sci., 1987
Block Tridiagonal Systems on the Alliant FX/8.
Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, 1987
On a New Class of Optimal Parallel Prefix Circuits with (Size+Depth) = 2n-2 AND\lceil log n \rceil DEPTH(2 \lceil log n \rceil -3).
Proceedings of the International Conference on Parallel Processing, 1987
1986
Effect of data organization in a system of interleaved memories on the performance of parallel search.
Inf. Sci., 1986
Proceedings of the 1986 Workshop on Applied Computing, 1986
A New Class of Parallel Algorithms for Solving Linear Tridiagonal Systems.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986
1985
New Parallel Algorithms for Solving First-Order and Certain Classes of Second-Order Linear Recurrences.
Proceedings of the International Conference on Parallel Processing, 1985
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1985
1984
1983
A Condition Known to be Sufficient for Rearrangeability of the Benes Class of Interconnection Networks with 2x2 Switches Is Also Necessary.
Proceedings of the International Conference on Parallel Processing, 1983
1982
Proceedings of the ACM 1982 Annual Conference, Dallas, TX, USA, October 25-27, 1982, 1982
1981
Learning Algorithms for Two-Person Zero-Sum Stochastic Games with Incomplete Information.
Math. Oper. Res., 1981
1977
1976
IEEE Trans. Syst. Man Cybern., 1976
1972
1970
IEEE Trans. Computers, 1970