M
Michael Drmota
Researcher at Vienna University of Technology
Publications - 217
Citations - 4101
Michael Drmota is an academic researcher from Vienna University of Technology. The author has contributed to research in topics: Central limit theorem & Random binary tree. The author has an hindex of 29, co-authored 211 publications receiving 3862 citations. Previous affiliations of Michael Drmota include University of Vienna & University of Reading.
Papers
More filters
Journal ArticleDOI
The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees
Brigitte Chauvin,Michael Drmota +1 more
TL;DR: The purpose of this article is to show that the distribution of the longest fragment in the random multisection problem after k steps and the height of m-ary search trees are not only closely related in a formal way but both can be asymptotically described with the same distribution function that has to be shifted in a proper way (travelling wave).
Journal ArticleDOI
On the imperfection sensitivity of complete spherical shells
TL;DR: In this paper, the imperfection sensitivity of elastic complete spherical shells under external pressure is studied for axisymmetric deformations and qualitatively different types of imperfections by means of a numerical analysis of the Reissner shell equations.
Posted Content
The Shape of Unlabeled Rooted Random Trees
TL;DR: In this article, the authors consider the number of nodes in the levels of unlabeled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to the local time of a standard Brownian excursion.
Journal ArticleDOI
The expected profile of digital search trees
TL;DR: This analysis is surprisingly demanding but once it is carried out it reveals an unusually intriguing and interesting behavior of the average profile in a DST built from sequences generated independently by a memoryless source.
Proceedings ArticleDOI
Precise Asymptotic Analysis of the Tunstall Code
TL;DR: An algebraic characterization of the Tunstall code is proposed which, together with tools like the Mellin transform and the Tauberian theorems, leads to new results on the variance and a central limit theorem for dictionary phrase lengths.