編者按：申請歐洲讀博通常需要碩士學(xué)位，一般不需要GRE也無需當(dāng)?shù)卣Z言，考一個(gè)雅思|托福成績即可申請。套磁是申請的關(guān)鍵。歐洲因其高福利著稱，讀博也不例外，如果可以拿到工作合同，讀博工資在當(dāng)?shù)匾褜儆谥挟a(chǎn)，并享受一切相關(guān)福利，畢業(yè)后申請當(dāng)?shù)赜谰踊蛞泼?，相比美國也簡單很多。例如我在德國拿到博士學(xué)位后工作半年，即具備申請德國永居的資格。

參考：普通家庭人十年留學(xué)史：DIY飛躍美德全獎(jiǎng)讀研讀博，為何最終落戶德國做個(gè)打工人？

我在德國讀博期間賺了200W

匯總 | 全球?qū)W術(shù)界博士(后)、教職工資福利大PK

作者 留德華叫獸 系美國Clemson大學(xué)數(shù)學(xué)碩士(運(yùn)籌學(xué)方向)、Ph.D. candidate，歐盟瑪麗居里學(xué)者，德國海德堡大學(xué)數(shù)學(xué)博士(離散優(yōu)化、圖像處理)，讀博期間前往意大利博洛尼亞大學(xué)、IBM實(shí)習(xí)半年，巴黎綜合理工訪問一季?，F(xiàn)任德國某汽車集團(tuán)無人駕駛部門，從事大數(shù)據(jù)和計(jì)算機(jī)視覺算法的研發(fā)。讀博期間創(chuàng)辦【運(yùn)籌OR帷幄】、【DIY飛躍計(jì)劃】社區(qū)并運(yùn)營至今，2020.08創(chuàng)辦【DeepMatch交友AI】社區(qū) ，知乎｜今日頭條｜微博等平臺科普自媒體創(chuàng)作者（近20w關(guān)注者）

▎以下是二月上旬的全球算法博士職位信息，大家注意deadline！

目錄

• 德國亞琛工業(yè)大學(xué)：Research associate at PhD or postdoc level (full-time) at DPO, RWTH Aachen University (Michael Schneider)

• 英國杜倫大學(xué)：Multiple Faculty Openings at Durham University Computer Science (Amitabh Trehan)

• 巴黎綜合理工學(xué)院：positions in Computer Science at Ecole Polytechnique (France) (Leo Liberti)

• 愛丁堡大學(xué)：Postdoctoral and PhD position in distributed privacy preserving learning algorithms at U. Edinburgh (Rik Sarkar)

• 荷蘭語魯汶大學(xué)：PhD position in Operations Research at KU Leuven (Ref. BAP-2021-28) (Roel Leus)

01

Research associate at PhD or postdoc level (full-time) at DPO, RWTH Aachen University (Michael Schneider)

The Deutsche Post Chair Optimization of Distribution Networks (DPO) at RWTH Aachen University is recruiting a research associate on either PhD or postdoctoral level at the earliest possible date.?

Teaching and research at DPO is devoted to the development of heuristic and exact algorithms for the solution and analysis of planning problems in logistics, especially in transportation, network design, location planning, and warehouse management.

We offer exciting and challenging teaching and research activities (also in the context of industry collaborations), in an open atmosphere with a young and highly motivated team.

The initial contract is for 3 years with the option to be extended.??

This is a full-time position. The salary is based on the German public service salary scale (TV-L).?

The successful candidate has the opportunity to pursue a doctoral degree (or a habilitation for postdocs).?

Further details on the position and on the application process can be found here:https://www.dpo.rwth-aachen.de/global/show_document.asp?id=aaaaaaaaaxaeswq?

For questions, please contact Prof. Dr. Michael Schneider (schneider@dpo.rwth-aachen.de).

02

Multiple Faculty Openings at Durham University Computer Science (Amitabh Trehan)

Durham University Computer Science <https://www.durham.ac.uk/departments/academic/computer-science/>? (a top-5 UK department) has multiple openings (11) at all levels (Assistant professor to full professor) in various areas of Computer Science. In particular, the department is diversifying and restructuring to create four new research groups centred around the themes of AI, Networks and Distributed Computing, Scientific Computing, and Vision, in addition to its well known Algorithms and Complexity group (ACiD) group. All the groups (except ACiD) are looking to expand in this round of hirings.

