![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. M. Zubair Stephan Olariu , S. Toida , M. Zubair: On a Conjecture by Plaisted and Hong. J. Algorithms 9 (4): 597-598 (1988) M. Zubair, B. B. Madan : Efficient systolic algorithm for finding bridges in a connected graph. Parallel Computing 6 (1): 57-61 (1988) M. Zubair, B. B. Madan : Time Efficient Systolic Architecture for Matrix * Vector Multiplication. Inf. Process. Lett. 24 (4): 225-231 (1987) 1 [ 1 ] [ 2 ] 2 [ 3 ] 3 [ 3 ] ![]() ©2005 Association for Computing Machinery |