3 citations · 4 across the 3 of their papers we have counts for
3 papers
math.PR2013★ 3 cited
Uniform spanning trees on Sierpinski graphs
Masato Shinoda, Elmar Teufl, Stephan Wagner
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for…
cs.CR2012
Memoryless Near-Collisions, Revisited
Mario Lamberger, Elmar Teufl
In this paper we discuss the problem of generically finding near-collisions for cryptographic hash functions in a memoryless way. A common approach is to truncate several output bi…
math.GR2012★ 1 cited
Linear and projective boundary of nilpotent groups
Bernhard Krön, Jörg Lehnert, Norbert Seifter +1
We define a pseudometric on the set of all unbounded subsets of a metric space. The Kolmogorov quotient of this pseudometric space is a complete metric space. The definition of the…