 | 2012 |
|---|
| 8 |       | Jacqueline W. Daykin,
Bill Smyth,
Lynette van Zijl:
Editorial.
J. Discrete Algorithms 10: 1 (2012) |
| 2011 |
|---|
| 7 | | David E. Daykin,
Jacqueline W. Daykin,
William F. Smyth:
String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time.
CPM 2011: 65-76 |
| 2009 |
|---|
| 6 | | David E. Daykin,
Jacqueline W. Daykin,
William F. Smyth:
Combinatorics of Unique Maximal Factorization Families (UMFFs).
Fundam. Inform. 97(3): 295-309 (2009) |
| 2008 |
|---|
| 5 | | David E. Daykin,
Jacqueline W. Daykin:
Properties and Construction of Unique Maximal Factorization Families for Strings.
Int. J. Found. Comput. Sci. 19(4): 1073-1084 (2008) |
| 2003 |
|---|
| 4 | | David E. Daykin,
Jacqueline W. Daykin:
Lyndon-like and V-order factorizations of strings.
J. Discrete Algorithms 1(3-4): 357-365 (2003) |
| 1994 |
|---|
| 3 | | Jacqueline W. Daykin,
Costas S. Iliopoulos,
William F. Smyth:
Parallel RAM Algorithms for Factorizing Words.
Theor. Comput. Sci. 127(1): 53-67 (1994) |
| 1986 |
|---|
| 2 | | Jacqueline W. Daykin:
Inequalities for the number of monotonic functions of partial orders.
Discrete Mathematics 61(1): 41-55 (1986) |
| 1984 |
|---|
| 1 | | David E. Daykin,
Jacqueline W. Daykin,
Michael S. Paterson:
On log concavity for order-preserving maps of partial orders.
Discrete Mathematics 50: 221-226 (1984) |
Data released under the ODC-BY 1.0 license — See also our legal information page