#### Filter Results:

- Full text PDF available (60)

#### Publication Year

1984

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
- Random Struct. Algorithms
- 1999

A phylogenetic tree, also called an ''evolutionary tree,'' is a leaf-labeled tree which represents the evolutionary history for a set of species, and the construction of such trees is a fundamental problem in biology. Here we address the issue of how many sequence sites are required in order to recover the tree with high probability when the sites evolve… (More)

- Mike A. Steel, László A. Székely
- SIAM J. Discrete Math.
- 2002

In this paper we study inverting random functions under the maximum likelihood estimation (MLE) criterion in the discrete setting. In particular, we consider how many independent evaluations of the random function at a particular element of the domain are needed for reliable reconstruction of that element. We provide explicit upper and lower bounds for MLE,… (More)

- László A. Székely
- Discrete Mathematics
- 2000

- Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
- Theor. Comput. Sci.
- 1999

- Péter L. Erdös, Mike A. Steel, László A. Székely, Tandy J. Warnow
- ICALP
- 1997

The construction of evolutionary trees is a fundamental problem in biology, and yet methods for reconstructing evolutionary trees are not reliable when it comes to inferring accurate topologies of large divergent evolutionary trees from realistic length sequences. We address this problem and present a new polynomial time algorithm for reconstructing… (More)

- Péter L. Erdös, László A. Székely
- Math. Program.
- 1994

- Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto
- SIAM J. Comput.
- 2000

The bipartite crossing number problem is studied and a connection between this problem and the linear arrangement problem is established. A lower bound and an upper bound for the optimal number of crossings are derived, where the main terms are the optimal arrangement values. Two polynomial time approximation algorithms for the bipartite crossing number are… (More)

- László A. Székely
- Combinatorics, Probability & Computing
- 1997

We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds in discrete plane geometry which were considered hard before: the number of incidences among points and lines, the maximum number of unit distances among n points, the minimum number of distinct distances among n points. " A… (More)

- Linyuan Lu, László A. Székely
- Electr. J. Comb.
- 2007

The Lovász Local Lemma is known to have an extension for cases where independence is missing but negative dependencies are under control. We show that this is often the case for random injections, and we provide easy-to-check conditions for the non-trivial task of verifying a negative dependency graph for random injections. As an application, we prove… (More)

- Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, László A. Székely, Lutz Volkmann
- Discrete Applied Mathematics
- 2002

The Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. In this paper, we characterize the trees which minimize the Wiener index among all trees of given order and maximum degree and the trees which maximize the Wiener index among all trees of given order that have only vertices of two diierent degrees. ? 2002 Elsevier… (More)