41 citations · 121 across the 26 of their papers we have counts for
3 papers · 1 filter
Asymmetric Rényi Problem
Michael Drmota, Abram Magner, Wojciech Szpankowski
In 1960 Rényi in his Michigan State University lectures asked for the number of random queries necessary to recover a hidden bijective labeling of distinct objects. In each que…
Node Profiles of Symmetric Digital Search Trees: Concentration Properties
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang +1
We give a detailed asymptotic analysis of the profiles of random symmetric digital search trees, which are in close connection with the performance of the search complexity of rand…
Möbius orthogonality for the Zeckendorf sum-of-digits function
Michael Drmota, Clemens Müllner, Lukas Spiegelhofer
We show that the (morphic) sequence is asymptotically orthogonal to all bounded multiplicative functions, where denotes the Zeckendorf sum-of-digits function.…