#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1987

2019

- This year (2)
- Last 5 years (13)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Michael Drmota
- 1997

The aim of this paper is to discuss the asymptotic properties of the coefficients of generating functions which satisfy a system of functional equations. It turns out that under certain general… (More)

- Michael Drmota
- 2009

Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During the last years research related to (random)… (More)

- Michael Drmota
- 2001

In a tree, a level consists of all those nodes that are the same distance from the root. We derive asymptotic approximations to the correlation coefficients of two level sizes in random recursive… (More)

- Michael Drmota
- 1996

In the first part of the paper we show that the L 2 -discrepancy with respect to squares is of the same order of magnitude as the usual L 2 - discrepancy for point distributions in the K -dimensional… (More)

- Michael Drmota
- 2000

By using a generating function approach it is shown that certain functionals of digitial expansion (related to speciic nite linear recurrences), e.g. the number of speciic digital patterns, satisfy a… (More)

We study the discrepancy D N of sequences \(\left (\mathbf{z}_{n}\right )_{n\geq 1} = \left (\left (\mathbf{x}_{n},y_{n}\right )\right )_{n\geq 0} \in \left [\left.0,1\right.\right )^{s+1}\) where… (More)

The Thue-Morse sequence is a classical example of an almost periodic (or uniformly recurrent) sequence in the sense that its associated symbolic dynamical system is minimal. We prove that the… (More)