Helmut Prodinger

Discret. Math. Theor. Comput. Sci., 2007

The Last Descent In Samples Of Geometric Random Variables And Permutations.

[BibT_eX]

Ars Comb., 2007

On α-greedy expansions of numbers.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2007

Representations of Numbers as åk=-nn ek k\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach.

[BibT_eX]

[DOI]

Proceedings of the Infinity in Logic and Computation, International Conference, 2007

2006

The scientific works of Rainer Kemp (1949-2004).

[BibT_eX]

[DOI]

Markus E. Nebel

Theor. Comput. Sci., 2006

The register function for t-ary trees.

[BibT_eX]

[DOI]

Michael Drmota

ACM Trans. Algorithms, 2006

The number of distinct values in a geometrically distributed sample.

[BibT_eX]

[DOI]

Margaret Archibald

Eur. J. Comb., 2006

d-records in geometrically distributed random variables.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

The first descent in samples of geometric random variables and permutations.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

Asymptotics of the Moments of Extreme-Value Related Distribution Functions.

[BibT_eX]

[DOI]

Algorithmica, 2006

Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis.

[BibT_eX]

[DOI]

Algorithmica, 2006

On Redundant tau -Adic Expansions and Non-adjacent Digit Sets.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 13th International Workshop, 2006

2005

The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Analysis of linear combination algorithms in cryptography.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2005

Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Minimality of the Hamming Weight of the T-NAF for Koblitz Curves and Improved Combination with Point Halving.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2004

Distribution results for low-weight binary representations for pairs of integers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Permuting in place: analysis of two stopping rules.

[BibT_eX]

[DOI]

Marko Riedel

J. Algorithms, 2004

Analysis of some statistics for increasing tree families.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2004

On Some Parameters in Heap Ordered Trees.

[BibT_eX]

[DOI]

Kate Morris

Comb. Probab. Comput., 2004

Compositions and Patricia Tries: No Fluctuations in the Variance!

[BibT_eX]

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Combinatorics of geometrically distributed random variables: run statistics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A bijection between directed column-convex polyominoes and ordered trees of height at most three.

[BibT_eX]

[DOI]

Emeric Deutsch

Theor. Comput. Sci., 2003

Random 0-1 rectangular matrices: a probabilistic analysis.

[BibT_eX]

[DOI]

Period. Math. Hung., 2003

Carry propagation in signed digit representations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2003

Fountains, histograms, and q-identities.

[BibT_eX]

[DOI]

Peter Paule

Discret. Math. Theor. Comput. Sci., 2003

2002

Optimal versus randomized search of fixed length binary words.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Sorting algorithms for broadcast communications: mathematical analysis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A Tree-Counting Identity: 10781.

[BibT_eX]

[DOI]

Leonard Smiley

Robin Chapman

et al.

Am. Math. Mon., 2002

Preface.

[BibT_eX]

[DOI]

Brigitte Vallée

J. Algorithms, 2002

A multivariate view of random bucket digital search trees.

[BibT_eX]

[DOI]

J. Algorithms, 2002

Probabilistic Analysis of Carlitz Compositions.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2002

The height of q-Binary Search Trees.

[BibT_eX]

[DOI]

Michael Drmota

Discret. Math. Theor. Comput. Sci., 2002

Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.

[BibT_eX]

[DOI]

Discret. Math., 2002

Bijections for ternary trees and non-crossing trees.

[BibT_eX]

[DOI]

Discret. Math., 2002

On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.

[BibT_eX]

Ars Comb., 2002

2001

Some applications of the q-Rice formula.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum.

[BibT_eX]

[DOI]

Discret. Math., 2001

On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis.

[BibT_eX]

[DOI]

Computing, 2001

A Simple Card Guessing Game Revisited.

[BibT_eX]

[DOI]

Electron. J. Comb., 2001

Average-Case Analysis of Algorithms - Preface.

[BibT_eX]

[DOI]

Algorithmica, 2001

A q-Analogue of the Path Length of Binary Search Trees.

[BibT_eX]

[DOI]

Algorithmica, 2001

Partial Match Queries in Relaxed Multidimensional Search Trees.

[BibT_eX]

[DOI]

Algorithmica, 2001

Words, Permutations, and Representations of Numbers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Words, Dyck Paths, Trees, and Bijections.

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.

[BibT_eX]

John W. Moon

Ars Comb., 2000

A q-analogue of a formula of Hernandez obtained by inverting a result of Dilcher.

[BibT_eX]

[DOI]

