申请 | 全球算法博士、博后职位-2021.8（下）
编者按
相比美国，欧洲读博或许显得有些“小众”。
其实，欧洲博士和博后项目以其极高的薪资待遇著称，如果可以拿到工作合同，读博工资在当地已属中产，并享受一切相关福利，毕业后不久即可申请当地永居或移民。申请欧洲读博通常需要硕士学位，一般不需要GRE也无需当地语言，有雅思或托福成绩即可申请，套磁是申请的关键。
我在德国拿到博士学位后工作半年，即具备申请德国永居的资格，相比于美国也简单很多。
关于我的欧美留学经历，请戳下方视频：
普通家庭人十年留学史：DIY飞跃美德全奖读研读博，为何最终落户德国做个打工人？
德国博士毕业后，我成为了快乐的打工人 ( 摸鱼人 )【留德说】 作者：留德华叫兽
目录 Catalogue
1. 索邦大学博士后职位：Marie Skodowska-Curie postdoctoral fellowships: call for expression of interest (Spyros Angelopoulos)
2. 本·古里安大学博士后职位：POSTDOC at Ben-Gurion University (Klim Efremenko)
3. 加拿大魁北克大学乌塔韦校区博士后职位：postdoctoral fellowship (Pelc, Andrzej)
4. CISPA博士后职位：Postdoc positions at CISPA Saarbrcken (Algorithms & Complexity) (Marx)
5. 隆德大学博士职位：PhD positions in theoretical computer science and/or combinatorial optimization at Lund University (Jakob Nordstr?m)
01
Marie Skodowska-Curie postdoctoral fellowships: call for expression of interest (Spyros Angelopoulos)
Description:
We invite expressions of interest by highly motivated young researchers for the 2021 Marie Sk?odowska-Curie postdoctoral fellowship program. The selected candidate will work with the Operations Research Group of the Laboratoire d'Informatique de Paris 6 <http://www.lip6.fr/> (LIP6) at Sorbonne University. LIP6 is one of the largest, and most active Computer Science departments within France, employing currently more than 150 permanent professors and research scientists.
The selected candidate, together with the supervisor, will submit a joint research project to the 2021 call. The topic is on emerging challenges in online computation such as learning-augmented online algorithms; a brief outline can be found at this link <https://webia.lip6.fr/~angelopouloss//marie-curie.pdf>. Candidates must have a proven record of academic excellence in Theoretical Computer Science or related ares such as theoretical foundations of Machine Learning, Optimization or Operations Research. They must have successfully defended their PhD thesis by October 12, 2021.
application:
Interested candidates may submit a CV with list of publications, a short statement of interest, and contact information of two references to
spyros.angelopoulos@lip6.fr <mailto:spyros.angelopoulos@lip6.fr>
by **September 6, 2021**. The selected candidate is expected to work jointly with the supervisor on the project, and the final deadline for applications is October 12, 2021.
Additional information concerning residency and other requirements can be found at the call for applications (link) <https://ec.europa.eu/research/mariecurieactions/actions/postdoctoral-fellowships>.
02
POSTDOC at Ben-Gurion University (Klim Efremenko)
DESCRIPTION:
My group at Ben-Gurion University has open postdoctoral and PhD positions,part of an ERC Starting Grant project. Excellent students with a strong background in Theoretical Computer Science and Mathematics, interested to conduct research in Error-Correcting Codes, Information Theory, Learning Theory, or Algorithm Design, are welcome to apply. The positions are supervised by myself (Klim Efremenko) at the Theory Group of Ben-Gurion University of the Negev, Israel. With respect to postdoctoral positions, an advantage will be given to candidates having a publication record at top/central venues. The position includes a generous salary, as well as generous funding for equipment and travel.
application:
Starting date, as well as duration, are flexible. Reviews of submitted applications will begin shortly and will continue until the positions are filled.
Please submit your CV, contact details (names, affiliations, and email addresses) of 2-4 referees, and a short cover letter to: klim@bgu.ac.il.
03
Quebec Canada，postdoctoral fellowship (Pelc, Andrzej)
Description:
A postdoctoral position in computer science is available at the Research Chair in Distributed Computing of the Universite du Quebec en Outaouais, Canada, under the supervision of Prof. Andrzej Pelc.
Duties: Research in the above areas. NO teaching duties.Knowledge of French is NOT necessary.
Duration: 12 months
Beginning: January 2022 (flexible)
Stipend: $45 000 per year (Canadian dollars).
Location: The Universite du Quebec en Outaouais is situated in Gatineau, across the river from Ottawa. The National Capital region of Ottawa offers a variety of possibilities for cultural and sports activities (swimming, sailing, hiking,skating, cross-country and downhill skiing). The campus of the University of Quebec is a 10 min. drive from downtown Ottawa.
Requirements:
* Ph.D. in Computer Science or Mathematics obtained between October 1, 2018 and September 30, 2021
* Strong academic background in algorithms and graph theory.
* Strong research record and potential in one or more of the following domains:
design and analysis of combinatorial algorithms
algorithmic aspects of distributed and parallel computing
algorithms for interconnection networks
algorithmic aspects of fault tolerance
Further information about the Research Chair in Distributed Computing, and about topics related to prospective postdoctoral research of the successful candidate can be obtained at: http://w3.uqo.ca/pelc/main.html and http://w3.uqo.ca/pelc/caldi/index.html
application:
applications including a detailed CV (with e-mail address),a statement of research interests, a complete list of publications,an abstract of Ph.D. Thesis and reprints (preprints) of 2 best papers should be sent in a zipped file by e-mail to pelc@uqo.ca
Please arrange to have three letters of reference sent directly to the same e-mail address. Deadline for applications and reference letters is September 10, 2021.
Informal enquiries at e-mail: pelc@uqo.ca
04
Postdoc positions at CISPA Saarbrucken (Algorithms & Complexity) (Marx)
DESCRIPTION:
CISPA Helmholtz Center for Information Security (Saarbruecken, Germany) offers several 2-year postdoc positions in the Algorithms & Complexity group of Daniel Marx. Currently we are hiring in ALL topics related to algorithms & complexity.
CISPA is a German national Big Science Institution within the Helmholtz Association. The working language of the institute is English. The positions are offered with an employment contract and come with social security and generous travel support. There are no teaching obligations associated with the positions. The starting date is flexible.
Strong candidates are sought in ALL theoretical areas related to algorithms and complexity, with particular focus on the following topics:
graph algorithms
combinatorial optimization
parameterized algorithms and complexity
The candidates for the postdoc positions should have (or expect to have shortly) a PhD degree in Computer Science or related area; research experience at postdoctoral level is of advantage. A successful candidate should have excellent knowledge of algorithms and/or complexity with a strong track record of published papers.
application:
applications for the positions should be submitted online on the CISPA website by *September 5, 2021* for full consideration:https://jobs.cispa.saarland/de_DE/jobs/apply/postdoctoral-researchers-3
The uploaded cover letter should
indicate that the application is to the group of Daniel Marx, and
provide names and addresses of 3 references.
Informal inquiries are welcome and may be sent to Daniel Marx ( marx@cispa.de ).
05
PhD positions in theoretical computer science and/or combinatorial optimization at Lund University (Jakob Nordstram)
DESCRIPTION:
The CS department at Lund University invites applications for PhD positions in theoretical computer science and/or combinatorial optimization.
The PhD students will be working in the Mathematical Insights into Algorithms for Optimization (MIAO) group headed by Jakob Nordstrom, which is active at both Lund University and the University of Copenhagen on either side of the Oresund Bridge.
The MIAO research group has a unique profile in that we are doing cutting-edge research both on the mathematical foundations of efficient computation and on state-of-the-art practical algorithms for real-world problems. This creates a very special environment, where we do not only conduct in-depth research on different theoretical and applied topics, but where different lines of research cross-fertilise each other and unexpected and exciting synergies often arise. Much of the activities of the group revolve around powerful algorithmic paradigms such as, e.g., Boolean satisfiability (SAT) solving, Gr?bner basis computations, integer linear programming, and constraint programming. This leads to classical questions in computational complexity theory?though often with new, fascinating twists?but also involves work on devising clever algorithms that can exploit the power of such paradigms in practice.
We currently have one opening for a theoretically oriented PhD student, funded by a Consolidator Grant from the Swedish Research Council, and one more applied opening financed by the Wallenberg AI, Autonomous Systems and Software Program (WASP). There is a lot of flexibility as to what kind of research the PhD students will pursue, though, and all candidates are welcome, both those who want to go deep into either theory or practice and those who are inspired by the challenge of bridging the gap between the two.
These are four-year full-time employed positions, but PhD positions usually (though not necessarily) include 20% teaching, in which case they are prolonged for one more year. The starting date is negotiable but should ideally be as early as possible during the autumn of 2021. All positions in the research group are fully funded, employed positions (including travel money) that come with an internationally competitive salary.
application:
The application deadline is September 13, 2021. See http://www.jakobnordstrom.se/openings/PhD-Lund-210913.html for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to jakob.nordstrom@cs.lth.se.
硕士、博士申请交流群
关注本公众号
后台回复
“硕士申请” 或 “博士申请”
加入【欧洲】【英国】【德国】【北欧】【北美】【亚洲】【CSC】等硕士、博士申请交流群
