| 1999 |
|---|
| 11 | | A. P. Wim Böhm,
Jeffrey Hammes,
Sumit Sur:
On the performance of pure and impure parallel functional programs.
Parallel Computing 25(13-14): 1723-1740 (1999) |
| 1997 |
|---|
| 10 | | Jeffrey Hammes,
Sumit Sur,
A. P. Wim Böhm:
On the Effectiveness of Functional Language Features: NAS Benchmark FT.
J. Funct. Program. 7(1): 103-123 (1997) |
| 1995 |
|---|
| 9 | | Sumit Sur,
Pradip K. Srimani:
IEH Graphs. A Novel Generalization of Hypercube Graphs
Acta Inf. 32(6): 597-609 (1995) |
| 8 | | Sumit Sur,
Pradip K. Srimani:
An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes.
J. Parallel Distrib. Comput. 26(1): 54-60 (1995) |
| 1994 |
|---|
| 7 | | Sumit Sur,
A. P. Wim Böhm:
Functional I-structure, and M-structure Implementations of NAS Benchmark FT.
IFIP PACT 1994: 47-56 |
| 6 | EE | Sumit Sur,
A. P. Wim Böhm:
Analysis of non-strict functional implementations of the Dongarra-Sorensen eigensolver.
International Conference on Supercomputing 1994: 412-418 |
| 5 | | Walid A. Najjar,
Annette Lagman,
Sumit Sur,
Pradip K. Srimani:
Modeling Adaptive Routing in k-ary n-cube Networks.
MASCOTS 1994: 120-125 |
| 1993 |
|---|
| 4 | | Annette Lagman,
Walid A. Najjar,
Sumit Sur,
Pradip K. Srimani:
Evaluation of Idealized Adaptive Routing on k-ary n-cubes.
SPDP 1993: 166-169 |
| 3 | EE | Sumit Sur,
Pradip K. Srimani:
A self-stabilizing algorithm for coloring bipartite graphs.
Inf. Sci. 69(3): 219-227 (1993) |
| 1992 |
|---|
| 2 | | Sumit Sur,
Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph.
Parallel Processing Letters 2: 171-179 (1992) |
| 1991 |
|---|
| 1 | | Sumit Sur,
Pradip K. Srimani:
A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network.
ICPP (3) 1991: 267-270 |
