#### Filter Results:

- Full text PDF available (35)

#### Publication Year

1976

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Philippe Flajolet, Peter J. Grabner, Peter Kirschenhofer, Helmut Prodinger, Robert F. Tichy
- Theor. Comput. Sci.
- 1994

Flajolet, Ph., P. Grabner, P. Kirschenhofer, H. Prodinger and R.F. Tichy, Mellin transforms and asymptotics: digital sums, Theoretical Computer Science 123 (1994) 291-314. Arithmetic functions… (More)

- Peter J. Grabner, Clemens Heuberger, Helmut Prodinger
- Theor. Comput. Sci.
- 2004

Abstract. We discuss an optimal method for the computation of linear combinations of elements of Abelian groups, which uses signed digit expansions. This has applications in elliptic curve… (More)

Let ν(n) denote the number of 1’s in the binary representation of n. Properties of this function have been extensively studied in the literature due partly to its natural and frequent appearance in… (More)

- GREGORY DERFEL, Peter J. Grabner, F. Vogl
- 2005

Diffusion on fractals has been studied extensively as a generalisation of usual Brownian motion on manifolds. After its introduction in the physics literature (cf. [30]) M. Barlow and E. Perkins [3]… (More)

1. Introduction. Our starting point is the study of systems of numer-ation with respect to a general base from an arithmetical and a dynamical point of view. Let G = (G n) n≥0 be a strictly… (More)

- Peter J. Grabner, Arnold Knopfmacher, Helmut Prodinger
- Theor. Comput. Sci.
- 2003

For words of length n, generated by independent geometric random variables, we consider the mean and variance, and thereafter the distribution of the number of runs of equal letters in the words. In… (More)

A spherical design is a point configuration on the sphere, which yields exact equal-weight quadrature formulae for polynomials up to a given degree. Until now only very specific constructions for… (More)

- Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy
- Combinatorica
- 2002

with digits δl{0, 1} for 0 ≤ l ≤ L, where the digits are computed by the greedy algorithm: there is a unique integer L such that GL ≤ n < GL+1. Then n can be written as n = δLGL + nL with 0 ≤ nL < GL… (More)

- Peter J. Grabner, Clemens Heuberger
- Des. Codes Cryptography
- 2006

We study representations of integers n in binary expansions using the digits 0,±1. We analyze the average number of such representations of minimal “weight” (= number of non-zero digits). The… (More)

- Peter J. Grabner
- 2006

We study representations of integers n in binary expansions using the digits 0,±1. We analyze the average number of such representations of minimal “weight” (= number of non-zero digits). The… (More)