Personal tools
You are here: Home

Did you not find what you were looking for? Try the Advanced Search to refine your search.

Search results 499 items matching your search terms

Subscribe to an always-updated feed of these search terms

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 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, ...
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 Linear-Dynamic Event Calculus
Mark Steedman ICCS Division of Informatics, Edinburgh 4pm Tuesday 25th 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 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 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 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 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 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 ...
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, ...
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 ...
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 ...
Page Repairing Type Errors in Functional Programs
Bruce McAdam LFCS 4pm Tuesday 19th February 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 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 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 Exploration games for UML software design
Jennifer Tenzer LFCS, School of Informatics, U. of Edinburgh 4pm Tuesday 31st January 2006 Room 2511, JCMB, King's Buildings
Page The finite model theory of random 3-CNF formulas
Albert Atserias Universitat Politecnica de Catalunya 4pm Tuesday 14th February 2006 Room 2511, JCMB, King's Buildings
Page Disjoint NP-Pairs
Alan Selman State University of New York--Buffalo 4pm Tuesday 7th March 2006 Room 2511, JCMB, King's Buildings
Page Models for Incomplete and Probabilistic Information
Val Tannen University of Pennsylvania 4pm Wednesday, 8th March 2006 Room 202, Appleton Tower, King's Buildings
Page Complexity of computations with definable sets.
Nicolai Vorobjov University of Bath 4pm Tuesday 14th March 2006 Room 2511, JCMB, King's Buildings
Page Automatically proving the termination of C programs
Byron Cook Microsoft Research, Cambridge 4pm Tuesday, March 21st 2006 Room 2511, JCMB, King's Buildings
Page The Weird World of Bi-Directional Programming
Benjamin C. Pierce Microsoft Research (on leave from University of Pennsylvania) 4pm Monday, 17th April 2006 Room 2511, JCMB, King's Buildings
Page Safraless Compositional Synthesis
Moshe Y. Vardi Rice University 4pm Tuesday 18th April 2006 Room 2511, JCMB, King's Buildings
Page Approximating the Tutte polynomial: a status report
Mark Jerrum University of Edinburgh 4pm Tuesday 25th April 2006 Room 2511, JCMB, King's Buildings
Page Average time games
Marcin Jurdzinski University of Warwick 4pm Tuesday 2nd May 2006 Room 2511, JCMB, King's Buildings
Page Runtime Reflection: An approach for the model-based runtime analysis of distributed reactive systems
Andreas Bauer Technische Universitat-Munich 4pm Monday 5th June 2006 Room 2511, JCMB, King's Buildings
Page Oblivious Network Design
Anupam Gupta Carnegie Mellon University 4pm Tuesday 11th July 2006 Room 2511, JCMB, King's Buildings
Page Fast exhaustive search over infinite search spaces.
Martin Escardo University of Birmingham 4pm Tuesday 5th September 2006 Room 2511, JCMB, King's Buildings