Ed Blakey
ed.blakey@queens.oxon.org
http://www.maths.bris.ac.uk/~maewb/index.html
   Home     Publications     Curriculum Vitae     Contact   

Work-related information — Ed Blakey

   Popular downloads:   CVPDF: 118kb, 5pp.   Doctoral thesisPDF: 2163kb, 210pp.
Upcoming… • Journal issue (guest editor): Information and Computation (ISR special issue) • Conference (invited speaker): Physics and Computation 2012 • Conference (speaker): Developments in Computational Models 2012 • Journal paper in preparation: Complexity-Style Resources in Cryptography • Conference paper in preparation: Ray Tracing—Computing the Uncomputable? • Conference paper in preparation: Cellular Automata get their Wires Crossed

Dr Blakey is a postdoctoral researcher in Bristol University’s Quantum Computation and Information group, and a member of the School of Mathematics; his position is funded by the Leverhulme Trust. His chief research interest is computational complexity, specifically as pertaining to unconventional (especially quantum) computers. His publications, academic theses, etc. are available here.

From 2006 to 2011, he studied at Oxford for the degree of Doctor of Philosophy in Computer Science, submitting his doctoral thesis on 7.x.2010 and passing his viva-voce examination on 24.i.2011; he was supervised by Bob Coecke and Joël Ouaknine (which places him here in the Maths Genealogy Project).

His contact details are available here, and his CV here (and, in downloadable form, here).

(Hover over links for full titles)

Publication overview
(full details here)

Journal papers (7):   • Resources in Cryptography† • A New Gap Theorem • Apples & Oranges?* • Unconventional Complexity Measures* • Beyond Blum • Complexity in Non-Turing Models • Factorizing RSA Keys
Conference papers (6):   • Cellular Automata get their Wires Crossed† • Ray Tracing—Computing the Uncomputable?† • Apples and Oranges?* • Complexity in Non-Turing Models • Factorizing RSA Keys • Complexity of Physical Computers
Conference slides (10):   • The Cost of Non-Standard Computation* • Turing and Non-Turing Computers* • Resources in Cryptography • Quantum Computation and Cryptography* • A New Gap Theorem • Apples and Oranges? • What is a Resource? • Complexity in Non-Turing Models • Factorizing RSA Keys • Complexity of Physical Computers
Conference video (1):   • Complexity in Non-Turing Models
Research reports (2):   • Dominance • Analogue Factorization
Academic dissertations (3):   • DPhil thesis • MSc dissertation • BA extended essay
Patent (1):   • Integer-Solution System
*invited paper
†in preparation

(Hover over abbreviations for explanation)

Short biography
(full CV here)

i.2012 – pres.  
Postdoctoral research associate Quantum Computation and Information group, School of Mathematics, Bristol
Position funded by the Leverhulme Trust
iv – xii.2011  
Postdoctoral research assistant Computer Science department, Oxford
Researcher for EPSRC grant Complexity and Decidability in Unconventional Computational Models
2006 – 2011  
DPhil, Computer Science Queen’s College, Oxford
Thesis submitted 7.x.2010; viva passed 24.i.2011
Research area: computational complexity in non-standard models of computation
2002 – 2006  
Software/hardware/firmware engineer IBM, Hursley
Published technical articles; filed a US patent (as sole inventor)
2001 – 2002  
MSc, MFoCS Queen’s College, Oxford
Distinction (one of only three distinctions university-wide)
1998 – 2001  
BA, Mathematical Sciences Queen’s College, Oxford
First Class Honours
Top in year (uni-wide) for FP&AD course
Twice awarded the Styring Exhibition
1992 – 1998  
A level, AS, GCSE Myton School, Warwick
A level: Maths A, further maths A, gen. studies A, physics B, computing B
AS level: Maths A
GCSE: 5 × A* (including maths, science, English), 1 × A, 3 × B
GCSE maths (A*) obtained at age 14, AS pure maths (A) at 16
Attended 1996 BMO National Maths Summer School

Research interests

This word cloud was generated (by Wordle) from the abstracts of Dr Blakey’s publications.

This page last updated on 15.v.2012.
Other pages updated on 15.v.2012 (Publications), 15.v.2012 (CV) and 4.i.2012 (Contact).