The CS department at Lund Unversity invites applications for a PhD position focusing on algorithms for solving the Boolean satisfiability problem (SAT) and other NP-hard optimization problems very efficiently in practice. The application deadline is February 10, 2020. Informal enquiries are welcome and may be sent to firstname.lastname@example.org .
The CS department at Lund Unversity invites applications for a postdoc position focusing on algorithms for solving the Boolean satisfiability problem (SAT) and other NP-hard optimization problems very efficiently in practice. The application deadline is February 10, 2020. Informal enquiries are welcome and may be sent to email@example.com .
The School of Informatics at the University of Edinburgh invites applicants for Lecturer (“Assistant Professor”), and Reader (“Associate Professor”) in Algorithms and Complexity for Optimisation.
For a full advert for the post, and how to apply, please see the link below.
The MSCS department has an opening for a 3-year postdoc in the “Foundations of Data Science” under its newly received TRIPODS grant.
All areas of TCS related to data science (broadly interpreted) will be considered. The position carries a teaching load of 1 graduate course per year and a competitive salary.
For more information on UIC’s TRIPODS center, visit: https://tripods.uic.edu/
The Harvard Quantum Initiative, Departments of Physics, Chemistry and the SEAS areas of Computer Science and Electrical Engineering seek to appoint a tenure-track professor in the broad theoretical domain of quantum information. Areas of interest may include but are not limited to quantum algorithms, communication, complexity, control, and the physics of quantum information systems.
The Department of Computer Science at Iowa State University seeks applicants for a faculty position at the rank of tenure-track Assistant Professor or tenured Associate Professor. We are specifically looking for experts in artificial intelligence, AI decision theory, foundations of machine learning, algorithmic foundations for data science, and algorithmic game theory.
The Institute of Theoretical Computer Science and Communications at CUHK is offering positions for postdoctoral fellows whose expertise is in complexity theory, algorithms, information theory, coding theory, cryptography, and other theoretical topics in related areas. The position is for 12 months, renewable for another 12 months subject to satisfactory progress.
The Mathematics (MSCS) department at UIC is looking for a tenure-track assistant professor to join the “Mathematical Computer Science” group. All areas of theoretical computer science will be considered.
You can learn more about our TCS group on https://theory.cs.uic.edu/.
HSE University, Faculty of Computer Science invites applications for full-time, tenure-track positions of Assistant Professor in all areas of computer science including but not limited to programming language theory, software engineering, system programming, algorithms, computation complexity, bioinformatics, artificial intelligence, and machine learning, etc.
Two postdoctoral positions, each for one year renewable to a second, are available to work in Luca Trevisan’s group at Bocconi University on topics related to average-case analysis of algorithms, approximation algorithms, and combinatorial constructions.
The positions have a very competitive salary and relocation benefits. Funding for travel is available.