keep up to date with research on the satisfiability problem
Post-doctoral and Ph.D. thesis positions in SAT, constraints, search and applications offered at the CS department of Aalto University in Helsinki, Finland. Apply by February 7, 2019.
The TCS Group at KTH Royal Institute of Technology invites applications for postdoc positions in computer science focused on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms.
The Vienna Center for Logic and Algorithms (VCLA) at TU Wien seeks nominations for the VCLA International Student Awards 2019. The annually awarded VCLA International Student Awards for Outstanding Master and Undergraduate Research (Bachelor) Theses (or equivalent) recognize authors of scientific works across the wide spectrum of Logic and Computer Science. Final Submission Deadline: 15.3.2019
Female students in the field of computer science (CS) who plan to pursue (or are currently pursuing) one of the master‘s programs in Computer Science at the Vienna University of Technology – TU Wien taught in English are invited to apply for the annually awarded Helmut Veith Stipend.
The Journal on Satisfiability, Boolean Modeling and Computation (JSAT), the open access journal of the SAT association, is now accepting submissions using its new easychair-based journal management system.
The Theory Group at KTH Royal Institute of Technology is looking for a PhD student in SAT solving.
Post-doctoral and Ph.D. thesis positions in SAT, constraints, search and applications offered at the CS department of Aalto University in Helsinki, Finland. Apply by September 29, 2018.
Two post-doctoral research fellow positions in the area of SAT/CP/AI are available at the School of Computing, National University of Singapore, Singapore.