| 2004 |
|---|
| 10 | EE | Alak Kumar Datta,
Ranjan K. Sen:
o(log4 n) time parallel maximal matching algorithm using linear number of processors.
Parallel Algorithms Appl. 19(1): 19-32 (2004) |
| 2000 |
|---|
| 9 | EE | Alak Kumar Datta,
Ranjan K. Sen:
Improved Parallel Algorithm for Maximal Matching Based on Depth-first-search.
Parallel Algorithms Appl. 14(4): 321-327 (2000) |
| 1999 |
|---|
| 8 | EE | Alak Kumar Datta,
Ranjan K. Sen:
An Efficient Scheme to Solve Two Problems for Two-Terminal Series Parallel Graphs.
Inf. Process. Lett. 71(1): 9-15 (1999) |
| 1998 |
|---|
| 7 | EE | Dilip K. Saikia,
R. Badrinath,
Ranjan K. Sen:
Embedding Torus on the Star Graph.
IEEE Trans. Parallel Distrib. Syst. 9(7): 650-663 (1998) |
| 1996 |
|---|
| 6 | EE | Dilip K. Saikia,
Ranjan K. Sen:
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network.
IEEE Trans. Parallel Distrib. Syst. 7(4): 321-327 (1996) |
| 1995 |
|---|
| 5 | | Ranjan K. Sen:
a New Scheme for Dynamic Processor Assignment for Irregular Problems.
IRREGULAR 1995: 99-113 |
| 4 | EE | Alak Kumar Datta,
Ranjan K. Sen:
1-Approximation Algorithm for Bottleneck Disjoint Path Matching.
Inf. Process. Lett. 55(1): 41-44 (1995) |
| 3 | EE | Alak Kumar Datta,
Ranjan K. Sen:
A Parallel Algorithm for Maximal Matching Based on Depth First Search.
Parallel Algorithms Appl. 5(3): 161-164 (1995) |
| 2 | | Dilip K. Saikia,
Ranjan K. Sen:
Order Preserving Communication on a Star Network.
Parallel Computing 21(5): 771-782 (1995) |
| 1992 |
|---|
| 1 | | Alak Kumar Datta,
Ranjan K. Sen:
An Efficient Parallel Algorithm for Maximal Matching.
CONPAR 1992: 813-814 |
