www.acad.jobs : academic jobs worldwide – and the best jobs in industry
                
     
Position: Postdoc in Algorithms
Institution: Technical University of Denmark
Location: Kongens Lyngby, Lyngby‐Taarbæk Municipality, Denmark
Duties: You will engage in the pursuit of new, efficient discrete algorithms for computational problems involving interesting topics such as: graphs, geometry, data structures, dynamic updates, distributed computation, and more. You will work in collaboration with the postdoc adviser, associate professor Eva Rotenberg, who has a background in discrete algorithms, broadly, and graph algorithms, specifically. Together, we will study and discuss different hypotheses, problems, and ideas concerning important open problems in algorithms and data structures. Examples of areas we could approach together are (1) dynamic graph algorithms, that is, algorithms for graphs that undergo changes or updates, and (2) planar and graph-related computational geometry
Requirements: As a formal qualification, you must hold a PhD degree (or equivalent) by the time of employment. Your skill set should include design and analysis of algorithms and/or data structures. Good skills in scientific communication are appreciated, and we value both independence and the ability to engage in collaboration with peers. We expect that you have publications at relevant venues, e.g. STOC, FOCS, SODA, SOCG, ICALP, PODC, ESA, STACS
   
Text: Postdoc in Algorithms You will engage in the pursuit of new, efficient discrete algorithms for computational problems involving interesting topics such as: graphs, geometry, data structures, dynamic updates, distributed computation, and more. You will work in collaboration with the postdoc adviser, associate professor Eva Rotenberg, who has a background in discrete algorithms, broadly, and graph algorithms, specifically. Together, we will study and discuss different hypotheses, problems, and ideas concerning important open problems in algorithms and data structures. Examples of areas we could approach together are (1) dynamic graph algorithms, that is, algorithms for graphs that undergo changes or updates, and (2) planar and graph-related computational geometry As a formal qualification, you must hold a PhD degree (or equivalent) by the time of employment. Your skill set should include design and analysis of algorithms and/or data structures. Good skills in scientific communication are appreciated, and we value both independence and the ability to engage in collaboration with peers. We expect that you have publications at relevant venues, e.g. STOC, FOCS, SODA, SOCG, ICALP, PODC, ESA, STACS
Please click here, if the job didn't load correctly.







Please wait. You are being redirected to the job in 3 seconds.