December 11, 2024

Four papers accepted to SODA (Symposium on Discrete Algorithms)

Four research papers from the “Big Data Algorithms” research group have been accepted for presentation at the A*-ranked ACM-SIAM Symposium on Discrete Algorithms (SODA). SODA is the top conference in the field of algorithms and one of the most prestigious conferences in theoretical computer science. In 2025, the conference will take place in mid-January in New Orleans. The “Big Data Algorithms” research group has been based at the University of Salzburg since 2022 and is led by Prof.

December 4, 2024

Congratulations on the Successful Dissertation Defenses

Within just a few days, the Department of Computer Science had the pleasure of celebrating two successful dissertation defenses together with the doctoral candidates, their friends, and families. After years of intensive and diligent work, Gregor Bankhamer (left in the picture) and Tijn de Vos (right in the picture) successfully completed their doctorates. Mr. Bankhamer focused in his dissertation, titled “Randomized Algorithms for Distributed Consensus and Local Failover Routing,” on two fundamental problems in distributed systems.

November 20, 2024

Ana Sokolova: New Impulses for Formal Methods at the Paris Lodron University Salzburg

Ana Sokolova: New Impulses for Formal Methods at the Paris Lodron University Salzburg On October 1, 2024, Ana Sokolova assumed the professorship for Formal Methods at the Department of Computer Science at the Paris Lodron University Salzburg (PLUS). This appointment underscores the growing importance of this research field for the university and marks a strong commitment to the advancement of formal computer science. Ana Sokolova was born in 1971 in Skopje, North Macedonia (then Yugoslavia), and graduated in 1989 from the renowned Mathematics and Computer Science High School Rade Jovčevski Korčagin.

October 24, 2024

teampool Awards Scholarships to Computer Science Students at Paris Lodron University Salzburg

On Wednesday, 23rd of October 2024, teampool personal service gmbh recognized nine outstanding computer science students from Paris Lodron University Salzburg (PLUS) with scholarships and prizes totaling €75,000. Three students received new scholarships, three existing scholarships were extended, and three bachelor theses were awarded €1,000 each. New Scholarships for Computer Science Talents Students Anna Jambura, Felix Kipman, and Mateja Jakovic are delighted to receive new scholarships amounting to €1,000 per month.

October 9, 2024

High-Performance Data Network ACOnet: The Future of Knowledge

On October 9, 2024, an informative and forward-looking event on “The Future of Knowledge: Digital Resource Management” took place in the Library Auditorium of the Paris Lodron University Salzburg (PLUS). Experts from the fields of art and culture, libraries, and IT services were invited. The audience included representatives from various institutions, including Mozarteum, Landestheater, SALK, Land Salzburg, Haus der Natur, Museum der Moderne, Salzburg Festival Fund, City of Salzburg, Salzburg University of Applied Sciences, and PMU.

October 7, 2024

Informatik Austria Takes Responsibility

Successful Lecture Series “Sustainability in Computer Science” Sets the Course for the Future Following its great success in the previous academic year, the second nationwide public lecture series, “Sustainability in Computer Science,” will start on Monday, October 7, 2024. This lecture series is unique in Austria, as all Austrian faculties and institutes of computer science are participating under the umbrella of informatik_austria. The series aims to raise awareness of the critical importance of sustainability in computer science, present research solutions, and initiate developments for a sustainable future.

December 1, 2023

Young Investigators Award 2023 for Tijn de Vos

Tijn received this award for their work on distributed quantum computing. Together with Joran van Apeldoorn, they developed a new framework to employ parallel quantum query algorithms in the CONGEST model. They use this framework to break multiple classical lower bounds, including cycle detection, girth computation, meeting scheduling, and element distinctness. In particular, they show a novel exponential separation for exact CONGEST algorithms by solving a distributed version of the Deutsch-Jozsa problem.