Bjarki Holm

I am a Postdoctoral Research Associate in the Logic and Semantics Group at the Cambridge Computer Laboratory. My current research is focused on the descriptive complexity of polynomial-time computation.

Recent talks

1. Definability of linear equation systems over groups and rings (CSL 2012, IUT Fontainebleau, France).
2. Pebble games with algebraic rules (ICALP 2012, University of Warwick, UK).
3. Descriptive complexity of linear algebra (Logical Approaches to Barriers in Complexity II, Newton Institute, UK).

More...

Publications

Peer-reviewed papers

• A. Dawar, E. Grädel, B. Holm, E. Kopczynski and W. Pakusa. Definability of linear equation systems over groups and rings (pre-print: April 13, 2012). Final version to appear in the proceedings of CSL 2012.
• A. Dawar and B. Holm. Pebble games with algebraic rules (pre-print: May 7, 2012). Final version to appear in the proceedings of ICALP 2012. Slides for my talk at ICALP.
• A. Dawar, M. Grohe, B. Holm, and B. Laubner. Logics with rank operators. In Proceedings of the 23rd IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press, 2009.

Theses

• B. Holm. Descriptive complexity of linear algebra. Ph.D. thesis, University of Cambridge, 2010.
• B. Holm. Constructing elliptic curves with a given number of points. Essay for the Certificate of Advanced Study in Mathematics, University of Cambridge, 2005.

Book chapters and extended abstracts

• A. Dawar and B. Holm. Pebble games for logics with counting and rank. In Studies in Weak Arithmetics, CSLI Lecture Notes, CSLI Publications, 2010.
• A. Dawar and B. Holm. Pebble games for rank logics (extended abstract). In proceedings of Logical Approaches to Barriers in Computing and Complexity, 2010.

In progress

• Symmetric transitive closure revisited
• Characterising Logspace over tree-like structures

In a previous life, I also co-authored a number of books on software development.

Teaching