• Xin Wei, Separating hash families with large universe

    Room B332 IBS (기초과학연구원)

    Separating hash families are useful combinatorial structures that generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of the universe for a $t$-perfect

  • Xavier Goaoc, TBA

    Room B332 IBS (기초과학연구원)
  • Sarah Morell, Unsplittable Transshipments

    Room B332 IBS (기초과학연구원)

    We consider an arc-capacitated directed graph $D=(V,A)$, where each node $v$ is associated with a rational balance value $b(v)$. Nodes with negative balance values are referred to as sources, while