Authors: BRODER AZ MAYR EW

Citation: Az. Broder et Ew. Mayr, COUNTING MINIMUM WEIGHT SPANNING-TREES, Journal of algorithms, 24(1), 1997, pp. 171-176

Authors: MAYR EW WERCHNER R

Citation: Ew. Mayr et R. Werchner, OPTIMAL TREE CONTRACTION AND TERM MATCHING ON THE HYPERCUBE AND RELATED NETWORKS, Algorithmica, 18(3), 1997, pp. 445-460

Authors: MAYR EW WERCHNER R

Citation: Ew. Mayr et R. Werchner, DIVIDE-AND-CONQUER ALGORITHMS ON THE HYPERCUBE, Theoretical computer science, 162(2), 1996, pp. 283-296

Authors: HEUN V MAYR EW

Citation: V. Heun et Ew. Mayr, A NEW EFFICIENT ALGORITHM FOR EMBEDDING AN ARBITRARY BINARY-TREE INTOITS OPTIMAL HYPERCUBE, Journal of algorithms, 20(2), 1996, pp. 375-399

Authors: MAYR EW WERCHNER R

Citation: Ew. Mayr et R. Werchner, OPTIMAL ROUTING OF PARENTHESES ON THE HYPERCUBE, Journal of parallel and distributed computing, 26(2), 1995, pp. 181-192

Authors: ENJALBERT P MAYR EW WAGNER KW

Citation: P. Enjalbert et al., SELECTED PAPERS OF THE 11TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER-SCIENCE (STACS-94), CAEN, FRANCE, 24-26 FEBRUARY 1994, Theoretical computer science, 148(2), 1995, pp. 181-181