Membership in Professional Organizations
Journals and Conferences
Talks
I was honoured to be invited to present these short talks, seminars or papers at the following events:
"Rudolf Ahlswede in the seventies: R. Ahlwede's cooperation with David Daykin" Memorial Symposium for Rudolph Ahlswede, the Zif, Bielefeld
University, July 2011 - in loving memory.
"String comparison and Lyndon-like factorization using V-order in linear time" CPM 2011, Palermo, June 2011.
"Combinatorics of unique maximal factorization families" Reading
University Old Codger's One-Day Combinatorics Colloquium, November 2010- love you dad!
"Combinatorics and algorithmics of UMFFs" Department of Computer
Science, Royal Holloway College, December 2010.
"String factorization algorithmics"Combinatorics Colloquia, May 2007.
"String factorization algorithmics"Prague Stringology Club, December 2006.
"Applications of temporal reasoning and string factorization to diagramatic reasoning"School of Computing and Mathematical Sciences, University of
Brighton, June 2002.
"Combinatorial topics on partial orders" Department of Computer
Science, Indiana University - Purdue University at Indianapolis, May 1986.
"The FKG inequality and correlation in partially ordered sets" Department
of Computer Science, Warwick University, March 1983.
Editorial works
J. W. Daykin, W. F. Smyth and L. van Zijl (Editors),
StringMasters 2009 & 2010 Special Issue of the Journal of Discrete Algorithms (2011)
DOI: 10.1016/j.jda.2011.08.004.
J. Chan, J. W. Daykin and M. S. Rahman (Editors),
London Algorithmics 2008: Theory and Practice, King's College Publications,
Texts in Algorithms, Vol. 11 (2009), ISBN 978-1-904987-97-0.
J. W. Daykin, M. Mohammed, K. Steinhofel (Editors),
London Algorithmics and Stringology 2006, King's College Publications,
Texts in Algorithms, Vol. 8 (2007), ISBN 978-1-904987-41-3.
Grants
Various research grants are gratefully acknowledged:
Teaching
King's College 2008/10:
CSMGAA/6CCS3GAA/7CCSMGAA: Geometric Algorithms with Applications
Royal Holloway 2006-11:
CS2844: Computer Graphics
Third Year Projects Committee
(Member)
Previous teaching:
Foundations of Computer Science (BSc)
Logical Foundations of Computer Science and Artificial Intelligence (BSc)
Web and Internet Technologies (BSc)
Graphics & HCI (BSc)
Algorithm Design and Data Structures with Pascal (BSc)
Introduction to Computer Science with Pascal (BSc)
Complexity of Algorithms (BSc)
Algorithmic Issues in the WWW (MSc)
Forthcoming publications
Maxime Crochemore and Jacqueline W. Daykin (Editors),
StringMasters 2011 Special Issue of the Journal of Discrete Algorithms (2012).
D. E. Daykin, J. W. Daykin, C. S. Iliopoulos and W. F. Smyth,
Generic Algorithms for Factoring Strings, in preparation.
J. W. Daykin, T. Gagie, J. Karkkainen, J. Siren and W. F. Smyth, Computing the
Burrows-Wheeler Transform using V-order, in preparation.
Selected publications (incomplete ... I am a work in progress!)
D. E. Daykin, J. W. Daykin, and W. F. Smyth, A linear partitioning algorithm for
Hybrid Lyndons using V-order, to appear in Theoretical Computer Science.
Pavlos Antoniou, Jackie W. Daykin, Costas S. Iliopoulos, Derrick Kourie, Laurent Mouchard and Solon P. Pissis,
Mapping uniquely occurring short sequences derived from high throughput
technologies to a reference genome, In Proceedings of the 9th International Conference on Information
Technology and Applications in Biomedicine (ITAB 2009), 2009. IEEE Xplore.
D. E. Daykin and J. W. Daykin, Order
preserving maps and linear extensions of a finite poset,
SIAM Journal on Algebraic and Discrete Methods 6 (1985) 738-748.
Here's
a link to dblp.
PhD Thesis (1986)
Monotonic functions of finite posets, Warwick University, U.K.
Erdos number
From time to time it is a surprise when someone approaches me to say with interest that my Erdos number is 2! This is indeed the case, but let me explain that this elated number is simply due to publishing with my father, David Daykin, who published jointly with Paul Erdos. Think of me as a chipette off the old block!
Experience
Education
Real education ...?!