There are openings for strong candidates at any level to the new research group NESTiD: Network Engineering, Science and Theory in Durham <https://sites.durham.ac.uk/nestid> (*Please note the University and group websites are under redevelopment at the moment).* In particular, we are interested in hiring *in the broad domain of distributed computing and algorithms*, besides *network systems* and *network science*.

Please have a look at our website(s) and advertisements (below) for more detail.

For more details and informal discussions (about the NESTiD positions), please feel free to get in touch with Amitabh Trehan <http://www.amitabhtrehan.net> (Amitabh.trehan@durham.ac.uk), or (any aspect of the hirings) with the head of department Professor Gordon Love ( g.d.love@durham.ac.uk).

Durham <https://www.dur.ac.uk/> is the third oldest University of England, after Oxford and Cambridge, and like them, a Collegiate University. It is set in the very beautiful city of Durham <https://www.thisisdurham.com/>, home to the world heritage sites of Durham Cathedral and Castle.<https://www.durhamworldheritagesite.com/>

Applications are at the following links (with deadlines):

*Assistant Professor:*

https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=21000047&lang=en&src=JB10200

（Closing Date 22-Feb-2021）

*Associate Professor:*

https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=21000049&lang=en&src=JB10200

(Closing date: 08-March-2021)

*Professor*:

https://durham.taleo.net/careersection/du_ext/jobdetail.ftl?job=21000050&lang=en&src=JB10200

(Closing date: 22-March-2021)

Regards,

Dr. Amitabh Trehan

<https://www.dur.ac.uk/research/directory/staff/?mode=staff&id=19535>

Associate Professor

Computer Science

Durham University

03

positions in Computer Science at Ecole Polytechnique (France) (Leo Liberti)

Ecole polytechnique, leading engineering school in France, member of IP Paris, welcomes applications for several academic positions, jobs starting in september 2021:

• 1 Assistant Professor in Computer Science, specialty "Bioinformatics or Machine learning", full-time position
  

• 1 Professor in Computer Science, specialty "Cybersecurity, Distributed Algorithms or Computer Networking", full-time position

• 1 Professor in Computer Science, full-time position

• 1 part-time Assistant Professor in Computer Science, part-time teaching position

• 1 part-time Assistant Professor in Computer Science specialty "Big Data, Computer Graphics, C++", part-time teaching position

• 1 part-time Professor "Charg? de cours" in Computer Science, part-time teaching position

• 1 part-time Professor "Charg? de cours" in Computer Science specialty "Computer Networking", part-time teaching position

