PhD positions are available in the Centre for Doctoral Training (CDT) at the Department of Computer Science, University of Warwick, UK. The Theory and Foundations
IRIF (CNRS / U. Paris Diderot), Paris, France, is seeking excellent candidates for about 10 postdoctoral positions in all areas of the Foundations of Computer
The Algorithms and Complexity group of IRIF – previously LIAFA – (CNRS and University Paris Diderot), Paris, France, is seeking excellent candidates for one or
Assistant Professor in Mathematics, Department of Mathematics, LSE (The London School of Economics and Political Science) The Department of Mathematics at LSE seeks to appoint
CIAC 2019 – Second Call for Papers 11th International Conference on Algorithms and Complexity May 27-29, 2019, Rome, Italy http://easyconferences.eu/ciac2019/ The submission server is now
14th International Computer Science Symposium in Russia (CSR 2019) will be held on July 1-5, 2019, in Novosibirsk, Russia. The submission deadline is December 23,
The Theory and Foundations group in the Department of Computer Science at the University of Warwick, UK, is inviting applications for fully funded PhD positions
The 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018) will take place in Paris, France, on 7-9 October 2018, with workshops and
Two postdoc positions within the ERC Advanced Grant project “Algorithmic and Mechanism Design Research in Online Markets” (AMDROMA) are available at Sapienza University of Rome.
CIAC 2019 – Preliminary Call for Papers 11th International Conference on Algorithms and Complexity May 27-29, 2019, Rome, Italy http://easyconferences.eu/ciac2019/ Aims and Scope The International
You can use the anonymous submission form to upload information about an event, a blog post or a job posting. It will be published when it is approved by the moderator.
| M | T | W | T | F | S | S |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 | 29 |
| 30 | 31 | |||||