Sudarshan K. Dhall

B. Cremeans, S. Lakshmivarahan, Sudarshan K. Dhall: An Approximation Algorithm for Computing a Tipping Set in Super Modular Games for Interdependent Security. Procedia CS 12: 404-411 (2012)

Yuh-Rong Chen, Sridhar Radhakrishnan, Sudarshan K. Dhall, Suleyman Karabuk: On multi-stream multi-source multicast routing. GLOBECOM 2012: 1926-1931

Yuh-Rong Chen, Sridhar Radhakrishnan, Sudarshan K. Dhall, Suleyman Karabuk: On the game server network selection with delay and delay variation constraints. COMSNETS 2011: 1-10

Sirirut Vanichayobon, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan, John K. Antonio: Power-speed Trade-off in Parallel Prefix Circuits. Journal of Circuits, Systems, and Computers 14(1): 65-98 (2005)

Jonghyun Kim, Sridhar Radhakrishnan, Sudarshan K. Dhall: Measurement and Analysis of Worm Propagation on Internet Network Topology. ICCCN 2004: 495-500

Hongping Li, John K. Antonio, Sudarshan K. Dhall: Fast and Precise Power Prediction for Combinational Circuits. ISVLSI 2003: 254-259

M. Alabdulkareem, S. Lakshmivarahan, Sudarshan K. Dhall: Scalability analysis of large codes using factorial designs. Parallel Computing 27(9): 1145-1171 (2001)

Fen Lin Wu, S. Lakshmivarahan, Sudarshan K. Dhall: Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups. J. Parallel Distrib. Comput. 60(5): 539-565 (2000)

Timothy Osmulski, Jeffrey T. Muehring, Brian F. Veale, Jack M. West, Hongping Li, Sirirut Vanichayobon, Seok-Hyun Ko, John K. Antonio, Sudarshan K. Dhall: A Probabilistic Power Prediction Tool for the Xilinx 4000-Series FPGA. IPDPS Workshops 2000: 776-783

S. Lakshmivarahan, Sudarshan K. Dhall: Ring, torus and hypercube architectures/algorithms for parallel computing. Parallel Computing 25(13-14): 1877-1906 (1999)

Sung Boo, S. Lakshmivarahan, Sudarshan K. Dhall: Wormhole Routing in Networks Based on Cayley Graphs: A Performance Comparison. PDPTA 1999: 2699-2705

Wanglung Chung, John M. Lewis, S. Lakshmivarahan, Sudarshan K. Dhall: Effect of data distribution in data assimilation using Burgers' equation. SAC 1997: 521-526

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. SIAM J. Comput. 25(2): 404-419 (1996)

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. SAC 1996: 454-462

Sadegh Davari, Sudarshan K. Dhall: On-line Algorithms for Allocating Periodic-time-critical Tasks on Multiprocessor Systems. Informatica (Slovenia) 19(1) (1995)

Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan: The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC. J. Parallel Distrib. Comput. 28(2): 109-112 (1995)

Rachel Fiedler, S. Lakshmivarahan, Sudarshan K. Dhall, John M. Lewis: Optimal initialization of mixed-layer model using the adjoint technique. SAC 1995: 91-95

S. Lakshmivarahan, Sudarshan K. Dhall: Parallel computing using the prefix problem. Oxford University Press 1994, isbn 978-0-19-508849-6, pp. I-XVII, 1-294

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. Inf. Process. Lett. 49(1): 45-50 (1994)

S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan: A Processor Efficient MIS Algorithm on Random Graphs. Inf. Process. Lett. 49(3): 157-163 (1994)

Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan: A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations. Inf. Sci. 76(3-4): 177-195 (1994)

Kulathur S. Rajasethupathy, Gwan-Ming Thio, Sudarshan K. Dhall, S. Lakshmivarahan: Tridiagonalizing a Real Symmetric Matrix: a Parallel Direct Approach Using Givens'transformation. Parallel Algorithms Appl. 2(4): 305-313 (1994)

