Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

Papers accepted to ICALP 2012

Дата публикации: 26-04-2012 11:00:00

Oxford papers accepted to the 39th International Colloquium on Automata, Languages and Programming

Основное содержимое страницы с новостью.

Posted: 26th April 2012

Papers, (co-)authored by people associated with Oxford’s Computer Science Department, have been accepted to the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012.)

The accepted papers include:

  • Denis Kuperberg and Michael Vanden Boom. On the Expressive Power of Cost Logics over Infinite Words
  • C.-H. Luke Ong and Takeshi Tsukada. Two-Level Game Semantics, Intersection Types and Recursion Schemes
  • Michael Benedikt, Pierre Bourhis and Pierre Senellart. Monadic Datalog Containment
  • Andrzej Murawski and Nikos Tzevelekos. Algorithmic games for full ground references

A further accepted paper was co-authored by two recent members of the Department:

  • Chris Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre. A Saturation Method for Collapsible Pushdown Systems

The Colloquium is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS), and will take place in  July at the University of Warwick.

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1Strong showing for Oxford at Logic in Computer Science conference016.2511-04-2012
2Papers accepted to TACAS 2012012.6110-01-2012
3Papers accepted to VLDB 2012011.3830-05-2012
4Paper accepted to FOCS 2012013.8925-06-2012
5Oxford papers accepted to ICALP08.6217-04-2013
6Four Oxford papers accepted to MFCS 2014015.8812-06-2014
7Papers accepted to ESOP 2012015.3110-01-2012
8Best paper win at International Colloquium on Automata, Languages and Programming01010-05-2017
9Papers accepted to FoSSaCS 2012012.7121-12-2011
1020% of all ICALP (track B) papers from Oxford016.3522-04-2014

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 11.57. Источник: www.cs.ox.ac.uk.