Full-time position holders are expected to join LIX, the joint CS lab of Ecole Polytechnique and CNRS (?https://www.lix.polytechnique.fr?). Part-time position holders combine their teaching activity at ?cole Polytechnique with a main job carried out in the academic or industrial sector.

Precise informations (and in particular contacts) regarding each of these job offers are available following the link:https://portail.polytechnique.edu/informatique/en/faculty-positions-computer-science?q=fr/recrutement

Applications are open until March 15, 2021.

Sincerely,

Marie-Paule Cani, CS department President

https://portail.polytechnique.edu/informatique/en

Gilles Schaeffer, LIX Director??https://www.lix.polytechnique.fr

https://www.polytechnique.edu/enhttps://www.ip-paris.fr/en/home-en/

04

Postdoctoral and PhD position in distributed privacy preserving learning algorithms at U. Edinburgh (Rik Sarkar)

A postdoctoral position is available at University of Edinburgh, in the are

a of distributed, privacy preserving algorithms and machine learning.

Duration: 1 year.? (starting summer 2021)

Application deadline: 5 Feb 2021.

For more details, see:http://homepages.inf.ed.ac.uk/rsarkar/positions/faircrowd.html <http://home

pages.inf.ed.ac.uk/rsarkar/positions/faircrowd.html>

PhD positions in related areas are also available.

Contact Dr. Rik Sarkar : rsarkar@inf.ed.ac.uk <mailto:rsarkar@inf.ed.ac.uk>

05

PhD position in Operations Research at KU Leuven (Ref. BAP-2021-28) (Roel Leus)

The Algorithms group of TU Eindhoven is offering a postdoc position in parameterized algorithms and kernelization, funded by the ERC Starting grant ?ReduceSearch?. For more information about the positions and how to apply, please visit:https://jobs.tue.nl/en/vacancy/postdoc-reducesearch-869807.html

For your convenience I have copied the text from this website below.

-- Bart M. P. Jansen

TU Eindhoven is offering a postdoc position for a talented and motivated researcher with a strong interest in algorithms and complexity. The research is supported by ERC Starting grant "Rigorous Search Space Reduction" and is aimed at advancing the theory of algorithmic preprocessing. The project investigates questions such as: why does preprocessing lead to such large speedups for some NP-hard problems? How does a preprocessing algorithm reduce the search space of the follow-up algorithm? Which aspects of a problem input make it amenable to preprocessing? How can new preprocessing algorithms be developed that deliver speedups of several orders of magnitude? These questions are tackled using the framework of parameterized complexity and kernelization, and are asked for a diverse set of NP-hard problems concerning graphs, logic, and constraint satisfaction.

The position is supervised by dr. Bart M. P. Jansen (https://www.win.tue.nl/~bjansen/)

-- Job requirements --

The postdoctoral candidate is required to have a strong background in algorithms or computational complexity. Experience within the domain of parameterized complexity, kernelization, or constraint satisfaction problems is a plus. Candidates are expected to be fluent in English, both oral and in writing, and to have obtained a PhD degree.

The postdoctoral candidate will be expected to conduct independent research on topics relevant to the above agenda, to publish this research at conferences and journals, and to cooperate with the PhD candidates and principal investigator of the ReduceSearch project. The position does not have any required teaching duties. If the postdoctoral candidate wishes to further their development by assisting with the daily supervision of master- or PhD students, there will be opportunities to do so.

The starting date is negotiable. A starting date in the first half of 2021 is preferred. The position is offered for a period of one year, which may be extended.

-- Conditions of employment --

A meaningful job in a dynamic and ambitious university with the possibility to present your work at international conferences. The position comes with ample travel budget to engage in research activities abroad.

A full-time employment for 1 year with the possibility of an extension.

You will have free access to high-quality training programs for research and valorization, professional development courses, and didactical courses of the TEACH training program.

A gross monthly salary (scale 10: ? 2.790 - ? 4.402 depending on experience) and benefits in accordance with the Collective Labor Agreement for Dutch Universities

A broad package of fringe benefits (including an excellent technical infrastructure, moving expenses, and savings schemes).

Family-friendly initiatives are in place, such as an international spouse program, and excellent on-campus children day care and sports facilities.

-- How to apply --

If you are interested in the postdoc position and would like to apply, please send us your application by using the 'apply for this job' button at the top of this page. Your application must contain the following documents:

• A motivation letter describing your background and reasons for applying for this position.

• A 1-page research statement describing research interests and goals.

• A detailed CV including a publications list and overview of presentations at scientific meetings.

• Names and contact information of two academic references.

You can upload only 5 documents up to 2 MB each. Please send us your application before February 28 , 2021. You can only apply using the "Apply now button" on the website of the Technical University of Eindhoven.

Screening of applicants will start as soon as applications are received and will continue until the positions have been filled.

-- About the research environment --

TU Eindhoven features a rich environment for algorithmic research. The cluster Algorithms, Geometry, and Applications, including full professors Mark de Berg and Bettina Speckmann investigates (parameterized, approximation, and classic) algorithms for problems in computational geometry and graph theory. The Combinatorial Optimization group (prof. Frits Spieksma) focuses on problems in scheduling and optimization, and includes algorithmic expert prof. Nikhil Bansal. In addition, TU Eindhoven is one of the four cornerstones of the NETWORKS project which investigates algorithmic and stochastic problems on complex networks. All combined, this research environment offers the postdoctoral researcher interesting possibilities for collaboration.

-- About TU Eindhoven --

TU Eindhoven (TU/e) is a mid-size technical university located in the heart of the high-tech industry in the Netherlands, named the Brainport region. Eindhoven is the fifth largest city in the Netherlands, and including suburbs it has about 420,000 inhabitants. TU/e is a highly ranked university both in research and education. Our training and research programs are highly regarded and we foster close relationships with companies, organizations and research institutes in the Brainport region and beyond. TU/e is a social and inspiring university with a fine culture. You?ll quickly feel at home, surrounded by people who share your scientific ambitions. The TU/e currently has nine departments, with over 11,000 students in total.

-- More information --

Further information with respect to the positions can be obtained from dr. Bart M. P. Jansen via b.m.p.jansen@tue.nl

Further information concerning employment conditions can be obtained from the HR Advisor for Mathematics and Computer Science via HRServices.MCS@tue.nl

—— 完 ——