Oxford papers accepted to ICALP

Several Oxford papers were accepted to the 40^th International Colloquium on Automata, Languages and Programming. ICLAP is a principal venue for core theoretical computer science papers. The Oxford (co-)authored papers include:

• Complexity of two-variable logic over finite trees  by Saguy Benaim, Michael Benedikt, Witold Charatonik (University of Wroclaw), Emanuel Kieronski (University of Wroclaw), Rastislav Lenhardt, Filip Mazowiecki (University of Warsaw), and James Worrell
• Querying the Guarded Fragment with Transitivity  by Georg Gottlob, Andreas Pieris and Lidia Tendera (University of Opole)  
• On the Complexity of Multitape Automata Equivalence by James Worrell.