Bjarki Holm

Name:	Bjarki Holm
Affiliation:	University of Cambridge
E-mail:	(only provided to users who are logged into talks.cam)
Last login:	18 Oct 2012, 10 a.m.

Public lists managed by Bjarki Holm

• Turing Centenary Conference

Talks given by Bjarki Holm

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

• Logics of polynomial-time computation
• Tree decomposition of graphs

Talks organised by Bjarki Holm

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Bjarki Holm actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• Halo: From Haskell to Logic through Denotational Semantics
• Abstraction and Invariance for Algebraically Indexed Types
• Preservation under Substructures modulo Bounded Cores
• 100 years of Alan Turing, 1000000 years of the computer
• Turing Patterns and Animal Markings
• Bounds on proof size and distributive encryption
• Safe Recursive Set Functions
• MELL in a free compact closure
• First steps in synthetic guarded domain theory: step-indexing in the topos of trees
• Expressiveness of real-time temporal logics
• On modal definability of first-order formulas with many free variables and its application to conjunctive query answering in description logics
• Iterative algorithms and Sherali-Adams linear programming relaxations of graph isomorphism
• Layered Fixed Point Logic
• Algebra unifies Calculi of programming
• Nash Equilibrium, Bekic's Lemma and Bar Recursion
• Almost always blue trees and bar induction
• Algebra unifies Calculi of programming
• Parameterized Complexity of some Problems in Concurrency and Verification
• Parallel Assertions for Debugging Parallel Programs
• Lightweight Monadic Programming in ML
• The Complexity of #CSP
• Isomorphisms of types in the presence of higher-order references
• Domination When the Stars Are Out – An algorithmization of Chudnovsky’s and Seymour’s Structure Theorem for Claw-Free Graphs
• Bisimulation and Model-Checking for Partial Order Models of Concurrency
• Approximating Labelled Markov Processes by Averaging
• Kleisli Arrows of Outrageous Fortune
• Selection functions everywhere
• Modular Reasoning for Deterministic Parallelism
• Towards Automatic Resource Consumption Certification
• A Framework for Incremental Modelling and Verification of On-Chip Protocols and Its Application to PCI Express