Translated using DeepL

Machine-translated page for increased accessibility for English questioners.

Colloquium of the Faculty of Informatics

The Computer Science Colloquium is held on Tuesdays at 2:30 pm during the semester. The goal of the colloquium is to present current research in various areas of computer science to a broad audience of faculty.

Time and location

  • Regularly every Tuesday during the teaching part of the semester
  • 14:30-15:30
  • lecture room A217, Faculty of Computer Science MU, Botanická 68a, Brno
  • usually preceded by an informal meeting with the speaker
    • 14:00-14:30
    • A220
    • Light refreshments (coffee, tea) available

Schedule - Spring 2026

Coming up Date Speakers Title
17/2 There is no colloquium this week.
24/2 Marika Hrubá,Antonín Zita (Department of Technical Education MU) Open Science: From Principles to Daily Research Practice
3/3 Lab Fest: AGDM, EMLAB Block of presentations by faculty research groups for the academic community
10/3 César Sánchez (IMDEA Madrid) Safe Reinforcement Learning Using Shield Synthesis for LTL Modulo Theories
17/3 Piotr Faliszewski (AGH University of Kraków) How Algorithm Design Can Save Participatory Budgeting
24/3 Bára Kozlíková (FI MU) Challenges in Data Visualizations and Building Trust in Them
31/3 Mirek Klimoš (Lithic, Inc., Brno) Learning to Work with AI: Lessons from a US Tech Startup
7/4 Boris Janča,TBA (Teiresias Centre MU) TBA
14/4 CoFI break Informal meeting of academic staff with dean and faculty management
21/4 Jan Hůla (CIIRC CTU, IRAFM UO) TBA
28/4 Jan Vítek (Northeastern University, CUNI) Verse - designing a new programming language for the Metaverse
5/5 Dirk Beyer (LMU Munich) TBA
12/5 Petra Budíková (VisionCraft s.r.o.) TBA
19/5 PhD Fest: Jan Jedelský, Anna Řechtáčková Block of presentations by PhD students of the faculty

Lectures - Spring 2026

Marika Hrubá,Antonín Zita 2/24/2026 2:30 pm Auditorium A217

Open Science: From Principles to Daily Research Practice

This session briefly introduces key elements of open science in everyday research practice, including open licenses, trusted repositories, and the main differences between institutional and disciplinary repositories. It also addresses research data management, with a focus on data management plans and practical support through tools such as the Data Stewardship Wizard. The session concludes by outlining the types of open science support available at university and faculty level and where researchers can seek practical guidance.

Lab Fest 3/3/2026 2:30 pm Auditorium A217

Lab Fest, held as part of the Informatics Colloquium, aims to provide the academic community with an overview of the activities of research groups at the Faculty, specifically their staffing, areas of interest, involvement in grants, ongoing collaborations at the University, in the Czech Republic or internationally; future directions and current research or development results.

AGDM: TBA

EMLAB: TBA

César Sánchez 3/10/2026 2:30 PM Room A217

Safe Reinforcement Learning Using Shield Synthesis for LTL Modulo Theories

In recent years, machine learning models and in particular reinforcement learning (RL) have achieved remarkable success in various domains, including sequential decision makers. However, these models tend to exhibit unsafe behaviors, precluding their deployment in safety-critical systems. To cope with this issue, considerable research focuses on developing methods that guarantee the safe behavior of a given RL model, also referred to as "Safe Reinforcement Learning".

A prominent approach to safe RL is shielding which incorporates an external component generated using formal methods, called a shield, that blocks or corrects unwanted behavior. Despite significant progress, shielding suffers from a major setback: classical shielding starts from properties in propositional temporal logics, typically LTL, and is unsuitable for richer logics. This, in turn, limits the widespread applicability of shielding in many real-world systems where the dynamics are complex.

In this work, we address this gap, and extend shielding to LTL modulo theories, by building upon recent advances in reactive synthesis modulo theories. LTL modulo theories allows the use of both temporal modalities and literals for arbitrary theories. This has allowed us to develop a novel approach for generating shields conforming to

complex safety specifications in these more expressive, logics.

This is a "neurosymbolic" solution, in the sense that we build a system that combines the complex goals and behaviors of RL with the safety guarantees of formal synthesis.

