Search the dblp DataBase

Publications of Author

1. Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow
   A few logs suffice to build (almost) all trees (I). [Citation Graph (0, 0)][DBLP]
   Random Struct. Algorithms, 1999, v:14, n:2, pp:153-184 [Journal]
   
2. Hans-Jürgen Bandelt, Michael Anthony Steel
   Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1995, v:8, n:4, pp:517-525 [Journal]
   
3. A. M. Hamel, Michael Anthony Steel
   The Length of a Leaf Coloration on a Random Binary Tree. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1997, v:10, n:3, pp:359-372 [Journal]
   
4. Katharina T. Huber, Vincent Moulton, Michael Anthony Steel
   Four Characters Suffice to Convexly Define a Phylogenetic Tree. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2005, v:18, n:4, pp:835-843 [Journal]
   
5. Michael Anthony Steel
   Distribution of the Symmetric Difference Metric on Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 1988, v:1, n:4, pp:541-551 [Journal]
   
6. Michael Anthony Steel, László A. Székely
   Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Discrete Math., 2002, v:15, n:4, pp:562-575 [Journal]
   
7. Péter L. Erdös, Michael Anthony Steel, László A. Székely, Tandy Warnow
   A Few Logs Suffice to Build (almost) All Trees: Part II. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1999, v:221, n:1-2, pp:77-118 [Journal]