AAAAAA

   
Results: 1-13 |
Results: 13
SPANNING SUBGRAPHS WITH APPLICATIONS TO COMMUNICATION ON A SUBCLASS OF THE CAYLEY-GRAPH-BASED NETWORKS
Authors: FRAGOPOULOU P AKL SG
Citation: P. Fragopoulou et Sg. Akl, SPANNING SUBGRAPHS WITH APPLICATIONS TO COMMUNICATION ON A SUBCLASS OF THE CAYLEY-GRAPH-BASED NETWORKS, Discrete applied mathematics, 83(1-3), 1998, pp. 79-96
EFFICIENT PARALLEL ALGORITHMS ON PROPER CIRCULAR-ARC GRAPHS
Authors: AKL SG CHEN L
Citation: Sg. Akl et L. Chen, EFFICIENT PARALLEL ALGORITHMS ON PROPER CIRCULAR-ARC GRAPHS, IEICE transactions on information and systems, E79D(8), 1996, pp. 1015-1020
OPTIMAL COMMUNICATION PRIMITIVES ON THE GENERALIZED HYPERCUBE NETWORK
Authors: FRAGOPOULOU P AKL SG MEIJER H
Citation: P. Fragopoulou et al., OPTIMAL COMMUNICATION PRIMITIVES ON THE GENERALIZED HYPERCUBE NETWORK, Journal of parallel and distributed computing, 32(2), 1996, pp. 173-187
SPANNING SUBGRAPHS WITH APPLICATIONS TO COMMUNICATION ON THE MULTIDIMENSIONAL TORUS NETWORK
Authors: FRAGOPOULOU P AKL SG
Citation: P. Fragopoulou et Sg. Akl, SPANNING SUBGRAPHS WITH APPLICATIONS TO COMMUNICATION ON THE MULTIDIMENSIONAL TORUS NETWORK, Parallel computing, 22(7), 1996, pp. 991-1015
EDGE-DISJOINT SPANNING-TREES ON THE STAR NETWORK WITH APPLICATIONS TOFAULT-TOLERANCE
Authors: FRAGOPOULOU P AKL SG
Citation: P. Fragopoulou et Sg. Akl, EDGE-DISJOINT SPANNING-TREES ON THE STAR NETWORK WITH APPLICATIONS TOFAULT-TOLERANCE, I.E.E.E. transactions on computers, 45(2), 1996, pp. 174-185
AREA-TIME TRADE-OFFS IN ARRAYS WITH OPTICAL PIPELINED BUSES
Authors: PAVEL S AKL SG
Citation: S. Pavel et Sg. Akl, AREA-TIME TRADE-OFFS IN ARRAYS WITH OPTICAL PIPELINED BUSES, Applied optics, 35(11), 1996, pp. 1827-1835
ON SOME PROPERTIES OF THE STAR GRAPH
Authors: QIU K AKL SG
Citation: K. Qiu et Sg. Akl, ON SOME PROPERTIES OF THE STAR GRAPH, VLSI design, 2(4), 1995, pp. 389-396
OPTIMAL COMMUNICATION ALGORITHMS ON STAR GRAPHS USING SPANNING TREE CONSTRUCTIONS
Authors: FRAGAPOULOU P AKL SG
Citation: P. Fragapoulou et Sg. Akl, OPTIMAL COMMUNICATION ALGORITHMS ON STAR GRAPHS USING SPANNING TREE CONSTRUCTIONS, Journal of parallel and distributed computing, 24(1), 1995, pp. 55-71
A PARALLEL ALGORITHM FOR COMPUTING FOURIER-TRANSFORMS ON THE STAR GRAPH
Authors: FRAGOPOULOU P AKL SG
Citation: P. Fragopoulou et Sg. Akl, A PARALLEL ALGORITHM FOR COMPUTING FOURIER-TRANSFORMS ON THE STAR GRAPH, IEEE transactions on parallel and distributed systems, 5(5), 1994, pp. 525-531
ON SOME PROPERTIES AND ALGORITHMS FOR THE STAR AND PANCAKE INTERCONNECTION NETWORKS
Authors: KE Q AKL SG MEIJER H
Citation: Q. Ke et al., ON SOME PROPERTIES AND ALGORITHMS FOR THE STAR AND PANCAKE INTERCONNECTION NETWORKS, Journal of parallel and distributed computing, 22(1), 1994, pp. 16-25
AN OPTIMAL SYSTOLIC ALGORITHM FOR GENERATING PERMUTATIONS IN LEXICOGRAPHIC ORDER
Authors: AKL SG MEIJER H STOJMENOVIC I
Citation: Sg. Akl et al., AN OPTIMAL SYSTOLIC ALGORITHM FOR GENERATING PERMUTATIONS IN LEXICOGRAPHIC ORDER, Journal of parallel and distributed computing, 20(1), 1994, pp. 84-91
AN OPTIMAL IMPLEMENTATION OF BROADCASTING WITH SELECTIVE REDUCTION
Authors: LINDON LF AKL SG
Citation: Lf. Lindon et Sg. Akl, AN OPTIMAL IMPLEMENTATION OF BROADCASTING WITH SELECTIVE REDUCTION, IEEE transactions on parallel and distributed systems, 4(3), 1993, pp. 256-269
FUNDAMENTAL ALGORITHMS FOR THE STAR AND PANCAKE INTERCONNECTION NETWORKS WITH APPLICATIONS TO COMPUTATIONAL GEOMETRY
Authors: AKL SG QIU K STOJMENOVIC I
Citation: Sg. Akl et al., FUNDAMENTAL ALGORITHMS FOR THE STAR AND PANCAKE INTERCONNECTION NETWORKS WITH APPLICATIONS TO COMPUTATIONAL GEOMETRY, Networks, 23(4), 1993, pp. 215-225
Risultati: 1-13 |