talks, seminars & presentations

• Suffolk place-names - with an emphasis on Scandinavian elements Copenhagen 2016-09-09
• A dictionary of Suffolk place-names was launched at the Wheeler conference in Stowupland on 2016-04-23
• SON for femtocells. King's College London 2015-12-02
• The mathematics of wireless networks: research at BT. Oxford maths DTC 2014-11-25
• The mathematics of spectrum allocation. IMA Festival of Mathematics, Manchester 2014-07-04
• Computational aspects of simultaneous Diophantine approximation. CCA2014, Darmstadt 2014-07-23
• Enhanced algorithms for TV whitespace power maximization. EuCAP2014, The Hague 2014-04-11
• Computational aspects of simultaneous Diophantine approximation. MIMO workshop, York 2014-04-20
• Automated extraction and processing of historical name-forms for onomastic publications Integration of onomastic data into geo-spatial infrastructures, Tallinn 2013-09-18
• Computational aspects of simultaneous Diophantine approximation York 2013-01-22
• Mathematical network research at BT Innovate & Design: an overview. TU Eindhoven 2012-11-05
• Industrial mathematics as a career. Warwick University, Centre for Complexity Science 2011-12-13
• Power and place-names: did early English rulers use Roman-style province names? Nov 11. Power and place in Later Roman and early medieval Europe at UCL. slides with pauses | slides without pauses
• Place-names and landscape: recent research. Cambridge 2011-01-26 Why are so many East Anglian fields called Harrow? pdf slides
• Imperial College, Institute for Mathematical Sciences complexity seminar: Optimal trip-planning in transport systems with random delays, 2010-11-23 pdf slides
• Asychronous distributed graph coloring. Sheffield, Amorph workshop 2010-08-19
• Perceptions of Place 2010 Jun 23-27. my slides
• Optimal trip planning in transport systems with random delays. MoN9, St Andrews 2010-06-18
• Optimal trip planning in transport systems with random delays seminar OU maths, 2010-05-25
• Optimal trip planning in transport systems with random delays. Birmingham maths seminar 2010 Mar 11
• Seven wells UWE linguistics seminar 2010 Mar 10
• MSc projects 2010, University of York, 2009 Feb 17
• MSc projects 2010, University of Bath, 2009 Feb 10
• NET2009 Optimal railway-trip planning 2009 Sep 30 pdf slides
• Trip-planning in transport networks with stochastic delays, BICS Industrial Complexity Forum 2009 Jul 10 pdf slides
• Optimal channel allocation for wireless cities, VTC09 Spring conference Barcelona. 2009 Apr 28. pdf slides
• MSc projects 2009, University of York, 2009 Feb 11
• Modelling train delays, CICADA Industrial Workshop, University of Manchester, 2009 Feb 10
• Graph models of wireless networks, University of Essex, 2009 Feb 05 14:00
• Anglo-Saxon communication networks WIDOH, Adastral Park 2008 Dec 01
• 2009 MSc projects at BT, University of Bath, 2008 Nov 26
• The maths of train delays WIDOH, Adastral Park 2008 Nov 11
• Freemantle, SNSBI conference, University of Chichester, 2008 Oct 25
• Simultaneous channel and power optimization for planning wireless cities BT-UCL@AP joint meeting, 2008 Sep 23
• Graph models of wireless networks NET-ACE meeting, Brunel University 2008 Sep 19
• Geometric random graphs, University of Sheffield 2008 Sep 09
• Complexity of wireless data networks BICS, University of Bath, 2008 Mar 19
• Access point load balancing using generalized Voronoi diagrams CRG 2007 Oct 24
• Reliable real arithmetic and one-dimensional dynamical systems QMUL 2007 Mar 27
• MSc projects at BT University of York 2007 Jan 31
• Some graph theory applications to communications networks University of Sheffield 2006 Nov 02
• Some hard graph problems in telecoms University of Warwick Complexity Forum 2006 Oct 31
• BICS seminar pdf slides University of Bath 2006 Jun 12
• The work of George Szekeres on functional equations QMUL 2006 Jan 10
• Exponential random graphs Mathematical & Psychological Sciences, Unilever Corporate Research, Sharnbrook, 2005 Nov 22
• Exponential random graphs MoN4, QMUL 2005 Jul 22
• Enumeration of labelled graphs LSE 2005 Apr 28
• The Riemann hypothesis and abundant numbers University of York 2005 Mar 01
• BT Research & Mixing time University of York 2005 Feb 28
• Optimization MRC meeting 2005 Feb 17
• Bayesian processing of multilingual documents Cavendish Lab 2005 Feb 15
• Planar graphs CRG 2005 Feb 07
• Exponential random graphs CRG 2005 Feb 07
• Bayesian text processing CRG 2005 Jan 24
• Some experimental approaches to Diophantine approximation problems QMUL seminar 2005 Jan 11
• Mathematics of Networks 3rd Meeting, Imperial College 2004 Dec 20
• Mixing time of random walks on networks PICT seminar, BT 2004 Dec 16
• Maximum entropy traffic matrix estimation CRG meeting, BT 2004 Dec 03
• Mixing time of random walks on networks CRG meeting, BT 2004 Nov 29
• Connectivity of random graphs University of Manchester 2004 Nov 19
• Connectivity of random graphs Complex Adaptive Systems Group Seminar, Oxford 2004 Oct 12
• Wireless traffic models, Porto 2004 Sep 16
• Probability of connectedness of labelled graphs BT CRG 2004 Sep 06
• Delayed iteration BT CRG 2004 Jul 05
• Combinatorial graph theory and connectivity Maths of Networks, 2004 Jul 02
• Some issues in mathematical computing BT Exact 2004 Jun 25
• Optimization for power control BT Exact 2004 Jun 03
• Bayesian spam filtering BT Exact PICT seminar 2004 Apr 29
• Traffic models for new wireless services Eurescom, Heidelberg, 2004 Mar 30
• Exact real arithmetic University of Kent, 2004 Feb 10
• Combinatorial graph theory BT Exact 2004 Jan 19
• Statistics of continued fractions York winter dynamics day, 2003 Dec 19
• Asynchronous distributed algorithms Bristol Uni Engineering Maths Dept 2003 Dec 02
• DCCP BT Exact 2003 Nov 17
• TeraLab Open Day 2003
• EPSRC Novel computation meeting, Bristol University 2003 Sep 26
• Discrete Green's function on graphs BT Exact CRG 2003 Sep 23
• How to count without counting BT Exact Tempura 2003 Sep 04
• Modelling internet round-trip time data University of York 2003 Jul 18
• Graph eigenvalues and connectivity BT Exact 2003 Jul 07
• The Durand-Flajolet algorithm BT Exact 2003 Jun 09
• Connectivity of nodes TeraTalk, BT Exact 2003 May 15
• Valiant's theory of the learnable BTexact 2003 Apr 14
• Exact real arithmetic Oxford University, Computer Lab 2003 Mar 06
• Distributed algorithms BTexact 2002 Oct 22
• Exact real arithmetic Cambridge University, Cavendish Lab, 2002 Nov 20
• Modelling TCP with Markov chains Budapest Technical University 2002 Jun 17
• Simultaneous Diophantine approximation and linearization of C^2 maps Manchester 2000 Nov 30