David E. Daykin

According to our database1, David E. Daykin authored at least 16 papers between 1974 and 2013.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
A linear partitioning algorithm for Hybrid Lyndons using <i>V</i>V-order.
Theor. Comput. Sci., 2013

Generic Algorithms for Factoring Strings.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2011
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2009
Combinatorics of Unique Maximal Factorization Families (UMFFs).
Fundam. Informaticae, 2009

2008
Properties and Construction of Unique Maximal Factorization Families for Strings.
Int. J. Found. Comput. Sci., 2008

2003
Lyndon-like and V-order factorizations of strings.
J. Discrete Algorithms, 2003

2001
On deleting coordinates from integer vectors.
Discret. Math., 2001

1994
The Dual of the Ahlswede - Zhang Identity.
J. Comb. Theory, Ser. A, 1994

1984
On log concavity for order-preserving maps of partial orders.
Discret. Math., 1984

1983
Some Remarks on Normalized Matching.
J. Comb. Theory, Ser. A, 1983

Pairings from Down-Sets and Up-Sets in Distributive Lattices.
J. Comb. Theory, Ser. A, 1983

1979
The Number of Meets between Two Subsets of a Lattice.
J. Comb. Theory, Ser. A, 1979

1976
Graphs with Hamiltonian cycles having adjacent lines different colors.
J. Comb. Theory, Ser. B, 1976

1974
Existence Theorems for Sperner Families.
J. Comb. Theory, Ser. A, 1974

Erdös-Ko-Rado from Kruskal-Katona.
J. Comb. Theory, Ser. A, 1974

A Simple Proof of the Kruskal-Katona Theorem.
J. Comb. Theory, Ser. A, 1974


  Loading...