Personal tools
You are here: Home Events Previous

Previous

Past events

Event LFCS Seminar: Gilles Dowek (from Feb 07, 2012 04:00 PM to Feb 07, 2012 05:00 PM)
Pre-Heyting algebras and proof normalization.
Event LFCS Seminar: Anthony Widjaja Lin (IF 4.31-33, from Jan 27, 2012 02:00 PM to Jan 27, 2012 03:00 PM)
Tractability Results for Automata on (Vectors of) Numbers with Applications
Event LFCS Seminar: Dan Ghica (from Jan 20, 2012 02:00 PM to Jan 20, 2012 03:00 PM)
Towards a system-level semantics
Event LFCS Seminar: Ohad Kammar (from Jan 10, 2012 04:00 PM to Jan 10, 2012 05:00 PM)
Title: Algebraic Foundations to Effect-Dependent Optimisations
Event LFCS end of year quiz (Informatics Forum, from Dec 13, 2011 04:30 PM to Dec 14, 2011 04:30 PM)
 
Event LFCS End-of-Year Quiz (from Dec 13, 2011 09:35 AM to Dec 14, 2011 09:35 AM)
 
Event LFCS Seminar: Petra Berenbrink (IF 4.31-4.33, from Dec 13, 2011 04:00 PM to Dec 13, 2011 05:00 PM)
Speeding up random walks
Event LFCS Seminar: Jamie Gabbay (IF 4.31-4.33, from Dec 06, 2011 04:00 PM to Dec 06, 2011 05:00 PM)
Stone duality for first-order logic (a nominal approach)
Event LFCS Seminar: Ross Duncan (IF 4.31+4.33, Informatics Forum , from Nov 30, 2011 04:00 PM to Nov 30, 2011 05:00 PM)
The ZX-Calculus: a graphical approach to quantum computing
Event LFCS Seminar: Jean-Eric Pin (Appleton Tower, AT2.12, from Nov 18, 2011 03:00 PM to Nov 18, 2011 04:00 PM)
Equational descriptions of logic fragments
Event CISA/LFCS Seminar: Georges Gonthier (IF 4.31-4.33, from Nov 08, 2011 04:00 PM to Nov 08, 2011 05:00 PM)
Proof engineering, from the Four Color to the Odd Order Theorem.
Event Database seminar: Dr Gerald Weber, Efficient and flexible Joins for near-real time data processing. (Informatics Forum IF4.31+4.33, from Sep 29, 2011 01:00 PM to Sep 29, 2011 02:00 PM)
 
Event Lab Lunch: Dr James Cheney (from Sep 27, 2011 01:00 PM to Sep 27, 2011 02:00 PM)
 
Event Lab Lunch: Ohad Kammar (Informatics Forum MF2, from Sep 20, 2011 01:00 PM to Sep 20, 2011 02:00 PM)
 
Event Lab Lunch: Nicolas Oury (from Sep 13, 2011 01:00 PM to Sep 13, 2011 02:00 PM)
 
Event Lab Lunch: Dr Brian Campbell (Informatics Forum MF2, from Sep 06, 2011 01:00 PM to Sep 06, 2011 02:00 PM)
An executable semantics for CompCert
Event Lab Lunch: Maria Luisa Guerriero (Informatics Forum MF2, from Aug 30, 2011 01:00 PM to Aug 30, 2011 02:00 PM)
Process algebra and model-checking for computational systems biology
Event LFCS Seminar: Nitin Vaidya (Informatics Forum IF4.31+4.33, from Aug 16, 2011 04:00 PM to Aug 16, 2011 05:00 PM)
TITLE: Network-Aware Distributed Algorithms
Event Lab Lunch: Nan Tang (Informatics Forum MF2, from Aug 09, 2011 01:00 PM to Aug 09, 2011 02:00 PM)
Interaction between Record Matching and Data Repairing
Event Lab Lunch: Yinghui Wu (Informatics Forum MF2, from Aug 02, 2011 01:00 PM to Aug 02, 2011 02:00 PM)
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.

