-
This dissertation studies the expressivity and completeness of the coalgebraic µcalculus. This logic is a coalgebraic generalization of the standard µ-calculus, which creates a uniform framework to study different modal fixpoint logics. Our main objective is to show that several important results...
-
I come from a generation that grew up with the smartphone. The small gadget has been in my hand for almost 20 years, and has been my primary source of communication with the world. Not just talking to my family and friends, but my affairs are increasingly handled through my phone.
I opened my ...
-
Imagine attending the PhD defence of the author of this dissertation and uttering the sentence 'Someone is reading this dissertation.'. You can use 'someone' to refer to a friend sitting in front of you, whom you know. But you can also use 'someone' to refer to a person in the audience, whom you ...
-
This thesis explores position-based quantum cryptography zooming in on the task of position verification. In position verification, the idea is to use an individual's geographical location as a cryptographic credential. Practically, such protocols can authenticate that a message originated from a...
-
With the possible advent of large-scale fault-tolerant quantum computers in the next decades, one has to think about the implications very carefully. One of the most influential task such quantum computers are capable of is breaking currently widely used asymmetric encryption schemes. So for clas...
-
Good algorithms exhibit three key qualities: speed, accuracy, and optimal objective value. We explore the interaction among these criteria through optimization problems grounded in practical applications while maintaining a theoretical perspective. Our research focuses on developing algorithms th...
-
This dissertation addresses the challenge of combining uncertain, partial and possibly mutually contradictory evidence with a focus on logic and computational complexity. In this context, 'evidence' is represented as a subset of a universe; 'uncertainty' as values between 0 and 1; 'partiality' as...
-
Optimization is the process of selecting the best option from all possibilities, and problems related to finding the best option among many options are called optimization problems. A few examples of such problems are route picking, partial loading, crew scheduling, and portfolio optimization, an...
-
When we speak, write or listen, we continuously make predictions based on our knowledge of a language's grammar. Remarkably, children acquire this grammatical knowledge within just a few years, enabling them to understand and generalise to novel constructions that have never been uttered before. ...
-
The vast array of collective decision-making scenarios that occur in the real world has provided a wealth of examples for computational social choice researchers to model and analyse. The field of computational social choice has taken the perspective of computer science in studying the methods us...
-
This thesis explores the interplay between representation theory and quantum information.
Specifically, we focus on mixed Schur–Weyl duality, which considers the action of the unitary group on mixed tensors.
This setting naturally arises in quantum information tasks involving unitary-equivarian...