Просмотр новости
Найдите то, что Вас интересует
Спутники
РН
SpaceX
Роскосмос
NASA
СпутникиРНSpaceXРоскосмосNASA'The complexity of conservative valued CSPs' has been co-written by Oxford's Standa Živný
Posted: 13th September 2011
'The complexity of conservative valued CSPs', written by Vladimir Kolmogorov (from IST, Austria's Institute of Science and Technology) and Oxford's Standa Živný, has been accepted for publication to the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
SODA is the annual most prestigious conference on discrete algorithms in theoretical computer science. In 2012, the conference will be held in Kyoto, Japan.
| # | Наименование новости | Тональность | Информативность | Дата публикации |
|---|---|---|---|---|
| 1 | Thesis awarded the ACP Doctoral Research Award | 0 | 7.65 | 18-08-2011 |
| 2 | Two papers accepted to CP 2012 | 0 | 13.78 | 12-06-2012 |
| 3 | Paper accepted to FOCS 2012 | 0 | 13.89 | 25-06-2012 |
| 4 | Papers accepted to TACAS 2012 | 0 | 12.61 | 10-01-2012 |
| 5 | Sam Staton wins Best Paper Award at the European Symposium on Programming | 0 | 10 | 02-05-2017 |
| 6 | Six papers at TACAS 2016 | 0 | 10.94 | 20-12-2015 |
| 7 | Oxford's CS at the flagship security conferences: accepted papers at ACM CCS’16 and IEEE S&P’16 | 0 | 21.16 | 24-08-2016 |
| 8 | Papers accepted to ESOP 2012 | 0 | 15.31 | 10-01-2012 |
| 9 | Papers accepted to FoSSaCS 2012 | 0 | 12.71 | 21-12-2011 |
| 10 | Best paper win at International Colloquium on Automata, Languages and Programming | 0 | 10 | 10-05-2017 |