Eilon Reshef

Approximating Minimum Communication Cost Spanning Trees and Related Problems

Eilon Reshef, 1999 .

A Variant of the Arrow Distributed Directory with Low Average Complexity

David Peleg, Eilon Reshef, 1999, ICALP.

Low Complexity Variants of the Arrow Distributed Directory

David Peleg, Eilon Reshef, 2001, J. Comput. Syst. Sci..

Deterministic Polylog Approximation for Minimum Communication Spanning Trees

David Peleg, Eilon Reshef, 1998, ICALP.