Two papers co-authored by Standa Zivny accepted to the 18th International Conference on Principles and Practice of Constraint Programming
Posted: 12th June 2012
Two papers co-authored by Standa Zivny, a Junior Research Fellow at Oxford's University College and member of the Dept. of Computer Science, have been accepted to the 18th International Conference on Principles and Practice of Constraint Programming (CP 2012).
The papers are:
'A characterisation of the complexity of forbidding subproblems in binary' Max-CSP, by M. Cooper (Toulouse), G. Escamocher (Toulouse), and S. Zivny.
'Relating proof complexity measures and practical hardness of SAT', by M. Järvisalo (Helsinki), A. Matsliah (IBM Research), J. Nordström (KTH) and S. Zivny.
The conference will be held in Quebec City, Canada in October.
| # | Наименование новости | Тональность | Информативность | Дата публикации |
|---|---|---|---|---|
| 1 | Papers accepted to TACAS 2012 | 0 | 12.61 | 10-01-2012 |
| 2 | Papers accepted to ESOP 2012 | 0 | 15.31 | 10-01-2012 |
| 3 | Paper accepted to the ACM-SIAM Symposium on Discrete Algorithms (SODA) | 0 | 17.47 | 13-09-2011 |
| 4 | Paper accepted to EISIC 2012 | 0 | 9.66 | 30-05-2012 |
| 5 | Paper accepted to FOCS 2012 | 0 | 13.89 | 25-06-2012 |
| 6 | Papers accepted to ICDT 2013 | 0 | 11.68 | 29-11-2012 |
| 7 | Two papers accepted to POPL 2013 | 0 | 22.5 | 02-10-2012 |
| 8 | Thesis awarded the ACP Doctoral Research Award | 0 | 7.65 | 18-08-2011 |
| 9 | Three papers accepted to the International Conference on Computational Linguistics | 0 | 10 | 02-11-2012 |
| 10 | Papers accepted to Natural Language Processing conference | 0 | 10 | 18-09-2013 |