Raja was invited to be on the discussion panel on Quantum Algorithms at this year’s Bristol Quantum Information Technologies Workshop.
On April 10th, Florian gave an invited talk at the “Workshop of Automated Reasoning — Bridging the Gap between Theory and Practice”. His talk was titled “Verifying Quantum Protocols using Interactive Theorem Proving”.
Barnaby Martin will travel to Japan this summer to present “Constraint Satisfaction Problems Over The Integers with Successor” (with Manuel Bodirsky and Antoine Mottet) at ICALP and “From complexity to algebra and back: digraph classes, collapsibility and the PGP” (with Catarina Carvalho and Florent Madelaine) at LICS.
Raja gave a talk at the Oxford Algorithms Seminar on the 4th of March. His talk was on “Automated Analysis of Quantum Protocols”.
Panos spoke at the Oxford Algorithms Seminar on the 4th of February. His talk was on “The complexity of connecting and separating points in the plane”.
Our Hungarian research fellow, Dr. András Pongrácz, has been awarded a Grünwald Géza medal. This is awarded to four or five Hungarian mathematicians each year, under the age of 30, based on their research achievements. For a country with such a strong mathematical pedigree, this can be considered a highly respectable accolade.
As of September 23rd, the Foundations group welcomes Dr. Andrei Popescu as Senior Lecturer! Andrei has come from the Isabelle group at TU München. He is interested in formal verification, inductive and coinductive datatypes, and information-flow security.
The Foundations group welcomes as lecturer Dr. Panos Giannopolous! Panos comes from FU Berlin and is interested in the Computational Complexity of geometric problems.
Members of the Foundations group were active in the Summer of Logic with papers including:
On the Total Variation Distance of Labelled Markov Chains”.
LICS+CSL 2014: James Brotherston, Carsten Fuhs, Nikos Gorogiannis and Juan Navarro Perez, “A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates”.
ICALP A 2014: Petar Dapic, Petar Markovic and Barnaby Martin, “QCSP on Semicomplete Digraphs”.