Shay Solomon
- Y. Dinitz
and S. Solomon,
Optimality of an Algorithm Solving the
Bottleneck Tower of Hanoi Problem , ACM
Transactions on Algorithms 4(3) (2008), Article 25.
- D. Azriel,
N. Solomon
and S. Solomon,
On an Infinite Family of
Solvable
Hanoi Graphs.
ACM Transactions on Algorithms 5(1) (2008), Article 13.
-
N. Solomon
and S. Solomon,
A Natural
Extension of
Catalan Numbers, Journal of Integer Sequences 11
(2008), Article 08.3.5.
-
Y. Dinitz
, M. Elkin
and S. Solomon,
Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners.
Accepted to Discrete & Computational Geometry (2009). (Invited
paper.)
-
M. Elkin
and S. Solomon,
Narrow-Shallow-Low-Light Trees with and without Steiner points.
Submitted to SIAM Journal on Discrete Mathematics (2009).
- Y. Dinitz
and S. Solomon,
Optimal Algorithms for Tower of Hanoi Problems
with Relaxed Placement Rules. In Proc.
of the 17th Symposium on Algorithms and
Computation,
ISAAC'06, 36-47.
- Y. Dinitz
and S. Solomon,
On Optimal Solutions for the Bottleneck
Tower of Hanoi Problem . In Proc. of the 33rd
International Conference on Current Trends in Theory and Practice of
Computer Science, SOFSEM'07, 248--259.
- Y. Dinitz, M. Elkin
and S. Solomon,
Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
. In Proc. of the 49th
IEEE Symposium on Foundations of Computer Science, FOCS'08,
519--528.
- M. Elkin
and S. Solomon,
Narrow-Shallow-Low-Light Trees with and without Steiner points
. In Proc. of the
17th
Annual European Symposium on Algorithms, ESA'09, 215--226.
- D. Berend, A. Sapir
and S. Solomon,
The Tower of Hanoi Problem on Pathh Graphs.
- Y. Dinitz
and S. Solomon,
On the Configuration Graph of the Bottleneck Tower of Hanoi
Problem.
- S. Solomon
and M. Elkin,
Balancing Degree, Diameter and Weight in Euclidean Spanners.
- N. Solomon and S. Solomon,
On the k-Relaxed Sierpinski Gasket.
- S. Solomon,
An Optimal Time Construction of Euclidean Sparse Spanners with Small (at
most α(n))
Diameter.
Email me