AAAAAA
Results:
1-9
|
Results: 9
Authors:
AMOURA AK
BAMPIS E
KONIG JC
Citation: Ak. Amoura et al., SCHEDULING ALGORITHMS FOR PARALLEL GAUSSIAN-ELIMINATION WITH COMMUNICATION COSTS, IEEE transactions on parallel and distributed systems, 9(7), 1998, pp. 679-686
Authors:
BAMPIS E
DELORME C
KONIG JC
Citation: E. Bampis et al., OPTIMAL SCHEDULES FOR D-D GRID GRAPHS WITH COMMUNICATION DELAYS, Parallel computing, 24(11), 1998, pp. 1653-1664
Authors:
BAMPIS E
GUINAND F
TRYSTRAM D
Citation: E. Bampis et al., SOME MODELS FOR SCHEDULING PARALLEL PROGRAMS WITH COMMUNICATION DELAYS, Discrete applied mathematics, 72(1-2), 1997, pp. 5-24
Authors:
BAMPIS E
KONIG JC
TRYSTRAM D
Citation: E. Bampis et al., MINIMIZING THE SCHEDULE LENGTH FOR A PARALLEL 3D-GRID PRECEDENCE GRAPH, European journal of operational research, 95(2), 1996, pp. 427-438
Authors:
BAMPIS E
GIANNAKOS A
KONIG JC
Citation: E. Bampis et al., ON THE COMPLEXITY OF SCHEDULING WITH LARGE COMMUNICATION DELAYS, European journal of operational research, 94(2), 1996, pp. 252-260
Authors:
BAMPIS E
GUINAND F
TRYSTRAM D
Citation: E. Bampis et al., MINIMIZING THE OVERHEAD FOR SOME TREE-SCHEDULING PROBLEMS, European journal of operational research, 94(2), 1996, pp. 261-270
Authors:
FINTA L
LIU Z
MILIS I
BAMPIS E
Citation: L. Finta et al., SCHEDULING UET-UCT SERIES-PARALLEL GRAPHS ON 2 PROCESSORS, Theoretical computer science, 162(2), 1996, pp. 323-340
Authors:
BAMPIS E
KONIG JC
TRYSTRAM D
Citation: E. Bampis et al., OPTIMAL PARALLEL EXECUTION OF COMPLETE BINARY-TREES AND GRIDS INTO MOST POPULAR INTERCONNECTION NETWORKS, Theoretical computer science, 147(1-2), 1995, pp. 1-18
Authors:
BAMPIS E
ELHADDAD M
MANOUSSAKIS Y
SANTHA M
Citation: E. Bampis et al., A PARALLEL REDUCTION OF HAMILTONIAN CYCLE TO HAMILTONIAN PATH IN TOURNAMENTS, Journal of algorithms, 19(3), 1995, pp. 432-440
Risultati:
1-9
|