Ed Blakey (ed.blakey@queens.oxon.org)
School of Mathematics
University of Bristol
University Walk
Bristol BS8 1TW
United Kingdom
   Home     Publications     Curriculum Vitae ()   

Work-related information — Ed Blakey

   Popular downloads:   CV   Doctoral thesis

Dr Ed 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 European Commission.

His chief research interest is computational complexity, specifically as pertaining to unconventional computers. He is also researching combinatorics (specifically, certain number-theoretic aspects of graph colourings), and links between algorithms and biological sciences.

Many of his publications, academic theses, etc. are available here. His CV is available here (and, in printable form, here).

Dr Blakey can be contacted at ed.blakey@queens.oxon.org.


Short CV (full CV here)

Education

  • DPhil (PhD equivalent) in Computer Science (Oxford, 2006 – 2011)
  • MSc in Maths & Computer Science, Distinction (Oxford, 2001 – 2002)
  • BA in Maths, First Class Honours (Oxford, 1998 – 2001)

Employment

  • Postdoctoral research associate (Bristol, Jan 2012 – present), funded by the Leverhulme Trust and European Commission
  • Postgraduate/postdoctoral researcher (Oxford, Oct 2008 – Dec 2011), funded by an EPSRC grant based on his doctoral project
  • Software/firmware/hardware engineer (IBM, Oct 2002 – Sep 2006)

Editorial

Invited talks

  • Generalizing Complexity Theory (Darmstadt, Germany, Oct 2012)
  • Generalizing Complexity Theory (Swansea, Aug 2012)
  • Too Good to be True? Precisely! The Real Cost of Non-Standard Computation (Cambridge, Feb 2012)
  • Turing and Non-Turing Computers: A Tale of Two Complexities (Karlsruhe, Germany, Oct 2011)
  • Counting the Cost of Quantum Computation and Cryptography (Bristol, Oct 2011)
  • Apples & Oranges? Comparing Unconventional Computers (Taipei, Taiwan, Aug 2010)


Publication overview (full details here)

  

Hover over links for full titles
Journal papers (8):   • Non-Quantum Implementations of Shor’s Algorithm† • 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 (14):   • Generalizing Complexity Theory* • Generalizing Complexity Theory* • Cellular Automata get their Wires Crossed • Ray Tracing—Computing the Uncomputable? • 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 talk/paper †in preparation/press

Upcoming…

  • Journal issue (guest editor): Information and Computation (ISR special issue)
  • Journal paper in press: Complexity-Style Resources in Cryptography
  • Journal paper in preparation: Non-Quantum Implementations of Shor’s Algorithm

This page last updated on 6.ii.2013.
Other pages updated on 13.iii.2013 (Publications) and 13.iii.2013 (CV).