default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSudarshan K. Dhall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[i1]Xiaomeng Dong, E. N. Barnett, Sudarshan K. Dhall:
Parallel Matrix Condensation for Calculating Log-Determinant of Large Matrix. CoRR abs/1811.08057 (2018)- 2015
- [j26]Yuh-Rong Chen, Sridhar Radhakrishnan, Sudarshan K. Dhall, Suleyman Karabuk:
The service overlay network design problem for interactive internet applications. Comput. Oper. Res. 57: 73-82 (2015) - 2013
- [j25]Yuh-Rong Chen, Sridhar Radhakrishnan, Sudarshan K. Dhall, Suleyman Karabuk:
On multi-stream multi-source multicast routing. Comput. Networks 57(15): 2916-2930 (2013) - 2012
- [c32]Yuh-Rong Chen, Sridhar Radhakrishnan, Sudarshan K. Dhall, Suleyman Karabuk:
On multi-stream multi-source multicast routing. GLOBECOM 2012: 1926-1931 - [c31]B. Cremeans, S. Lakshmivarahan, Sudarshan K. Dhall:
An Approximation Algorithm for Computing a Tipping Set in Super Modular Games for Interdependent Security. Complex Adaptive Systems 2012: 404-411 - 2011
- [c30]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
2000 – 2009
- 2009
- [c29]Sudarshan K. Dhall, S. Lakshmivarahan, Pramode K. Verma:
On the number and the distribution of the nash equilibria in supermodular games and their impact on the tipping set. GAMENETS 2009: 691-696 - 2005
- [j24]Sirirut Vanichayobon
, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan, John K. Antonio:
Power-speed Trade-off in Parallel Prefix Circuits. J. Circuits Syst. Comput. 14(1): 65-98 (2005) - 2004
- [c28]Jonghyun Kim, Sridhar Radhakrishnan, Sudarshan K. Dhall:
Measurement and Analysis of Worm Propagation on Internet Network Topology. ICCCN 2004: 495-500 - [r1]Sudarshan K. Dhall:
Approximation Algorithms for Scheduling Time-Critical Jobs on Multiprocessor Systems. Handbook of Scheduling 2004 - 2003
- [c27]Hongping Li, John K. Antonio, Sudarshan K. Dhall:
Fast and Precise Power Prediction for Combinational Circuits. ISVLSI 2003: 254-259 - 2001
- [j23]M. Alabdulkareem, S. Lakshmivarahan, Sudarshan K. Dhall:
Scalability analysis of large codes using factorial designs. Parallel Comput. 27(9): 1145-1171 (2001) - 2000
- [j22]Fen Lin Wu, S. Lakshmivarahan, Sudarshan K. Dhall:
Routing in a Class of Cayley Graphs of Semidirect Products of Finite Groups. J. Parallel Distributed Comput. 60(5): 539-565 (2000) - [c26]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
1990 – 1999
- 1999
- [j21]S. Lakshmivarahan, Sudarshan K. Dhall:
Ring, torus and hypercube architectures/algorithms for parallel computing. Parallel Comput. 25(13-14): 1877-1906 (1999) - [c25]Sung Boo, S. Lakshmivarahan, Sudarshan K. Dhall:
Wormhole Routing in Networks Based on Cayley Graphs: A Performance Comparison. PDPTA 1999: 2699-2705 - 1997
- [c24]Wanglung Chung, John M. Lewis, S. Lakshmivarahan, Sudarshan K. Dhall:
Effect of data distribution in data assimilation using Burgers' equation. SAC 1997: 521-526 - 1996
- [j20]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) - [c23]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 - 1995
- [j19]Sadegh Davari, Sudarshan K. Dhall:
On-line Algorithms for Allocating Periodic-time-critical Tasks on Multiprocessor Systems. Informatica (Slovenia) 19(1) (1995) - [j18]Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan:
The Minimum Weight Dominating Set Problem for Permutation Graphs Is in NC. J. Parallel Distributed Comput. 28(2): 109-112 (1995) - [c22]Rachel Fiedler, S. Lakshmivarahan, Sudarshan K. Dhall, John M. Lewis:
Optimal initialization of mixed-layer model using the adjoint technique. SAC 1995: 91-95 - 1994
- [b2]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 - [j17]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) - [j16]S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan:
A Processor Efficient MIS Algorithm on Random Graphs. Inf. Process. Lett. 49(3): 157-163 (1994) - [j15]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) - [j14]Seshu V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall:
Analysis of a Class of Networks Based on cubic Star Graphs. J. Circuits Syst. Comput. 4(2): 191-222 (1994) - [j13]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) - [j12]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) - [j11]S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan:
A Processor Efficient Connectivity Algorithm on Random Graphs. Parallel Process. Lett. 4: 29-36 (1994) - [c21]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 - 1993
- [j10]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) - [j9]S. Lakshmivarahan, Jung-Sing Jwo, Sudarshan K. Dhall:
Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey. Parallel Comput. 19(4): 361-407 (1993) - [j8]Seshu V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall:
A Note on Orthogonal Graphs. IEEE Trans. Computers 42(5): 624-630 (1993) - [c20]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 - [c19]Jen-Peng Huang, S. Lakshmivarahan, Sudarshan K. Dhall:
Analysis of Interconnection Networks Based on Simple Cayley Coset Graphs. SPDP 1993: 150-157 - 1992
- [c18]Kulathur S. Rajasethupathy, Gwan-Ming Thio, S. Lakshmivarahan, Sudarshan K. Dhall:
A comparison of performance of algorithms for polar decomposition on a multivector processor. SAC 1992: 724-733 - [c17]Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan:
NC algorithms for dominations in permutation graphs. SAC 1992: 734-739 - 1991
- [j7]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) - [j6]Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall:
Embedding of cycles and Grids in Star Graphs. J. Circuits Syst. Comput. 1(1): 43-74 (1991) - [j5]S. B. Yang, Sudarshan K. Dhall, S. Lakshmivarahan:
An Improved Maximal Matching Algorithm. Parallel Process. Lett. 1: 135-142 (1991) - [c16]Y. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan:
Efficient parallel algorithms for finding biconnected components of some intersection graphs. ACM Conference on Computer Science 1991: 48-52 - [c15]Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall:
Characterization of Node Disjoint (Parallel) Path in Star Graphs. IPPS 1991: 404-409 - [c14]Seshu V. R. Madabhushi, S. Lakshmivarahan, Sudarshan K. Dhall:
A Note on Orthogonal Graphs. IPPS 1991: 432-437 - [c13]Seshu V. R. Madabhushi, Sivaramakrishnan Lakshmivarahan, Sudarshan K. Dhall:
Analysis of the modified even networks. SPDP 1991: 128-131 - 1990
- [c12]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 - [c11]Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
Parallel algorithms for ranking of trees. SPDP 1990: 26-31 - [c10]Jung-Sing Jwo, S. Lakshmivarahan, Sudarshan K. Dhall:
Embedding of cycles and grids in star graphs. SPDP 1990: 540-547
1980 – 1989
- 1988
- [j4]S. Lakshmivarahan, Sudarshan K. Dhall:
A new hierarchy of hypercube interconnection schemes for parallel computers. J. Supercomput. 2(1): 81-108 (1988) - 1987
- [c9]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 - [c8]Kenneth Dowers, S. Lakshmivarahan, Sudarshan K. Dhall, J. Diaz:
Block Tridiagonal Systems on the Alliant FX/8. PP 1987: 56-60 - 1986
- [j3]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) - [c7]S. Lakshmivarahan, Sudarshan K. Dhall:
A New Class of Parallel Algorithms for Solving Linear Tridiagonal Systems. FJCC 1986: 315-324 - [c6]Sadegh Davari, Sudarshan K. Dhall:
An On Line Algorithm for Real-Time Tasks Allocation. RTSS 1986: 194-200 - [c5]William J. Ouchark, Jay A. Davis, S. Lakshmivarahan, Sudarshan K. Dhall:
Experiences with the Intel Hypercube. Workshop on Applied Computing 1986: 2-7 - 1985
- [c4]Sudarshan K. Dhall, S. Davari-Hadikiashari:
Scheduling periodic time-critical tasks on a multiprocessor system (abstract only). ACM Conference on Computer Science 1985: 426 - [c3]S. Lakshmivarahan, Sudarshan K. Dhall:
Parallel Algorithms for Solving Certain Classes of Linear Recurrences. FSTTCS 1985: 457-478 - [c2]S. Lakshmivarahan, Sudarshan K. Dhall:
New Parallel Algorithms for Solving First-Order and Certain Classes of Second-Order Linear Recurrences. ICPP 1985: 843-845 - 1984
- [j2]S. Lakshmivarahan, Sudarshan K. Dhall, Leslie L. Miller:
Parallel Sorting Algorithms. Adv. Comput. 23: 295-354 (1984) - 1982
- [c1]J. Cheung, Sudarshan K. Dhall, S. Lakshmivarahan, Les Miller, B. Walker:
A new class of two stage parallel sorting schemes. ACM Annual Conference 1982: 26-29
1970 – 1979
- 1978
- [j1]Sudarshan K. Dhall, C. L. Liu:
On a Real-Time Scheduling Problem. Oper. Res. 26(1): 127-140 (1978) - 1977
- [b1]Sudarshan K. Dhall:
Scheduling Periodic-Time - Critical Jobs on Single Processor and Multiprocessor Computing Systems. University of Illinois Urbana-Champaign, USA, 1977
Coauthor Index
aka: Sivaramakrishnan Lakshmivarahan
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 2024-07-04 22:21 CEST 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:
