1999 | ||
---|---|---|
6 | EE | M. V. Padmini, B. B. Madan, Bijendra N. Jain: A Linear Array for Large Sparse Matrix Operations - I Cholesky Factorization. Parallel Algorithms Appl. 13(3): 187-215 (1999) |
5 | EE | M. V. Padmini, B. B. Madan, Bijendra N. Jain: A Linear Array for Large Sparse Matrix Operations - Ii Triangular System Solvers and Matrix Multiplication. Parallel Algorithms Appl. 13(3): 217-237 (1999) |
1994 | ||
4 | Atul Varshneya, B. B. Madan, M. Balakrishnan: Concurrent Search and Insertion in K-Dimensional Height Balanced Trees. IPPS 1994: 883-887 | |
1988 | ||
3 | EE | M. Zubair, B. B. Madan: Efficient systolic algorithm for finding bridges in a connected graph. Parallel Computing 6(1): 57-61 (1988) |
1987 | ||
2 | M. Zubair, B. B. Madan: Time Efficient Systolic Architecture for Matrix * Vector Multiplication. Inf. Process. Lett. 24(4): 225-231 (1987) | |
1976 | ||
1 | B. B. Madan, A. K. Mahalanabis: Improved State Estimation for Systems with Interrupted Observations Information and Control 32(2): 146-157 (1976) |
1 | M. Balakrishnan | [4] |
2 | Bijendra N. Jain (Bijendra Nath Jain) | [5] [6] |
3 | A. K. Mahalanabis | [1] |
4 | M. V. Padmini | [5] [6] |
5 | Atul Varshneya | [4] |
6 | M. Zubair | [2] [3] |