| |
| 2006 | ||
|---|---|---|
| 7 | EE | Yehuda Hassin, David Peleg: Average probe complexity in quorum systems. J. Comput. Syst. Sci. 72(4): 592-616 (2006) |
| 2001 | ||
| 6 | EE | Yehuda Hassin, David Peleg: Average probe complexity in quorum systems. PODC 2001: 180-189 |
| 5 | EE | Yehuda Hassin, David Peleg: Sparse communication networks and efficient routing in the plane. Distributed Computing 14(4): 205-215 (2001) |
| 4 | EE | Yehuda Hassin, David Peleg: Distributed Probabilistic Polling and Applications to Proportionate Agreement. Inf. Comput. 171(2): 248-268 (2001) |
| 2000 | ||
| 3 | EE | Yehuda Hassin, David Peleg: Sparse communication networks and efficient routing in the plane (extended abstract). PODC 2000: 41-50 |
| 2 | Yehuda Hassin, David Peleg: Extremal bounds for probabilistic polling in graphs. SIROCCO 2000: 167-180 | |
| 1999 | ||
| 1 | EE | Yehuda Hassin, David Peleg: Distributed Probabilistic Polling and Applications to Proportionate Agreement. ICALP 1999: 402-411 |
| 1 | David Peleg | [1] [2] [3] [4] [5] [6] [7] |