Personal tools
You are here: Home Events Past Events

Past Events

List of events which have passed.

Lab Lunch by Colin Stirling

From model checking and equivalence checking to type checking

Read More…

Lab lunch by Vashti Galpin

Modelling residential smart grids

Read More…

John Aycock: Computer Security Research: Considered? Harmful?

John Aycock, Associate Professor, University of Calgary, Canada, SICSA Distinguished Visitor

Read More…

LFCS seminar by Colin Riba (ENS Lyon)

Forcing MSO on Infinite Words in Weak MSO

Read More…

LFCS seminar by Prof. Petros Drineas (RPI)

Randomized Algorithms in Linear Algebra and Applications in Data Analysis

Read More…

LFCS seminar by Prof. Graham Cormode (Warwick)

Differentially Private Mechanisms for Data Release

Read More…

LFCS seminar by Dr. Utz-Uwe Haus (ETH)

Monotone Boolean Functions in Systems Biology

Read More…

Murray Cole: Why Parallel Programming is Hard, and What We Should Do About It

Technological trends dictate that future commodity hardware will be highly parallel and heterogeneous. We will need programming models and tools which allow us to develop software which is performance portable, productively constructed, and energy aware(not to mention correct). I will offer opinions as to why current de facto standard approaches are not appropriate, and why a methodology based around the exploitation of patterns is the way forward.

Read More…

Lab Lunch with Andrew Sogokon

Andrew Sogokon will be our speaker. Biscuits will be provided as usual.

Read More…

Lab Lunch with Howard Lin

Howard Lin will join us at Lab Lunch to speak about "Applying Research Ethical Approval and R&D from NHS for researchers in Informatics without permanent UK residency: Problems and Solutions" Biscuits will be provided.

Read More…

Lab Lunch by Ian Stark

REMS: Rigorous Engineering for Mainstream Systems

Read More…

Lab Lunch: Yinghui Wu

Abstract: Graph pattern matching has become a routine process in emerging applications. In practice the real life graphs are typically large, and are frequently updated with small changes. It is often prohibitively expensive to recompute the matches from scratch via batch algorithms each time the graphs are updated.

Read More…

Document Actions