Chang G. Song, Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall, John M. Lewis, Christopher S. Velden: An Experiment in Hurricane Track Prediction Using Parallel Computing Methods. Parallel Algorithms Appl. 2(4): 315-332 (1994)

S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan: A Processor Efficient Connectivity Algorithm on Random Graphs. Parallel Processing Letters 4: 29-36 (1994)

Jen-Peng Huang, S. Lakshmivarahan, Sudarshan K. Dhall: Analysis of Interconnection Networks Based on Cayley Graphs of Strong Generating Sets. ICPP (1) 1994: 42-45

Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall: A new class of interconnection networks based on the alternating group. Networks 23(4): 315-326 (1993)

S. Lakshmivarahan, Jung-Sing Jwo, Sudarshan K. Dhall: Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey. Parallel Computing 19(4): 361-407 (1993)

Seshu V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall: A Note on Orthogonal Graphs. IEEE Trans. Computers 42(5): 624-630 (1993)

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. SAC 1993: 517-524

Jen-Peng Huang, S. Lakshmivarahan, Sudarshan K. Dhall: Analysis of Interconnection Networks Based on Simple Cayley Coset Graphs. SPDP 1993: 150-157

Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan: A New Approach for the Domination Problem on Permutation Graphs. Inf. Process. Lett. 37(4): 219-224 (1991)

S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan: An Improved Maximal Matching Algorithm. Parallel Processing Letters 1: 135-142 (1991)

Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall: Characterization of Node Disjoint (Parallel) Path in Star Graphs. IPPS 1991: 404-409

Seshu V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall: A Note on Orthogonal Graphs. IPPS 1991: 432-437

Seshu V. R. Madabhushi, Sivaramakrishnan Lakshmivarahan, Sudarshan K. Dhall: Analysis of the modified even networks. SPDP 1991: 128-131

Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan: An Optimal Parallel Algorithm for the Maximal Element Problem (Abstract). ACM Conference on Computer Science 1990: 435

Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan: Parallel algorithms for ranking of trees. SPDP 1990: 26-31

Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall: Embedding of cycles and grids in star graphs. SPDP 1990: 540-547

S. Lakshmivarahan, Sudarshan K. Dhall: A new hierarchy of hypercube interconnection schemes for parallel computers. The Journal of Supercomputing 2(1): 81-108 (1988)

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). ICPP 1987: 58-65

Kenneth Dowers, S. Lakshmivarahan, Sudarshan K. Dhall, J. Diaz: Block Tridiagonal Systems on the Alliant FX/8. PPSC 1987: 56-60

Sudarshan K. Dhall, S. Lakshmivarahan: Effect of data organization in a system of interleaved memories on the performance of parallel search. Inf. Sci. 39(3): 219-245 (1986)

S. Lakshmivarahan, Sudarshan K. Dhall: A New Class of Parallel Algorithms for Solving Linear Tridiagonal Systems. FJCC 1986: 315-324

Sadegh Davari, Sudarshan K. Dhall: An On Line Algorithm for Real-Time Tasks Allocation. RTSS 1986: 194-200

Sudarshan K. Dhall, S. Davari-Hadikiashari: Scheduling periodic time-critical tasks on a multiprocessor system (abstract only). ACM Conference on Computer Science 1985: 426

S. Lakshmivarahan, Sudarshan K. Dhall: Parallel Algorithms for Solving Certain Classes of Linear Recurrences. FSTTCS 1985: 457-478

S. Lakshmivarahan, Sudarshan K. Dhall: New Parallel Algorithms for Solving First-Order and Certain Classes of Second-Order Linear Recurrences. ICPP 1985: 843-845

S. Lakshmivarahan, Sudarshan K. Dhall, Leslie L. Miller: Parallel Sorting Algorithms. Advances in Computers 23: 295-354 (1984)