Predoctoral University Assistant Big Data Algorithms

The Paris Lodron University Salzburg (Computer Science, Big Data Algorithms Group) is currently seeking a Predoctoral University Assistant:

• Application deadline: 06.05.2026
• Salary Category: B1 UA without PhD
• Job Category: Scientific Staff
• Job Profile: University Assistant without PhD
• Employment Start: October 2026
• Hours per week: 30 h/w
• Duration of Contract: Temporary
• Temporary Employment: 4 years

Your Responsibilities

• Academic support in research and teaching activities in the division Big Data Algorithms – The research focuses on efficient graph algorithms. The goal is to develop algorithms for solving clustering, distance, flow, or cut problems that are as well-suited as possible to dynamic, parallel, or distributed computing models. It is expected that rigorous correctness and running time proofs will be provided for the algorithmic solutions and published in relevant international journals.
• Independent research: writing and publishing a dissertation as part of completing the relevant doctoral program at the University of Salzburg
• Independent teaching: preparation, delivery, and follow-up of courses (including examination duties) in accordance with the provisions of the collective agreement
• Administrative tasks

Admission Requirements

• Completed diploma or master’s degree in computer science or a related field; basic experience in designing efficient algorithms;
• excellent written and spoken English skills;
• Enrollment in a subject-specific doctoral program at the University of Salzburg.

Desired Qualification

• Experience in describing complex technical concepts, publications or manuscripts in the field of algorithms or theoretical computer science;
• excellent programming skills, preferably in C++;
• Desired personal qualities: willingness to learn, ability to work under pressure, teamwork skills, ability to work independently.

Organisational Unit

The Big Data Algorithms group conducts fundamental research on the design and analysis of prior-free algorithms, with a strong emphasis on theoretical foundations and mathematical methodology. The research agenda is shaped by current developments such as the slowing of Moore’s Law and the increasing importance of “big” and “fast” data. Particular attention is given (a) to distributed and dynamic algorithms that operate efficiently in complex and evolving environments and (b) to integrating machine learning approaches with traditional algorithm design techniques. Graphs form a central methodological framework, serving as an abstract model for a wide range of real-world networks, including communication systems, social structures, and infrastructure networks.

Contact

Univ.-Prof. Dipl.-Ing. Dr. BSc. Sebastian Forster

Head of Big Data Algorithms Group

Jakob-Haringer-Str. 2, 5020 Salzburg

Tel.: +43 662 8044-6421 E-Mail: 

Apply Now:  University of Salzburg