Australas. J Comb., 2000

Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Run Statistics for Geometrically Distributed Random Variables (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

On Stirling Numbers for Complex Arguments and Hankel Contours.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

1998

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

On Carlitz Compositions.

[BibT_eX]

[DOI]

Eur. J. Comb., 1998

Comparisons in Hoare's Find Algorithm.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1998

On the Number of Descendants and Ascendants in Random Search Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 1998

Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.

[BibT_eX]

[DOI]

Comput. J., 1998

Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics.

[BibT_eX]

[DOI]

Algorithmica, 1998

Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.

[BibT_eX]

[DOI]

Algorithmica, 1998

1997

On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Analysis of Hoare's FIND algorithm with Median-of-three partition.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1997

Descendants and ascendants in binary trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 1997

A generating function approach to random subgraphs of the n-cycle.

[BibT_eX]

[DOI]

Xavier Gourdon

Discret. Math., 1997

Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1997

1996

Analysis of a splitting process arising in probabilistic counting and other related algorithms.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

On the Optimality of an Algorithm of Reingold and Supowit.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1996

Depth and Path Length of Heap Ordered Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1996

Combinatorics of geometrically distributed random variables: Left-to-right maxima.

[BibT_eX]

[DOI]

Discret. Math., 1996

Descendants in heap ordered trees or a triumph of computer algebra.

[BibT_eX]

[DOI]

Electron. J. Comb., 1996

1995

Analysis of an Optimized Search Algorithm for Skip Lists.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Comments on the Analysis of Parameters in a Random Graph Model.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Multiple Quickselect - Hoare's Find Algorithm for Several Elements.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Digital search trees and basic hypergeometric functions.

[BibT_eX]

Bull. EATCS, 1995

Bottom-Up Mergesort - a Detailed Analysis.

[BibT_eX]

[DOI]

Wolfgang Panny

Algorithmica, 1995

Solution of a Problem of Yekutieli and Mandelbrot.

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

Mellin Transforms and Asymptotics: Digital Sums.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Digital Search Trees Again Revisited: The Internal Path Length Perspective.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Multidimensional Digital Searching-Alternative Data Structures.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1994

An Asymptotic Comment on a Paper by Analyti and Pramanik.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Some Polynomials Related to the Fibonacci Polynomials.

[BibT_eX]

Bull. EATCS, 1994

The Path Length of Random Skip Lists.

[BibT_eX]

[DOI]

Acta Informatica, 1994

1993

A Finite Sum of Products of Binomial Coefficients (C. C. Grosjean).

[BibT_eX]

[DOI]

Bruno Salvy

SIAM Rev., 1993

A Note on Binomial Recurrences Arising in the Analysis of Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Multidimensional Digital Searching and Some New Parameters in Tries.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

How to select a loser.

[BibT_eX]

[DOI]

Discret. Math., 1993

A result in order statistics related to probabilistic counting.

[BibT_eX]

[DOI]

Computing, 1993

1992

Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

External Internal Nodes in Digital Search Trees via Mellin Transforms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters.

[BibT_eX]

Bull. EATCS, 1992

Einige Kommentare zu einer bin-packing Aufgabe von W. Knödel.

[BibT_eX]

[DOI]

Computing, 1992

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Approximate counting: an alternative approach.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1991

1989

On the Balance Property of Patricia Tries: External Path Length Viewpoint.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

On the variance of the external path length in a symmetric digital trie.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1989

Digital Search Trees - Further Results on a Fundamental Data Structure.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Further Results on Digital Search Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Do We Really Need to Balance Patricia Trees? (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

On the Recursive Depth of Special Tree Traversal Algorithms

[BibT_eX]

[DOI]

Inf. Comput., July, 1987

Level number sequences for trees.

[BibT_eX]

[DOI]

Discret. Math., 1987

1986

[BibT_eX]

[DOI]

SIAM J. Comput., 1986

The average height of the d-th highest leaf of a planted plane tree.

[BibT_eX]

[DOI]

Networks, 1986

Two selection problems revisited.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1986

Spanning tree formulas and chebyshev polynomials.

[BibT_eX]

[DOI]

Francis T. Boesch

Graphs Comb., 1986

Some Further Results on Digital Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen.

[BibT_eX]

J. Inf. Process. Cybern., 1985

1984

On the altitude of specified nodes in random trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1984

Analysis of an Algorithm to Construct Fibonacci Partitions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

The Average Height of the Second Highest Leaf of a Planted Plane Tree.

[BibT_eX]

[DOI]

Eur. J. Comb., 1984

A short proof for a partition identity of Hwang and Wei.

[BibT_eX]

[DOI]

Discret. Math., 1984

Recursion Depth Analysis for Specail Tree Traversal Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

On the Number of Combinations without a Fixed Distance.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1983

Topologies on Free Monoids Induced by Families of Languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1983

A correspondence between ordered trees and noncrossing partitions.

[BibT_eX]

[DOI]

Discret. Math., 1983

Non-repetitive sequences and gray code.

[BibT_eX]

[DOI]

Discret. Math., 1983

On monotone functions of tree structures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

1982

A note on a result of R. Kemp on R-typly rooted planted plane trees.

[BibT_eX]

[DOI]

Computing, 1982

On the average hyperoscillations of planted plane trees.

[BibT_eX]

[DOI]

Comb., 1982

1980

Congruences Defined by Languages and Filters

[BibT_eX]

[DOI]

Inf. Control., January, 1980

On the Interpolation of D0L-Sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

Topologies on Free Monoids Induced by Closure Operators of a Special Type.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1980

1979

Language Operators Related to Init.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

Infinite 0-1-sequences without long adjacent identical blocks.

[BibT_eX]

[DOI]

Discret. Math., 1979

On a generalization of the dyck-language over a two letter alphabet.

[BibT_eX]

[DOI]

Discret. Math., 1979

On the Height of Derivation Trees.

[BibT_eX]

[DOI]

Werner Kuich