EUDML

Currently displaying 1 – 6 of 6

Order by Relevance | Title | Year of publication

Approximate counting : an alternative approach

Peter Kirschenhofer; Helmut Prodinger — 1991

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A coin tossing algorithm for counting large numbers of events

Peter Kirschenhofer; Helmut Prodinger — 1992

Mathematica Slovaca

Skip lists - some results on a recent data structure.

Kirschenhofer, Peter — 1994

Séminaire Lotharingien de Combinatoire [electronic only]

A note on alternating sums.

Kirschenhofer, Peter — 1996

The Electronic Journal of Combinatorics [electronic only]

Finite and periodic orbits of shift radix systems

Peter Kirschenhofer; Attila Pethő; Paul Surer; Jörg Thuswaldner — 2010

Journal de Théorie des Nombres de Bordeaux

For $r = (r_{0}, ..., r_{d - 1}) \in ℝ^{d}$ define the function $τ_{r} : ℤ^{d} \to ℤ^{d}, z = (z_{0}, ..., z_{d - 1}) \mapsto (z_{1}, ..., z_{d - 1}, - ⌊rz⌋),$ where $rz$ is the scalar product of the vectors $r$ and $z$ . If each orbit of $τ_{r}$ ends up at $0$ , we call $τ_{r}$ a shift radix system. It is a well-known fact that each orbit of $τ_{r}$ ends up periodically if the polynomial $t^{d} + r_{d - 1} t^{d - 1} + \dots + r_{0}$ associated to $r$ is contractive. On the other hand, whenever this polynomial has at least one root outside the unit disc, there exist starting vectors that give rise to unbounded orbits. The present paper deals with the...

On a class of combinatorial Diophantine equations.

Kirschenhofer, Peter; Pfeiffer, Oliver — 2000

Séminaire Lotharingien de Combinatoire [electronic only]

Page 1

Download Results (CSV)

Advanced Search