Robert Ernstbrunner

Robert Ernstbrunner is a researcher affiliated with the Faculty of Computer Science, contributing to algorithm development and parallel computing. His work focuses on low-rank approximations and fault-tolerant strategies in linear algebra methods.

Research Interests: His research spans computational efficiency, numerical linear algebra, and fault tolerance in high-performance computing environments. Key areas include sparse matrix operations and resilience mechanisms for iterative algorithms.

Publications: He has published two peer-reviewed papers: (1) a 2022 study on precision-cost trade-offs in low-rank matrix approximations, and (2) a 2020 framework for node-failure resilience in iterative linear algebra methods.

Academic Activities: Robert has presented at international conferences, including the 2022 IEEE IPDPS and the 2020 FTXS workshop.