Sparse communication networks and efficient routing in the plane (extended abstract). - Yehuda Hassin; David Peleg (PODC, 2000)

Extremal bounds for probabilistic polling in graphs. - Yehuda Hassin; David Peleg (SIROCCO, 2000)

Sparse communication networks and efficient routing in the plane. - Yehuda Hassin; David Peleg (Distributed Comput., 2001)

Distributed Probabilistic Polling and Applications to Proportionate Agreement. - Yehuda Hassin; David Peleg (Inf. Comput., 2001)

Average probe complexity in quorum systems. - Yehuda Hassin; David Peleg (J. Comput. Syst. Sci., 2006)

Collective Reuse of Software Components Speeds-Up Reliability. - Iaakov Exman; Guy Zohar; Yehuda Hassin (ICSR, 2008)