Sort by
Refine Your Search
-
research for digital security and is a pioneer in developing highly innovative concepts, algorithms and systems for anomaly detection, cyber threat intelligence, penetration testing and cryptography. Through
-
working in the research group “Theory and Applications of Algorithms” at the Faculty of Computer Science. The position is limited to six months and is planned to be filled from 01.10.2025. Your future tasks
-
outstanding candidates whose work lies at the intersection of statistics, machine learning, data analytics and modern AI algorithms. This includes, in particular, statistics for high-dimensional and complex
-
Innsbruck and help bring quantum computing to its full potential. The ideal candidate has achieved excellent research results in several of the following fields: Quantum algorithms Quantum complexity Quantum
-
, virtual assistants, or AI-driven systems such as chatbots, recommender algorithms, or generative AI. The position focuses on how communicative processes are shaped by and shape these technologies
-
the 2D plane is a long-studied problem in robotics resulting in a broad spectrum of feasible methods and algorithms. However, performance relies heavily on the problem itself, the robot, the environment
-
of algorithms to control various types of systems. Starting from low energy applications like electronics and drive systems, via (large-scale) robotics to heavy industrial applications. We are working in projects
-
Responsive Sensing and Analytics team specialises in developing efficient and scalable algorithms designed to equip emergency services with critical safety information and analytical insights. Leveraging
-
Responsive Sensing and Analytics team specialises in developing efficient and scalable algorithms designed to equip emergency services with critical safety information and analytical insights. Leveraging
-
group “Foundations of Cryptography” within the research group “Theory and Applications of Algorithms” at the department of Computer Science focuses on provable security of cryptographic schemes. We