Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How. - Ed Blakey (QPL/DCM@ICALP, 2008)

Factorizing RSA Keys, An Improved Analogue Solution. - Ed Blakey (New Gener. Comput., 2009)

Beyond Blum: What is a Resource? - Ed Blakey (Int. J. Unconv. Comput., 2010)

A New Gap Theorem: the Gap Theorem's Robustness Against Dominance. - Ed Blakey (Int. J. Unconv. Comput., 2011)

Unconventional complexity measures for unconventional computers. - Ed Blakey (Nat. Comput., 2011)

Cellular Automata Get Their Wires Crossed. - Ed Blakey (NCMA, 2012)

Ray tracing - computing the incomputable? - Ed Blakey (DCM, 2012)

Complexity-style resources in cryptography. - Ed Blakey (Inf. Comput., 2013)

Information Security as a Resource. - Ed Blakey; Bob Coecke; Michael W. Mislove; Dusko Pavlovic (Inf. Comput., 2013)

Towards Non-Quantum Implementations of Shor's Factorization Algorithm. - Ed Blakey (Int. J. Unconv. Comput., 2014)