Camilo Thorne Rheinhäuser Str. 9A 68165, Mannheim, Germany mobile: +49(0)15202380352 http://www.camilothorne.com <http://camilothorne.com/>
"Exegi monumentum aere perennius" (Horatius, Ode III-30) ---------- Forwarded message --------- From: Jakob Nordström <[email protected]> Date: Sun, Nov 10, 2019 at 3:22 AM Subject: [Proof Complexity] Simons-Berkeley Research Fellowships for spring of 2021 on theory and practice of NP and beyond To: [email protected] <[email protected]> Dear colleagues, The call for applications for research fellowships (postdoc positions) at the Simons Institute at UC Berkeley for 2020-21 has now been posted at https://simons.berkeley.edu/fellows2020 with an application deadline of December 15. We wish to highlight the semester program "Satisfiability: Theory, Practice, and Beyond" (https://simons.berkeley.edu/programs/sat2021), which will run in the spring of 2021 in parallel with "Theoretical Foundations of Computer Systems" (https://simons.berkeley.edu/programs/tfcs2021). Simons-Berkeley Research Fellowships are intended for up-and-coming researchers who are getting close to defending their PhD degree or are at most 6 years past it at the start of the academic year 2020-21. This includes researchers who already hold junior faculty or postdoctoral positions. In particular, applicants who expect to have postdoc positions at other institutions are encouraged to apply to spend one semester as a Simons-Berkeley Fellow, subject to the approval of the home institution. The Institute expects to award about 30 Fellowships in 2020-21; the majority of these are for one semester, but several appointments for a full academic year are expected to be made. In each semester of residence, each Fellow will normally participate in at least one of the ongoing programs at the Institute -- please indicate if you are applying for the SAT semester program. Salaries and benefits are competitive, and assistance with visas and housing will be provided. The Institute particularly encourages applications from women and minority candidates. If interdisciplinary research at the crossroads between theory and practice of SAT and other hard problems in logic and/or combinatorics seems interesting to you (also including going beyond NP to areas such as SMT solving, constraint programming, and mixed integer linear programming), then you are strongly encouraged to apply! All help with distributing this announcement further would be much appreciated. Best regards, Jakob Nordström On behalf of the organizing committee for the SAT semester program, Albert Atserias, Sam Buss, Vijay Ganesh, Antonina Kolokolova, and Jakob Nordström Jakob Nordström, Associate Professor University of Copenhagen and KTH Royal Institute of Technology Phone: +46 70 742 21 98 http://www.csc.kth.se/~jakobn/ _______________________________________________ Proof-Complexity mailing list [email protected] https://list.math.cas.cz/listinfo/proof-complexity -- Você está recebendo esta mensagem porque se inscreveu no grupo "LOGICA-L" dos Grupos do Google. Para cancelar inscrição nesse grupo e parar de receber e-mails dele, envie um e-mail para [email protected]. Para ver esta discussão na web, acesse https://groups.google.com/a/dimap.ufrn.br/d/msgid/logica-l/CAJPxwseSiR0vjVkYLAfmZh2TyBRf5RQbFBLRaYLvv2nqRR_7%2BA%40mail.gmail.com.
