| A comparative study of topological properties of hypercubes and star graphs K Day, A Tripathi IEEE Transactions on Parallel and Distributed Systems 5 (1), 31-38, 1994 | 341 | 1994 |
| Arrangement graphs: a class of generalized star graphs K Day, A Tripathi Information Processing Letters 42 (5), 235-241, 1992 | 249 | 1992 |
| Fault diameter of k-ary n-cube networks K Day, AE Al-Ayyoub IEEE Transactions on Parallel and Distributed Systems 8 (9), 903-907, 1997 | 170 | 1997 |
| The cross product of interconnection networks K Day, AE Al-Ayyoub IEEE Transactions on Parallel and Distributed Systems 8 (2), 109-118, 1997 | 128 | 1997 |
| Embedding of cycles in arrangement graphs K Day, A Tripathi IEEE Transactions on Computers 42 (8), 1002-1006, 1993 | 118 | 1993 |
| Topological properties of OTIS-networks K Day, AE Al-Ayyoub IEEE Transactions on Parallel and Distributed Systems 13 (4), 359-366, 2002 | 108 | 2002 |
| The conditional node connectivity of the k-ary n-cube K Day Journal of Interconnection networks 5 (01), 13-26, 2004 | 68 | 2004 |
| Unidirectional star graphs K Day, A Tripathi Information Processing Letters 45 (3), 123-129, 1993 | 54 | 1993 |
| Replication algorithms for the world-wide web F Tenzakhti, K Day, M Ould-Khaoua Journal of Systems Architecture 50 (10), 591-605, 2004 | 45 | 2004 |
| Minimal fault diameter for highly resilient product networks K Day, AE Al-Ayyoub IEEE Transactions on Parallel and Distributed Systems 11 (9), 926-930, 2000 | 40 | 2000 |
| Characterization of node disjoint paths in arrangement graphs K Day Tech. Rept., TR. 91-43, Dept. of Commputer Science, University of Minessota, 1991 | 39 | 1991 |
| Probability-based fault-tolerant routing in hypercubes J Al-Sadi, K Day, M Ould-Khaoua The Computer Journal 44 (5), 368-373, 2001 | 36 | 2001 |
| The hyperstar interconnection network AE Al-Ayyoub, K Day Journal of Parallel and distributed Computing 48 (2), 175-199, 1998 | 31 | 1998 |
| Optical transpose k-ary n-cube networks K Day Journal of Systems Architecture 50 (11), 697-705, 2004 | 30 | 2004 |
| Embedding grids, hypercubes, and trees in arrangement graphs K Day, A Tripathi 1993 International Conference on Parallel Processing-ICPP'93 3, 65-72, 1993 | 30 | 1993 |
| Unsafety vectors: A new Fault-tolerant routing for the binary n-cube J Al-Sadi, K Day, M Ould-Khaoua Journal of Systems Architecture 47 (9), 783-793, 2002 | 29 | 2002 |
| Unsafety vectors: A new fault-tolerant routing for k-ary n-cubes J Al-Sadi, K Day, M Ould-Khaoua Microprocessors and Microsystems 25 (5), 239-246, 2001 | 29 | 2001 |
| Fault-tolerant routing in hypercubes using probability vectors J Al-Sadi, K Day, M Ould-Khaoua Parallel Computing 27 (10), 1381-1399, 2001 | 28 | 2001 |
| Bandwidth borrowing‐based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks SA Khanjari, B Arafeh, K Day, N Alzeidi International Journal of Communication Systems 26 (7), 811-831, 2013 | 25 | 2013 |
| A multilevel partitioning approach for efficient tasks allocation in heterogeneous distributed systems B Arafeh, K Day, A Touzene Journal of Systems Architecture 54 (5), 530-548, 2008 | 24 | 2008 |
