Tenure-track Assistant and Associate Professorship positions in Algorithms
at Syddansk Universitet
Danmark, , Denmark -
Start Date | Expiry Date | Salary | Posted On | Experience | Skills | Telecommute | Sponsor Visa |
---|---|---|---|---|---|---|---|
Immediate | 24 Mar, 2025 | Not Specified | 22 Jan, 2025 | N/A | Good communication skills | No | No |
Required Visa Status:
Citizen | GC |
US Citizen | Student Visa |
H1B | CPT |
OPT | H4 Spouse of H1B |
GC Green Card |
Employment Type:
Full Time | Part Time |
Permanent | Independent - 1099 |
Contract – W2 | C2H Independent |
C2H W2 | Contract – Corp 2 Corp |
Contract to Hire – Corp 2 Corp |
Description:
The new campus in Vejle of the University of Southern Denmark (SDU) is set to become an international IT research and educational environment. The campus will consist of two research centres aiming to be world-class research environments in computer science, artificial intelligence, interactive technology, and software engineering. SDU Vejle is a collaboration between the Department of Mathematics and Computer Science and the Maersk Mc-Kinney Moller Institute at SDU. The campus will be based on the philosophy of these well-established research environments where curiosity, creativity, and innovation thrive. SDU Vejle will welcome its first students in 2026. By 2032, we aim for the Vejle campus to host over 1200 Danish and international students, employ more than 90 academic staff members, and annually graduate 300 skilled and highly sought-after IT students. Learn more about the new campus in Vejle here .
The preferred starting date is August 1, 2025, or as soon as possible thereafter.
Application deadline: 24 March 2025 at 23:59 hours local Danish time.
WHAT WE ARE LOOKING FOR
Hired candidates will join the Algorithms Section and the new SDU Centre for Computer Science and Artificial Intelligence in Campus Vejle. More information about these environments and the hosting department and faculty is given in the next sections.
We encourage applications from researchers that can complement or strengthen the competences of the section. We are seeking candidates with a strong research record within efficient algorithms, broadly understood as spanning from algorithms engineering to complexity theory. Examples of interesting research areas include, but are not limited to, approximation algorithms, combinatorial optimization, cryptology, data structures, fine-grained complexity, and algorithmic research bridging to ML/AI.
Responsibilities:
Please refer the Job description for details
REQUIREMENT SUMMARY
Min:N/AMax:5.0 year(s)
Education Management
Teaching / Education
Education
BSc
Proficient
1
Danmark, Denmark