Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Dhall, S.K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scalability analysis of large codes using factorial designs
M. Alabdulkareem
,
S. Lakshmivarahan
,
S.K. Dhall
Parallel Computing
27
(9), 2001, pp. 1145-1171
Routing in a class of Cayley graphs of semidirect products of finite groups
Fen Lin Wu
,
S. Lakshmivarahan
,
S.K. Dhall
Journal Parallel Distributed Computing
60
(5), 2000, pp. 539-565
An
O(n+m)
-time algorithm for finding a minimum-weight dominating set in a permutation graph
C. Rhee
,
Y.D. Liang
,
S.K. Dhall
,
S. Lakshmivarahan
SIAM Journal on Computing
25
(2), 1996, pp. 404-419
The minimum weight dominating set problem for permutation graphs is in
NC
C. Rhee
,
S.K. Dhall
,
S. Lakshmivarahan
Journal Parallel Distributed Computing
28
(2), 1995, pp. 109-112
Analysis of interconnection networks based on Cayley graphs of strong generating sets
Jen-peng Huang
,
S. Lakshmivarahan
,
S.K. Dhall
Proceedings of the 1994 International Conference on Parallel Processing. Vol.~I Architecture (North Carolina State University, August 15-19, 1994)
, 1994, pp. 42-45
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
C. Rhee
,
Y. Daniel Liang
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
49
, 1994, pp. 45-50
A processor efficient MIS algorithm on random graphs
S.B. Yang
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
49
, 1994, pp. 157-163
A processor efficient connectivity algorithm on random graphs
S.B. Yang
,
S.K. Dhall
,
S. Lakshmivarahan
Parallel Processing Letters
4
(1-2), 1994, pp. 29-36
Analysis of interconnection networks based on simple Cayley coset graphs
Jen-peng Huang
,
S. Lakshmivarahan
,
S.K. Dhall
Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing, SPDP'93 (Dallas, Texas, December 1-4, 1993)
, 1993, pp. 150-157
A new class of interconnection networks based on the alternating group
Jung-Sing Jwo
,
S. Lakshmivarahan
,
S.K. Dhall
Networks
23
(4), 1993, pp. 315-326
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
S. Lakshmivarahan
,
Jung-Sing Jwo
,
S.K. Dhall
Parallel Computing
19
(4), 1993, pp. 361-407
A new class of interconnection networks based on alternating group
Jung-Sing Jwo
,
S. Lakshmivarahan
,
S.K. Dhall
Proceedings of the 4th IEEE Symposium on Parallel and Distributed Processing, SPDP'92 (Arlington, Texas, December 1-4, 1992)
, 1992, pp. 483-486
A new approach for the domination problem on permutation graphs
Y. Liang
,
C. Rhee
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
37
, 1991, pp. 219-224
Analysis of the modified even networks
S.V.R. Madabhushi
,
S. Lakshmivarahan
,
S.K. Dhall
Proceedings of the 3rd IEEE Symposium on Parallel and Distributed Processing, SPDP'91 (Dallas, Texas, December 2-5, 1991)
, 1991, pp. 128-131
An improved maximal matching algorithm
S.B. Yang
,
S.K. Dhall
,
S. Lakshmivarahan
Parallel Processing Letters
1
(2), 1991, pp. 135-142
Embedding of cycles and grids in star graphs
J.-S. Jwo
,
S. Lakshmivarahan
,
S.K. Dhall
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 540-547
Parallel algorithms for ranking of trees
Y. Liang
,
S.K. Dhall
,
S. Lakshmivarahan
Proceedings of the 2nd IEEE Symposium on Parallel and Distributed Processing, SPDP'90 (Dallas, Texas, December 9-13, 1990)
, 1990, pp. 26-31
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
)
S.R. Lakshmivarahan
,
C.M. Yang
,
S.K. Dhall
Proceedings of the 1987 International Conference on Parallel Processing, ICPP'87 (Penn State University, August 17-21, 1987)
, 1987, pp. 58-65