Shay Solomon Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Elkin, Shay Solomon: Narrow-Shallow-Low-Light Trees with and without Steiner Points. ESA 2009: 215-226
2008
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Michael Elkin, Shay Solomon: Shallow-Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners. FOCS 2008: 519-528
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Shay Solomon: Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem. ACM Transactions on Algorithms 4(3): (2008)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDany Azriel, Noam Solomon, Shay Solomon: On an infinite family of solvable Hanoi graphs. ACM Transactions on Algorithms 5(1): (2008)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Michael Elkin, Shay Solomon: Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners CoRR abs/0801.3581: (2008)
2007
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Shay Solomon: On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259
2006
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYefim Dinitz, Shay Solomon: Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules. ISAAC 2006: 36-47

Coauthor Index

1Dany Azriel [4]
2Yefim Dinitz [1] [2] [3] [5] [6]
3Michael Elkin [3] [6] [7]
4Noam Solomon [4]

Copyright © Mon Nov 16 17:22:42 2009 by Michael Ley (ley@uni-trier.de)