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.



	I am also a Research Associate at Clare College



	Finite model theory resources



	Reading group in logic and algorithms



	Talks



	Supervisions



	CLC

Publications

B. Holm. Descriptive Complexity of Linear Algebra. Ph.D. thesis, University of Cambridge, 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.
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, 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.
B. Holm. Constructing Elliptic Curves with a Given Number of Points. Essay for the Certificate of Advanced Study in Mathematics, University of Cambridge, 2005.

University of Cambridge
Computer Laboratory
William Gates Building
Room FS06
15 JJ Thomson Avenue
Cambridge
CB3 0FD
Map

Tel. +44 (0) 1223 767 010