Authors: KALPAKIS K YESHA Y

Citation: K. Kalpakis et Y. Yesha, ON THE BISECTION WIDTH OF THE TRANSPOSITION NETWORK, Networks, 29(1), 1997, pp. 69-76

Authors: KALPAKIS K YESHA Y

Citation: K. Kalpakis et Y. Yesha, SCHEDULING TREE DAGS ON PARALLEL ARCHITECTURES, Algorithmica, 15(4), 1996, pp. 373-396

Authors: KALPAKIS K YESHA Y

Citation: K. Kalpakis et Y. Yesha, ON THE POWER OF THE LINEAR-ARRAY ARCHITECTURE FOR PERFORMING TREE-STRUCTURED COMPUTATIONS, Journal of computer and system sciences, 50(1), 1995, pp. 1-10

Authors: MENASCE DA YESHA Y KALPAKIS K

Citation: Da. Menasce et al., ON A UNIFIED FRAMEWORK FOR THE EVALUATION OF DISTRIBUTED QUORUM ATTAINMENT PROTOCOLS, IEEE transactions on software engineering, 20(11), 1994, pp. 868-884

Authors: KALPAKIS K SHERMAN AT

Citation: K. Kalpakis et At. Sherman, PROBABILISTIC ANALYSIS OF AN ENHANCED PARTITIONING ALGORITHM FOR THE STEINER TREE PROBLEM IN RD, Networks, 24(3), 1994, pp. 147-159