1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2019★ 1 cited
A Combinatorial Identity for Rooted Labeled Forests
Benjamin Hackl
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that p…
stat.AP2014
A statistical noise model for a class of Physically Unclonable Functions
Benjamin Hackl, Daniel Kurz, Clemens Heuberger +2
The interest in "Physically Unclonable Function"-devices has increased rapidly over the last few years, as they have several interesting properties for system security related appl…