[an error occurred while processing this directive] An error occured whilst processing this directive

LFCS Seminar Series 2008-9

The LFCS organises a series of seminars by visiting speakers, covering a range of topics in theoretical computer science. Speakers in this series are asked to present talks suitable for the entire membership of LFCS, rather than only researchers in their field. These seminars are open to all and are usually held on Tuesday afternoons during term time, from 4-5pm in the Informatics Forum. The seminars are publicised in the local newsgroup eduni.dcs.lfcs, and on the lfcs-interest and seminars mailing lists.

The seminar organiser is Rahul Santhanam (rsanthan AT inf DOT ed DOT ac DOT uk).

The LFCS Database Group also runs a Seminar Series

Date Time Room Speaker Title
November 2010
Thursday 184pmIF 4.31/4.33 Philip Welch Transfinite Time Computation and Determinacy
Tuesday 164pmIF 4.31/4.33 Damian Niwinski Complexity of Infinite Tree Languages - When Automata Meet Topology
Monday 154pmIF G.03 Alessandro Panconesi Algorithmic Aspects of Social Networks
Tuesday 94pmIF 4.31/4.33 David Xiao Cryptography and NP-hardness
September 2010
Tuesday 284pmIF 4.31/4.33 Aleks Kissinger Frobenius States and a Graphical Language for Multipartite Entanglement
June 2010
Tuesday 84pmIF 4.31/4.33 Rasmus Mogelberg Full Abstraction in a Metalanguage for State
May 2010
Friday 284pmIF 4.31/4.33 Andrew McGregor Data Streams, Dyck Languages and Detecting Dubious Data Structures
Tuesday 184pmIF 4.31/4.33 Joseph Bonneau Postponed
Tuesday 114pmIF 4.31/4.33 Alessandro Panconesi Postponed
Friday 710:30amG.03 Benny van Houdt Fast Algorithms for Solving Structured Markov Chains: Theory and Software
April 2010
Tuesday 204pmIF 4.31/4.33 Byron Cook Proving that Programs Eventually do Something Good
Wednesday 145pmIF 4.40 Amelie Gheerbrant Fixed-Point Logics on Finite Game Trees
March 2010
Tuesday 94pmIF 4.31/4.33 Mihaela Sighireanu A generic framework for reasoning about dynamic networks of infinite-state processes
Thursday 43pmIF 4.31/4.33 Hugo Gimbert Stochastic games with partial observation: decidable and undecidable problems
February 2010
Tuesday 164pmIF 4.31/4.33 Lucas Dixon Graphical Reasoning in Symmetric Monoidal Categories
Tuesday 24pmIF 4.31/4.33 Paul Levy Similarity Quotients as Final Coalgebras
January 2010
Monday 264pmIF 4.31/4.33 Alexander Rabinovich On the Complexity of Temporal Logics over Linear Time Domains
Thursday 144pmIF 4.31/4.33 Kathleen Fisher Programming Language Ideas Escape the Lab: A Declarative Data Description Language for Managing Ad Hoc Data
November 2009
Friday 274pmIF 4.31/4.33 Bill Cheswick Rethinking Passwords
Tuesday 244pmIF 4.31/4.33 Tomas Brazdil Scheduling of Stochastically Generated Tasks
Thursday 1911amIF 4.31/4.33 Don Syme Some Future Directions for F# - Research, Language and Applications
Tuesday 104pmIF 4.31/4.33 John Hitchcock Learning Algorithms and Lower Bounds in Computational Complexity
Tuesday 34pmIF 4.31/4.33 Ben Moszkowski A Unifying Analytical Framework for Discrete Linear Time
October 2009
Tuesday 274pmIF 4.31/4.33 Robert Constable Correct-by-Construction Protocols in the Logic of Events: An Investigation into the Foundations of Distributed Computing
Monday 124pmIF 4.31/4.33 Verena Wolf Numerical Approximation Strategies for the Chemical Master Equation
September 2009
Tuesday 224pmIF 4.31/4.33 Joel Ouaknine Verifying Probabilistic Programs: Three Easy Pieces
Tuesday 154pmIF 4.31/4.33 Peter Thiemann JavaGI: Generalized Interfaces for Java
Friday 43pmIF 4.31/4.33 Ingo Battenfeld Topological Domain Theory
Thursday 34pmIF 4.31/4.33 Giulio Manzonetto A Relational Model of Lambda Calculus, and Beyond
August 2009
Tuesday 114pmIF 4.31/4.33 Matthew Hague Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
July 2009
Wednesday 294pmIF G.07a Dieter van Melkebeek Lower Bounds for Satisfiability and Related Problems
Tuesday 282:30pmIF 5.02 Stefanie Gerke Pegging Yields a Small Diameter
June 2009
Tuesday 24pmIF 4.31/4.33 Paul Dunne Complexity of Novel Extension-based Semantics in Argumentation Frameworks
May 2009
Tuesday 194pmIF 4.31/4.33 Tugkan Batu Testing Properties of Distributions
Monday 184pmIF 4.31/4.33 Petr Jancar A New Presentation of the Decidability Proof for Language Equivalence on Deterministic Pushdown Automata
Tuesday 124:30pmIF 4.31/4.33 Michael Hicks A Theory of Typed Coercions and its Applications
Wednesday 61pmIF 4.31/4.33 Yde Venema Coalgebra Automata (Towards a Universal Theory of Automata)
April 2009
Tuesday 283pmIF 4.31/4.33 Pawel Sobocinski An Introduction to the Wire Calculus
Tuesday 214pmIF 4.31/4.33 Janis Voigtlaender Semantic Bidirectionalisation
Monday 204pmIF 4.31/4.33 Anne Broadbent The Quantum Locker Puzzle
Tuesday 143pmIF 5.02 Prakash Panangaden What are Feynman Diagrams?
March 2009
Tuesday 313pmIF 4.31/4.33 Javier Esparza Newtonian Program Analysis
Monday 2311amIF 4.31/4.33 Jeremy Siek Space-Efficient Blame Tracking for Gradual Typing
Tuesday 174pmIF 4.31/4.33 Andrzej Murawski Full Abstraction for Reduced ML
Thursday 264pmIF 4.31/4.33 Torsten Grust Ferry -- Database-Supported Program Execution
February 2009
Tuesday 244pmIF 4.31/4.33 Lance Fortnow Program Equilibria and Discounted Time
Thursday 194pmIF 4.31/4.33 Martin Escardo A Monad for Exhaustively Searching Infinite Sets in Finite Time
Tuesday 174pmIF 4.31/4.33 Michael Hicks CANCELLED
Monday 91:30pmIF 4.31/4.33 Peter Bro Miltersen Some Recent Results and Some Open Problems Concering Solving Infinite Duration Games
Friday 63pmIF G07a Florian Horn Stochastic Games for Verification
January 2009
Tuesday 274pmIF 4.31/4.33 Neil Ghani Containers, Nested Data Types and Induction Recursion
Tuesday 134pmIF 4.31/4.33 Bahareh Afshari Reverse Mathematics and Well-ordering Principles
December 2008
Monday 154pmIF 4.31/4.33 Peter Sewell The Semantics of x86-CC Multiprocessor Machine Code (True Concurrency?)
November 2008
Tuesday 254pmIF 4.31/4.33 Anuj Dawar Complexity: Structures and Specifications
Tuesday 184pmIF 4.31/4.33 David Saad Network Optimisation - a Statistical Physics Perspective
Tuesday 114pmIF 4.31/4.33 Simona Orzan Verification using fixed-point equation systems and invariants
Thursday 064pmIF 4.31/4.33 Yuan Feng Probabilistic bisimulations for quantum processes
October 2008
Tuesday 74pmIF 4.31/4.33 Amin Coja-Oghlan Regular Partitions
September 2008
Monday 14pmIF 4.31 Rasmus Ejlers Møgelberg A relational interpretation of a type theory for computations with local state
Tuesday 234pmIF 4.31/4.33 Oded Lachish Sound 3-query PCPPs are Long

Past seminars

2007-8 · 2006-7 · 2005 · 2004 · 2003 · 2002 · 2001 · 2000 · 1999 · 1998 · 1997 · 1996

An error occured whilst processing this directive