Search
Combinatorics of 3D Maps – 3DMaps
Combinatorial maps, which are graphs embedded on 2D surfaces (and which can be naturally related to triangulations of such surfaces), have been successfully studied in various domains of computer science. The purpose of this proposal is to study 3D maps, seen as a natural generalization of 2D combin
Security Evaluation of Lightweight Encryption using new Cryptanalysis Techniques – SELECT
In the last decades, we have seen a large deployment of smart devices and contact-less smart cards, with applications to the Internet of Things and smart cities. These devices have strong security requirements as they communicate sensitive data, but they have very low resources available: constraine
Randomness generation for advanced cryptography – RAGE
The rise of the Internet over the last decades has significantly impacted our privacy, with the multiplication of online services that store private information. This trend has even accentuated with the era of Big Data, as personal data have become valuable. Traditional encryption does not really he
Species, Syntax and Semantics – SSS
The project S3 will develop new theoretical tools in order to obtain a fine understanding of resource usage by programs -- at the heart of complexity analysis and optimisation in programming languages. The major difficulty that we will address is the interaction between inputs which are single-use a
Opinion dynamics in social networks in presence of multiple decision-makers – NICETWEET
The general objective of the NICETWEET project is to develop a new and complete methodology to analyze social behavior in presence of multiple DMs, and apply it to case studies of social interest (e.g., credence goods, telecommunication, and energy markets WP1: Analysis of advanced OD models in SNs
Exploring the Limits of Tractability – ELIT
The main goal of this project is to explore the limits of tractability of computational problems in the quest of complexity dichotomies, especially in domains that have been weakly explored so far in the literature, and through the lens of parameterized complexity. I.e., our aim is to tackle proble
Algorithmic and combinatorial aspects of knot theory – AlgoKnot
The project AlgoKnot aims at strengthening our understanding of the computational and combinatorial complexity of the diverse facets of knot theory, as well as designing efficient algorithms and software to study their interconnections. The study of knots as mathematical objects has triggered the e
Distributed Network Computing through the Lens of Combinatorial Topology – DUCAT
At the turn of the 21st century, a significant breakthrough has been achieved in distributed computing, by analyzing computation using tools from combinatorial topology. The topological approach led to numerous outstanding results regarding the design and analysis of distributed algorithms for a lar
Knowledge Compilation for Data Analysis – KCODA
The main goal of KCODA is to understand what optimization and learning problems can be solved efficiently when data is structured, which is the case when the data to be analysed is the answer set of a database query. Many algorithms exploits the structure of the query to solve aggregation problems m
Redundancy-free neuro-biological design of visual and auditory sensing – RUBIN-VASE
The goal of RUBIN-VASE is to design and validate novel variational models for the evolution of neuronal activations in the visual and auditory systems, naturally encoding the neurobiological principle of efficient representation. By focusing on modifications of the celebrated Wilson-Cowan equations
Complexity Theory with Discrete Differential/Difference Equations – DIFFERENCE
We propose to revisit classical mathematical logic, computability and complexity theory using discrete ordinary differential equations (dODEs), sometime also called finite differences. We recently demonstrated that dODEs provide a novel and original approach between the classical world of compute
Approximation and Randomised String Processing – PARSe
In this project we aim to study the foundations of processing large-scale, noisy string data. Our goal is to understand the limit of computations, and to provide new ultra-efficient algorithms and data structures for processing such data, inspired by approaches in hashing and high-dimensional geomet
Searching for Canonical Representations of Programs – REPRO
The REPRO project aims to: - deepen our understanding of the structure of computer programs by discovering canonical representations for fundamental programming languages, - explore their applications to the problems of program equivalence checking and program synthesis Two programs with code sour
Intelligent Estimation Algorithms for Smart Mobility – ArtISMo
In this project, we will propose original ideas and we will develop efficient estimation algorithms reconstructing the state variables necessary for the control and diagnosis of the autonomous and connected vehicle. The problems considered are the tracking of vehicles, the estimation of sensor and a
Numerical Safety for Computer-Aided Proofs – NuSCAP
The last twenty years have seen the advent of computer-aided proofs in mathematics and this trend is getting more and more important. They request various levels of numerical safety, from fast and stable computations to formal proofs of the computations. Hovewer, the necessary tools and routines are
Tackling hard problems in audio with Data-Efficient Non-linear InverSe mEthods – DENISE
DENISE aims at fundamental methodological contributions to the field of audio signal processing. Its promises are data-requirement savings and performance leaps that, in the long run, underlie strong economical and ecological benefits for the quickly-growing application field of audio technologies.
Covertness and Secrecy in the Wireless Physical Layer – COSI
We study communication problems where undetectability or location privacy is required. Such secrecy requirements are important, e.g., for “smart devices” which only communicate scarcely to send short messages, where much sensitive information is contained not in the messages, but in who is sending t
Quantitative Reasoning Methods for Probabilistic Logics – QuaReMe
The goal of this project is to advance the state of the art regarding techniques for formally proving the correctness of programs that use probabilistic operations such as, e.g., random number generation. Importantly, our techniques will be quantitative, expressing numerical properties of programs r