–
Sala P3.10, Pavilhão de Matemática
Tomás Oliveira, Instituto Superior Técnico
Resilience of code-based secret sharing schemes against low-complexity side-channel attacks
Tomás Oliveira, Instituto Superior Técnico
Resilience of code-based secret sharing schemes against low-complexity side-channel attacks
Rui Zhu Wang, Instituto Superior Técnico
Bounds for the capacity of correlated deletion channels
Pedro Costa, Instituto Superior Técnico
On the Longest Common Subsequence between two random correlated strings
Warm-up question: Given two binary strings $s\in \{0,1\}^n$ and $t\in \{0,1\}^{n+k}$, we say $s$ is the result of a k-deletion on $t$ if $s$ is a (not necessarily contiguous) substring of $t$, which we denote by $s\subseteq t$. Given $s\in \{0,1\}^n$ and $k\in \mathbb{N}$, consider
\begin{equation*}
A_{s,k} =\{ t\in \{0,1\}^{n+k} \colon s\subseteq t \}.
\end{equation*}
Determine the size of $A_{s,k}$ in terms of $s$ and $k$.
Rafael Gomes, Instituto Superior Técnico
O Problema do Caixeiro Viajante
Tianyu Zhang, Instituto Superior Técnico
Classificação de nós com redes neuronais de grafos em redes de pequena escala