The SCEAS System
| |||||||

## Search the dblp DataBase
S. Lakshmivarahan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- S. Lakshmivarahan, Sudarshan K. Dhall, Leslie L. Miller
**Parallel Sorting Algorithms.**[Citation Graph (1, 0)][DBLP] Advances in Computers, 1984, v:23, n:, pp:295-354 [Journal] - Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
**An Optimal Parallel Algorithm for the Maximal Element Problem (Abstract).**[Citation Graph (0, 0)][DBLP] ACM Conference on Computer Science, 1990, pp:435- [Conf] - S. Lakshmivarahan, Sudarshan K. Dhall
**A New Class of Parallel Algorithms for Solving Linear Tridiagonal Systems.**[Citation Graph (0, 0)][DBLP] FJCC, 1986, pp:315-324 [Conf] - S. Lakshmivarahan, Sudarshan K. Dhall
**Parallel Algorithms for Solving Certain Classes of Linear Recurrences.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1985, pp:457-478 [Conf] - Sudarshan K. Dhall, S. Lakshmivarahan, Chi-Ming Yang
**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).**[Citation Graph (0, 0)][DBLP] ICPP, 1987, pp:58-65 [Conf] - Jen-peng Huang, S. Lakshmivarahan, Sudarshan K. Dhall
**Analysis of Interconnection Networks Based on Cayley Graphs of Strong Generating Sets.**[Citation Graph (0, 0)][DBLP] ICPP (1), 1994, pp:42-45 [Conf] - Suresh C. Kothari, S. Lakshmivarahan
**A Condition Known to be Sufficient for Rearrangeability of the Benes Class of Interconnection Networks with 2x2 Switches Is Also Necessary.**[Citation Graph (0, 0)][DBLP] ICPP, 1983, pp:76-78 [Conf] - S. Lakshmivarahan, Sudarshan K. Dhall
**New Parallel Algorithms for Solving First-Order and Certain Classes of Second-Order Linear Recurrences.**[Citation Graph (0, 0)][DBLP] ICPP, 1985, pp:843-845 [Conf] - Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall
**Characterization of Node Disjoint (Parallel) Path in Star Graphs.**[Citation Graph (0, 0)][DBLP] IPPS, 1991, pp:404-409 [Conf] - S. V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall
**A Note on Orthogonal Graphs.**[Citation Graph (0, 0)][DBLP] IPPS, 1991, pp:432-437 [Conf] - Sung Boo, S. Lakshmivarahan, Sudarshan K. Dhall
**Wormhole Routing in Networks Based on Cayley Graphs: A Performance Comparison.**[Citation Graph (0, 0)][DBLP] PDPTA, 1999, pp:2699-2705 [Conf] - Kenneth Dowers, S. Lakshmivarahan, Sudarshan K. Dhall, J. Diaz
**Block Tridiagonal Systems on the Alliant FX/8.**[Citation Graph (0, 0)][DBLP] PPSC, 1987, pp:56-60 [Conf] - Ahmad Alhamed, S. Lakshmivarahan
**A Clustering Approach to Multi-Model Ensemble Analysis Using SAMEX Data.**[Citation Graph (0, 0)][DBLP] SAC (1), 2000, pp:111-116 [Conf] - E. Billard, S. Lakshmivarahan
**Simulation of period-doubling behavior in distributed learning automata.**[Citation Graph (0, 0)][DBLP] SAC, 1998, pp:690-695 [Conf] - Wanglung Chung, John M. Lewis, S. Lakshmivarahan, Sudarshan K. Dhall
**A comparison of variational data assimilation and nudging using a simple dynamical system with chaotic behavior.**[Citation Graph (0, 0)][DBLP] SAC, 1996, pp:454-462 [Conf] - Wanglung Chung, John M. Lewis, S. Lakshmivarahan, Sudarshan K. Dhall
**Effect of data distribution in data assimilation using Burgers' equation.**[Citation Graph (0, 0)][DBLP] SAC, 1997, pp:521-526 [Conf] - Rachel Fiedler, S. Lakshmivarahan, Sudarshan K. Dhall, John M. Lewis
**Optimal initialization of mixed-layer model using the adjoint technique.**[Citation Graph (0, 0)][DBLP] SAC, 1995, pp:91-95 [Conf] - Kevin Kelleher, S. Lakshmivarahan, Sudarshan K. Dhall
**On the Performance of a Direct Parallel Method for Solving Separable Elliptic Equations Based on Block Cyclic Reduction.**[Citation Graph (0, 0)][DBLP] SAC, 1993, pp:517-524 [Conf] - Shankar Vaidyanathan, S. Lakshmivarahan
**Analysis of Upper Bound in Valiant's Model for Learning Bounded CNF Expressions.**[Citation Graph (0, 0)][DBLP] SAC, 1993, pp:754-761 [Conf] - Jen-peng Huang, S. Lakshmivarahan, Sudarshan K. Dhall
**Analysis of Interconnection Networks Based on Simple Cayley Coset Graphs.**[Citation Graph (0, 0)][DBLP] SPDP, 1993, pp:150-157 [Conf] - Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall
**Embedding of cycles and grids in star graphs.**[Citation Graph (0, 0)][DBLP] SPDP, 1990, pp:540-547 [Conf] - Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
**Parallel algorithms for ranking of trees.**[Citation Graph (0, 0)][DBLP] SPDP, 1990, pp:26-31 [Conf] - S. Lakshmivarahan
**Algorithms for Public Key Cryptosystems: Theory and Application.**[Citation Graph (0, 0)][DBLP] Advances in Computers, 1983, v:22, n:, pp:45-108 [Journal] - Simin H. Pakzad, S. Lakshmivarahan
**Interconnection Networks and Fault Tolerance.**[Citation Graph (0, 0)][DBLP] Comput. Syst. Sci. Eng., 1988, v:3, n:2, pp:91-99 [Journal] - Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
**A New Approach for the Domination Problem on Permutation Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:37, n:4, pp:219-224 [Journal] - Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
**Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:1, pp:45-50 [Journal] - S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan
**A Processor Efficient MIS Algorithm on Random Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:3, pp:157-163 [Journal] - Abdulraouf Y. Al-Hallaq, S. Lakshmivarahan
**Self-routing control algorithms and the passability of random inputs by the base-line network.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1987, v:43, n:1-2, pp:139-154 [Journal] - Sudarshan K. Dhall, S. Lakshmivarahan
**Effect of data organization in a system of interleaved memories on the performance of parallel search.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1986, v:39, n:3, pp:219-245 [Journal] - Ulrich Herkenrath, Dieter Kalin, S. Lakshmivarahan
**On a general class of absorbing-barrier learning algorithms.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1981, v:24, n:3, pp:255-263 [Journal] - S. Lakshmivarahan, M. A. L. Thathachar
**Optimal non-linear reinforcement schemes for stochastic automata.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1972, v:4, n:2, pp:121-128 [Journal] - Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
**A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1994, v:76, n:3-4, pp:177-195 [Journal] - Mohammad Reza Meybodi, S. Lakshmivarahan
**varepsilon-Optimality of a general class of learning algorithms.**[Citation Graph (0, 0)][DBLP] Inf. Sci., 1982, v:28, n:1, pp:1-20 [Journal] - Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan
**The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1995, v:28, n:2, pp:109-112 [Journal] - Fen Lin Wu, S. Lakshmivarahan, Sudarshan K. Dhall
**Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2000, v:60, n:5, pp:539-565 [Journal] - M. Alabdulkareem, S. Lakshmivarahan, Sudarshan K. Dhall
**Scalability analysis of large codes using factorial designs.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 2001, v:27, n:9, pp:1145-1171 [Journal] - S. Lakshmivarahan, Jung-Sing Jwo, Sudarshan K. Dhall
**Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1993, v:19, n:4, pp:361-407 [Journal] - S. Lakshmivarahan, Sudarshan K. Dhall
**Ring, torus and hypercube architectures/algorithms for parallel computing.**[Citation Graph (0, 0)][DBLP] Parallel Computing, 1999, v:25, n:13-14, pp:1877-1906 [Journal] - S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan
**An Improved Maximal Matching Algorithm.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1991, v:1, n:, pp:135-142 [Journal] - S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan
**A Processor Efficient Connectivity Algorithm on Random Graphs.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1994, v:4, n:, pp:29-36 [Journal] - Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan
**An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:2, pp:404-419 [Journal] - S. V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall
**A Note on Orthogonal Graphs.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1993, v:42, n:5, pp:624-630 [Journal] - E. Billard, S. Lakshmivarahan
**Learning in multilevel games with incomplete information. I.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1999, v:29, n:3, pp:329-339 [Journal] - Jing Zhou, E. Billard, S. Lakshmivarahan
**Learning in multilevel games with incomplete information. II.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1999, v:29, n:3, pp:340-349 [Journal] **On the Structure of Orthogonal Skew-symmetric Matrices.**[Citation Graph (, )][DBLP]
Search in 0.066secs, Finished in 0.068secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |