K. Day

Available identifiers

Publication	Date of Publication	Type
Embedding of cycles in arrangement graphs	2018-09-14	Paper
Edge-disjoint spanning trees for the generalized butterfly networks and their applications	2005-12-07	Paper
A NEW FAULT-TOLERANT ROUTING ALGORITHM FOR k-ARY n-CUBE NETWORKS	2005-09-27	Paper
Node-ranking schemes for the star networks.	2003-08-19	Paper
EFFICIENT ALGORITHMS ON THE HYPERSTAR NETWORK	2002-09-12	Paper
Comparative study of product networks	2002-07-04	Paper
Probability-based fault-tolerant routing in hypercubes	2002-02-27	Paper
On the performance of parallel matrix factorisation on the hypermesh	2001-10-14	Paper
Fault-tolerant routing in hypercubes using probability vectors	2001-08-20	Paper
UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS	2000-06-05	Paper
Block-cyclic matrix triangulation on the Cartesian product of star graphs	1999-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q3839529	1998-08-09	Paper
The hyperstar interconnection network	1998-06-08	Paper
Unidirectional star graphs	1993-05-16	Paper
Arrangement graphs: A class of generalized star graphs	1993-01-16	Paper

This page was built for person: K. Day