Focus
We study fundamental questions in computer science, such as: Which optimization problems admit efficient solutions, how can algorithms remain robust under failures or changing inputs, and which cryptographic protocols admit formal security definitions? Our research spans algorithms and complexity, including (dynamic) graph algorithms, numerical linear algebra, cryptography & secure computation, and machine learning foundations.
Our research results, produced in various projects, are summarized in a number of publications.
Numerical High Perfomance Computing
Group Leader: Univ.-Prof. Dipl.-Ing. Dr. Wilfried Gansterer, M.Sc.
Professor Gansterer’s research centers on numerical linear algebra and high‑performance computing, with a focus on scalable algorithms for large, sparse, and ill‑conditioned problems. His work spans iterative methods and preconditioning, parallel and heterogeneous programming (multicore, GPU, and distributed systems), performance modeling, and energy‑aware scientific computing. He frequently collaborates on applications in data science, signal processing, and computational engineering, emphasizing reproducibility and robust software.
Algorithms and Optimization
Group Leader: Ass.-Prof. Dr.techn. Gramoz Goranci, M.Sc
Our group is broadly interested in algorithm design and its connections to optimization, graphs, and machine learning. Much of our recent work has focused on designing fast, dynamic algorithms for classic and novel large-scale problems, with both theoretical guarantees and practical efficiency. Our research brings together tools from combinatorial data structures, graph algorithms, spectral graph theory, and metric embeddings.
Homepage: Gramoz Goranci
Algorithm Engineering
Group Leader: Ass.-Prof. Dr. Kathrin Hanauer, B.Sc. M.Sc.
I am interested in the design, analysis, and experimental evaluation of fast algorithms and especially in Algorithm Engineering. Algorithm Engineering connects algorithm theory with practice and focuses on the performance of algorithms in real-life scenarios. Besides what is typically considered a “fast” algorithm (one that runs in polynomial time and with a small exponent), my research is also concerned with so-called “intractable” problems with exponential worst-case running time.
Foundations of Cryptography
Group Leader: Ass.-Prof. Mag.art. Karen Azari, BSc MSc Ph.D.
Cryptography is concerned with securing digital communication, computation, and storage of sensitive data. The research group "Foundations of Cryptography" focuses on provable security of cryptographic schemes, where lasting security can be guaranteed through mathematical security proofs. Particular areas of interest are secure group messaging, proof systems for decentralized systems, and (foundations of) resource-restricted cryptography.
