2005 Events Archives

Conferences, Lectures and Workshops

The 3rd Annual Kolmogorov Lecture
10 February
Professor Per Martin-Löf
"Zermelo's axiom of choice: What was the problem with it?

MINOS '05
The fifth annual conference, hosted by the Department of Computer Science, on micromouse design and the organisation of the National Micromouse Competition.

Seminars

18 January
Mike Flynn, Stanford University
Computer Architecture, the road ahead

24 January
Edward Trifonov, University of Haifa, Israel.
Decipherable past of the triplet code, and early life of proteins

25 January
Stefan Szeider, University of Durham
Parameterized algorithms for propositional satisfiability

2 March
José C. González, Grupo de Sistemas Inteligentes, Universidad Politécnica de Madrid
Starting a technological spin-off: Lessons learned

28 February
Martin Golumbic, University of Haifa, Israel
The k-edge intersection graphs of paths in a tree (.pdf file)

18 March
Jorma Rissanen, Department of Computer Science, University of Helsinki
Modeling by the MDL Principle (.pdf file)

24 March
Ian Gent, Department of Computer Science, University of St Andrews
Search in the Patience Game Black Hole

25 April
Vladimir Vapnik, Royal Holloway, University of London
Directed Ad-Hoc Inference

24 May
Stéphan Thomassé, Laboratoire de Probabilités, Combinatoire et Statistique, University of Lyon, France
Dense triangle-free graphs in Borsuk graphs

6 June
Michael Krivelevich, Tel Aviv University
Models of Random Graphs

27 June
Michael Fellows, University of Newcastle, Australia
On the Parameterized Complexity of Some Fundamental Problems in Machine Learning

28 June
Benjamin Sudakov, Princeton University, U.S.A.
Probabilistic reasoning and Ramsey Theory

7 July
Shai Ben-David, University of Waterloo, Ontario
A notion of stability for statistical clustering with applications to model selection

Tuesday 20 September
Stephan Szeider, University of Durham
On the clique-width of graphs

Tuesday 22 November (2 pm, McCrea 325)
Alek Vainshtein, University of Haifa
On the structure of edge-connectivity of a vertex subset in a graph