Also in this section

Event LFCS Seminar: Gilles Dowek (from Feb 07, 2012 04:00 PM to Feb 07, 2012 05:00 PM)
Pre-Heyting algebras and proof normalization.
Event LFCS Seminar: Anthony Widjaja Lin (IF 4.31-33, from Jan 27, 2012 02:00 PM to Jan 27, 2012 03:00 PM)
Tractability Results for Automata on (Vectors of) Numbers with Applications
Event LFCS Seminar: Dan Ghica (from Jan 20, 2012 02:00 PM to Jan 20, 2012 03:00 PM)
Towards a system-level semantics
Event LFCS Seminar: Ohad Kammar (from Jan 10, 2012 04:00 PM to Jan 10, 2012 05:00 PM)
Title: Algebraic Foundations to Effect-Dependent Optimisations
Event LFCS end of year quiz (Informatics Forum, from Dec 13, 2011 04:30 PM to Dec 14, 2011 04:30 PM)
 
Event LFCS End-of-Year Quiz (from Dec 13, 2011 09:35 AM to Dec 14, 2011 09:35 AM)
 
Event LFCS Seminar: Petra Berenbrink (IF 4.31-4.33, from Dec 13, 2011 04:00 PM to Dec 13, 2011 05:00 PM)
Speeding up random walks
Event LFCS Seminar: Jamie Gabbay (IF 4.31-4.33, from Dec 06, 2011 04:00 PM to Dec 06, 2011 05:00 PM)
Stone duality for first-order logic (a nominal approach)
Event LFCS Seminar: Ross Duncan (IF 4.31+4.33, Informatics Forum , from Nov 30, 2011 04:00 PM to Nov 30, 2011 05:00 PM)
The ZX-Calculus: a graphical approach to quantum computing
Event LFCS Seminar: Jean-Eric Pin (Appleton Tower, AT2.12, from Nov 18, 2011 03:00 PM to Nov 18, 2011 04:00 PM)
Equational descriptions of logic fragments
Event CISA/LFCS Seminar: Georges Gonthier (IF 4.31-4.33, from Nov 08, 2011 04:00 PM to Nov 08, 2011 05:00 PM)
Proof engineering, from the Four Color to the Odd Order Theorem.
Event Database seminar: Dr Gerald Weber, Efficient and flexible Joins for near-real time data processing. (Informatics Forum IF4.31+4.33, from Sep 29, 2011 01:00 PM to Sep 29, 2011 02:00 PM)
 
Event Lab Lunch: Dr James Cheney (from Sep 27, 2011 01:00 PM to Sep 27, 2011 02:00 PM)
 
Event Lab Lunch: Ohad Kammar (Informatics Forum MF2, from Sep 20, 2011 01:00 PM to Sep 20, 2011 02:00 PM)
 
Event Lab Lunch: Nicolas Oury (from Sep 13, 2011 01:00 PM to Sep 13, 2011 02:00 PM)
 
Event Lab Lunch: Dr Brian Campbell (Informatics Forum MF2, from Sep 06, 2011 01:00 PM to Sep 06, 2011 02:00 PM)
An executable semantics for CompCert
Event Lab Lunch: Maria Luisa Guerriero (Informatics Forum MF2, from Aug 30, 2011 01:00 PM to Aug 30, 2011 02:00 PM)
Process algebra and model-checking for computational systems biology
Event LFCS Seminar: Nitin Vaidya (Informatics Forum IF4.31+4.33, from Aug 16, 2011 04:00 PM to Aug 16, 2011 05:00 PM)
TITLE: Network-Aware Distributed Algorithms
Event Lab Lunch: Nan Tang (Informatics Forum MF2, from Aug 09, 2011 01:00 PM to Aug 09, 2011 02:00 PM)
Interaction between Record Matching and Data Repairing
Event Lab Lunch: Yinghui Wu (Informatics Forum MF2, from Aug 02, 2011 01:00 PM to Aug 02, 2011 02:00 PM)
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.
Document Actions