
Search the dblp DataBase
Michael Anthony Steel:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 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:153184 [Journal]
 HansJü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:517525 [Journal]
 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:359372 [Journal]
 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:835843 [Journal]
 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:541551 [Journal]
 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:562575 [Journal]
 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:12, pp:77118 [Journal]
Search in 0.002secs, Finished in 0.002secs
