Personal tools
You are here: Home Events Abstract Archives 2002

2002

Page Canonical Prefixes of Petri Net Unfoldings
Victor Khomenko Department of Computing Science University of Newcastle upon Tyne 12pm Thursday 11th January 2002 Room 2511, JCMB, King's Buildings
Page Automaticity of Modal Logics with Fixed Points
Anuj Dawar Computer Laboratory University of Cambridge 4pm Tuesday 15th January 2002 Room 2511, JCMB, King's Buildings
Page A Spatial Logic for Querying Graphs
Philippa Gardner Department of Computing Imperial College 4pm Tuesday 29th January 2002 Room 2511, JCMB, King's Buildings
Page Monadic Datalog and the Expressive Power of Languages for Web Information Extraction
Georg Gottlob Computer Science Department Vienna University of Technology, 4pm Thursday 31st January 2002 Room 2511, JCMB, King's Buildings
Page Deciding DPDA equivalence is primitive recursive
Colin Stirling LFCS 4pm Tuesday 5th February 2002 Room 2511, JCMB, King's Buildings
Page Repairing Type Errors in Functional Programs
Bruce McAdam LFCS 4pm Tuesday 19th February 2002 Room 2511, JCMB, King's Buildings
Page Approximating Bounded Degree Instances of NP-Hard Optimization Problems
Marek Karpinski Institute of Computer Science Rheinische Friedrich-Wilhelms-Universität Bonn 4pm Thursday 21st Febraury 2002 Room 2511, JCMB, King's Buildings
Page Consistency of XML specifications with types and constraints
Wenfei Fan Internet Management Research Department, Bell Labs Deptartment of Computer and Information Sciences, Temple University 4pm Tuesday 26th February 2002 Room 2511, JCMB, King's Buildings
Page Parameterized Complexity: Overview and Open Questions
Rod Downey School of Mathematical and Computing Sciences Victoria University of Wellington, New Zealand 4pm Tuesday 26th March 2002 Room 2511, JCMB, King's Buildings
Page Finite model theory, complexity theory and program schemes
Iain Stewart Department of Mathematics & Computer Science University of Leicester 4pm 7th May 2002 Room 2511, JCMB, King's Buildings The speaker is Co-ordinator of MathFIT. The broad aim of the Mathematics for Information Technology initiative is to support, through research grants, visiting fellowships, networks, workshops and summer schools, high-quality interdisciplinary research in areas at the interface between mathematics and computer science. It is jointly sponsored by the Engineering and Physical Sciences Research Council (EPSRC) and the London Mathematical Society (LMS), and began in the summer of 1996, was subsequently expanded in spring 2000 and will run until 2003. Following his research talk (ca. 45 min), the speaker will give on overview of MathFIT (ca. 15 min).
Page Approximate counting, random sampling, and graph homomorphisms
Leslie Ann Goldberg Department of Computer Science University of Warwick 4pm Wednesday 15th May 2002 Room 2509, JCMB, King's Buildings
Page Bisimilar Covers in the Finite Model Theory of the Modal and Guarded Fragments
Martin Otto Department of Computer Science University of Wales 4pm Tuesday 28th May 2002 Room 2511, JCMB, King's Buildings
Page Why do Paul Erdoes and Parameterized Complexity Theory appear in the title of the same talk?
Martin Grohe LFCS 4pm Tuesday 4th June 2002 Room 2511, JCMB, King's Buildings
Page An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems
Mario Bravetti Department of Computer Science University of Bologna 4pm Thursday 13th June 2002 Room 2511, JCMB, King's Buildings
Page Realizability and verification of Message Sequence Charts and MSC graphs
Kousha Etessami Computing Sciences Research Bell Laboratories 5pm Tuesday 18th June 2002 Room 6206, JCMB, King's Buildings
Page Linear-Dynamic Event Calculus
Mark Steedman ICCS Division of Informatics, Edinburgh 4pm Tuesday 25th June 2002 Room 2511, JCMB, King's Buildings
Page Exploiting Punctuation Semantics in Continuous Data Streams
David Maier Department of Computer Science and Engineering Oregon Graduate Institute 4pm Tuesday 2nd July 2002 Room 2511, JCMB, King's Buildings
Page Automatization of propositional proof systems
Albert Atserias Departament de Llenguatges i Sistemes Informàtics Universitat Politècnica de Catalunya 11am Friday 20th September 2002 Room 2511, JCMB, King's Buildings
Page Algorithms for randomly sampling Contingency tables
Mary Cryan School of Computing University of Leeds 4pm Tuesday 2nd July 2002 Room 2511, JCMB, King's Buildings
Page The Phi-calculus - a new language for distributed control of continuous reconfigurable systems
Bill Rounds Department of Electrical Engineering and Computer Science University of Michigan 4pm Tuesday 12th November 2002 Room 2511, JCMB, King's Buildings
Page On Algebraic Specifications of Abstract Data Types
Bakhadyr Khoussainov Department of Computer Science University of Auckland 4pm Tuesday 19th November 2002 Room 2511, JCMB, King's Buildings
Page Separation Logic: A Logic for Shared Mutable Data Structures
John C. Reynolds Computer Science Department Carnegie Mellon University 4pm Tuesday 26th November 2002 Room 2511, JCMB, King's Buildings
Document Actions