William H. E. Day

From MaRDI portal
Revision as of 20:50, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:585630

Available identifiers

zbMath Open day.william-h-eMaRDI QIDQ585630

List of research outcomes

PublicationDate of PublicationType
Axiomatic Consensus Theory in Group Choice and Biomathematics2004-01-12Paper
Strategy-proof consensus rules for committee elections.2003-10-15Paper
https://portal.mardi4nfdi.de/entity/Q44224882003-01-01Paper
Attainable results in committee elections.2002-05-05Paper
A characterization of a family of consensus rules for committee elections2001-08-07Paper
Consensus rules for committee elections2000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q43950001998-11-10Paper
https://portal.mardi4nfdi.de/entity/Q43734791998-01-21Paper
The asymptotic plurality rule for molecular sequences1996-07-15Paper
On the consistency of the plurality rule consensus function for molecular sequences1995-02-22Paper
The computation of consensus patterns in \(DNA\) sequences1994-12-04Paper
Interpreting consensus sequences based on plurality rule1993-04-01Paper
Consensus sequences based on plurality rule1993-01-16Paper
Computational complexity of inferring phylogenies from dissimilarity matrices1987-01-01Paper
A model in partial orders for comparing objects by dualistic measures1986-01-01Paper
Axioms for consensus functions based on lower bounds in posets1986-01-01Paper
The computational complexity of inferring rooted phylogenies by parsimony1986-01-01Paper
A formalization of consensus index methods1985-01-01Paper
Optimal algorithms for comparing trees with labeled leaves1985-01-01Paper
Properties of Levenshtein metrics on sequences1984-01-01Paper
A computationally efficient approximation to the nearest neighbor interchange metric1984-01-01Paper
Efficient algorithms for agglomerative hierarchical clustering methods1984-01-01Paper
Extremes in the Complexity of Computing Metric Distances Between Partitions1984-01-01Paper
The role of complexity in comparing classifications1983-01-01Paper
Approximating minimum-length-sequence metrics: A cautionary note1983-01-01Paper
The complexity of computing metric distances between partitions1981-01-01Paper
Classification and specification of flat cluster methods1978-01-01Paper
Validity of clusters formed by graph-theoretic cluster methods1977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: William H. E. Day