| 2008 |
|---|
| 6 | EE | Yefim Dinitz,
Michael Elkin,
Shay Solomon:
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
FOCS 2008: 519-528 |
| 5 | EE | Yefim Dinitz,
Shay Solomon:
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem.
ACM Transactions on Algorithms 4(3): (2008) |
| 4 | EE | Dany Azriel,
Noam Solomon,
Shay Solomon:
On an infinite family of solvable Hanoi graphs.
ACM Transactions on Algorithms 5(1): (2008) |
| 3 | EE | Yefim Dinitz,
Michael Elkin,
Shay Solomon:
Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners
CoRR abs/0801.3581: (2008) |
| 2007 |
|---|
| 2 | EE | Yefim Dinitz,
Shay Solomon:
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem.
SOFSEM (1) 2007: 248-259 |
| 2006 |
|---|
| 1 | EE | Yefim Dinitz,
Shay Solomon:
Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules.
ISAAC 2006: 36-47 |