The roadmap of the talk is to (1) motivate safe reinforcement learning (2) introduce temporal logic and reactive synthesis (3) present our work on synthesis modulo theories, (4) describe how to extend synthesis modulo theories for shielding.

Piotr Faliszewski 3/17/2026 2:30 PM Auditorium A217

How Algorithm Design Can Save Participatory Budgeting

In a participatory budgeting election, the goal is to choose which projects among those submitted by the citizens should be implemented in a given city. The city fixes some budget, people submit project ideas---such as building bike paths, running various festivals, or offering language classes---each with a different cost, and eventually the citizens vote on which of these projects are carried out. While many cities implement participatory budgeting, most of them use very basic voting rules that do not ensure proportional representation of the voters and that have a number of drawbacks. For example, a fairly small, coordinated group of citizens can hijack the whole budget. In this talk I will present Method of Equal Shares---a voting rule recently proposed by Pierczynski, Peters and Skowron---that has strong proportionality guarantees, and I will tell the story of how this rule moved from a theoretical concept to being applied in practice. This story includes a number of algorithmic and computational complexity developments that were needed to make it feasible (in particular, to explain the sometimes surprising results that the rule can provide). During the talk I will also discuss several other participatory budgeting rules and compare them to Method of Equal Shares.

Bára Kozlíková 3/24/2026 2:30 pm Room A217

Challenges in Data Visualizations and Building Trust in Them

Data visualization is a very powerful tool when analyzing and understanding complex data. However, there are many aspects that play a crucial role in this process. Among these belong not only the size and dimensionality of the data, but also the design decisions behind the appropriate visual representations and interactions with them, perceptual limitations of human cognitive system, and capabilities of diverse target audiences to properly interpret the representations. All these aspects highly influence the trust of the stakeholders in the visualization. In this talk, I will present the main aspects and challenges accompanying data visualization, connected to the three main pillars: data, users, and visuals enabling insight. The talk will conclude with several observations and recommendations for interdisciplinary collaboration aiming to build mutual trust between the project partners.

This talk is a part of the process of application for professorship.

Mirek Klimoš 31 March 2026 14:30 auditorium A217

Learning to Work with AI: Lessons from a US Tech Startup

The way knowledge workers operate has fundamentally changed in the last three years. In software engineering, AI coding tools have gone from curiosity to daily infrastructure - and AI skills are increasingly expected and tested in interviews. But what does this actually look like in practice, and what should it mean for how we teach computer science?

Drawing on the experience of adopting AI tools at a US fintech startup over the past two years, I'll share some lessons my company learned the hard way: why adoption is harder than it looks, how documentation debt becomes your AI's blind spot, and why some languages and frameworks lend themselves to AI-assisted development far better than others. Nobody knows what's coming next, but I'll share my perspective on what it takes to be an effective software engineer in this new world.

14 Apr 2026 14:00 KYPO (room S108)

CoFI break

Jan Vítek 4/28/2026 2:30 pm Room A217

Verse - designing a new programming language for the Metaverse

Verse is a new programming language being developed at Epic Games for building interactive experiences in the metaverse. Unlike traditional scripting languages for game engines, Verse is designed as a functional logic programming language with a rigorous theoretical foundation-the Verse calculus (VC), a core calculus for deterministic functional logic programming published at ICFP 2023. In this talk, I will discuss the design philosophy behind Verse and the key challenges of creating a language for a future where code runs in a single global simulation. Verse combines ideas from functional programming (immutability, higher-order functions, strong typing), logic programming (unification, choice, backtracking), and introduces novel features such as failable expressions, speculative execution with transactional rollback, and language-level concurrency. The language aims to be "metaverse first," with strong compatibility guarantees and an effect system that tracks side effects to ensure safe concurrent execution. I will explain how these theoretical concepts translate into practical language features and discuss the trade-offs we faced in designing a language that must be both accessible to game developers and capable of expressing complex concurrent and reactive systems. The talk will also touch on our experience deploying Verse in Fortnite's Unreal Editor and our vision for making Verse an open standard for metaverse development.

PhD Fest 5/19/2026 2:30 pm Room A217

Jan Jedelský: TBA

Anna Řechtáčková: TBA