| |
| 2008 | ||
|---|---|---|
| 3 | EE | Dany Azriel, Noam Solomon, Shay Solomon: On an infinite family of solvable Hanoi graphs. ACM Transactions on Algorithms 5(1): (2008) |
| 2007 | ||
| 2 | EE | Yefim Dinitz, Noam Solomon: Two absolute bounds for distributed bit complexity. Theor. Comput. Sci. 384(2-3): 168-183 (2007) |
| 2005 | ||
| 1 | EE | Yefim Dinitz, Noam Solomon: Two Absolute Bounds for Distributed Bit Complexity. SIROCCO 2005: 115-126 |
| 1 | Dany Azriel | [3] |
| 2 | Yefim Dinitz | [1] [2] |
| 3 | Shay Solomon | [3] |