2 papers
cs.SI2021
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models
Da Qi Chen, Lin An, Aidin Niaparast +2
We consider an information dissemination problem where the root of an undirected graph constantly updates its information. The goal is to keep every other node in the graph about t…
math.CO2020
Order-isomorphic twins in permutations
Boris Bukh, Oleksandr Rudenko
Let be a permutation of . Two disjoint order-isomorphic subsequences are called \emph{twins}. We show that every permutation of contains twins of length…