Helmut Prodinger
According to our database1,
Helmut Prodinger
authored at least 193 papers
between 1979 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1980
1985
1990
1995
2000
2005
2010
2015
2020
0
5
10
1
2
1
1
1
4
4
3
5
4
4
2
7
6
7
5
4
5
7
3
4
6
10
7
2
1
8
5
5
5
6
5
5
1
2
1
2
4
1
4
5
2
3
3
2
1
1
1
1
1
1
1
2
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Ars Math. Contemp., 2024
2023
2022
2021
2020
2019
Comb. Probab. Comput., 2019
A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices.
Contributions Discret. Math., 2019
Ars Math. Contemp., 2019
2018
Theor. Comput. Sci., 2018
Discret. Math. Theor. Comput. Sci., 2018
On Ruehr's Identities.
Ars Comb., 2018
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus.
Proceedings of the 29th International Conference on Probabilistic, 2018
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
Electron. J. Comb., 2017
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017
2016
Theor. Comput. Sci., 2016
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort.
CoRR, 2016
2015
Period. Math. Hung., 2015
Discret. Math. Theor. Comput. Sci., 2015
Electron. J. Comb., 2015
2014
J. Integer Seq., 2014
2013
IEEE Trans. Inf. Theory, 2013
2012
Dyck Paths with Parity Restrictions for the Final Runs to the Origin: a Study of the Height.
Fundam. Informaticae, 2012
The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis.
Discret. Math. Theor. Comput. Sci., 2012
Australas. J Comb., 2012
2011
Integers, 2011
Discret. Math. Theor. Comput. Sci., 2011
Redundant <i>τ</i>-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication.
Des. Codes Cryptogr., 2011
Electron. J. Comb., 2011
Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011
2010
IACR Cryptol. ePrint Arch., 2010
Discret. Math. Theor. Comput. Sci., 2010
Discret. Math. Theor. Comput. Sci., 2010
Adv. Appl. Math., 2010
2009
Theor. Comput. Sci., 2009
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations.
Int. J. Found. Comput. Sci., 2009
Discret. Math., 2009
Electron. J. Comb., 2009
2008
Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication.
IACR Cryptol. ePrint Arch., 2008
Discret. Math. Theor. Comput. Sci., 2008
On gaps and unoccupied urns in sequences of geometrically distributed random variables.
Discret. Math., 2008
Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics, 2008
2007
Period. Math. Hung., 2007
A Combinatorial and Probabilistic Study of Initial and End Heights of Descents in Samples of Geometrically Distributed Random Variables and in Permutations.
Discret. Math. Theor. Comput. Sci., 2007
The Last Descent In Samples Of Geometric Random Variables And Permutations.
Ars Comb., 2007
Representations of Numbers as å<sub><i>k</i>=-<i>n</i></sub><sup><i>n</i></sup> e<sub><i>k</i></sub> <i>k</i>\sum_{k=-n}^n \varepsilon_k k: A Saddle Point Approach.
Proceedings of the Infinity in Logic and Computation, International Conference, 2007
2006
Eur. J. Comb., 2006
Discret. Math. Theor. Comput. Sci., 2006
Discret. Math. Theor. Comput. Sci., 2006
Algorithmica, 2006
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis.
Algorithmica, 2006
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.
Theor. Comput. Sci., 2005
ACM Trans. Algorithms, 2005
Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving.
IACR Cryptol. ePrint Arch., 2005
Minimality of the Hamming Weight of the <i>T</i>-NAF for Koblitz Curves and Improved Combination with Point Halving.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005
2004
Theor. Comput. Sci., 2004
Discret. Math. Theor. Comput. Sci., 2004
Compositions and Patricia Tries: No Fluctuations in the Variance!
Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004
2003
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis.
Theor. Comput. Sci., 2003
Theor. Comput. Sci., 2003
A bijection between directed column-convex polyominoes and ordered trees of height at most three.
Theor. Comput. Sci., 2003
2002
IEEE Trans. Inf. Theory, 2002
Theor. Comput. Sci., 2002
Discret. Math. Theor. Comput. Sci., 2002
Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima.
Discret. Math., 2002
On the Analysis of an Algorithm to Generate a Random Cyclic Permutation.
Ars Comb., 2002
2001
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum.
Discret. Math., 2001
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis.
Computing, 2001
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
Words, Dyck Paths, Trees, and Bijections.
Proceedings of the Words, Semigroups, and Transductions, 2001
2000
A Bijective Proof of an Identity Concerning Nodes of Fixed Degree in Planted Trees.
Ars Comb., 2000
Australas. J Comb., 2000
Combinatorics of Geometrically Distributed Random Variables: Lenght of Ascending Runs.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
1999
SIAM J. Discret. Math., 1999
1998
A generating functions approach for the analysis of grand averages for multiple QUICKSELECT.
Random Struct. Algorithms, 1998
An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication.
Inf. Process. Lett., 1998
Electron. J. Comb., 1998
Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial.
Comput. J., 1998
Algorithmica, 1998
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.
Algorithmica, 1998
1997
On a Problem of Yekutieli and Mandelbrot about the Bifurcation Ratio of Binary Trees.
Theor. Comput. Sci., 1997
Random Struct. Algorithms, 1997
Discret. Math., 1997
Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution.
Comb. Probab. Comput., 1997
1996
Analysis of a splitting process arising in probabilistic counting and other related algorithms.
Random Struct. Algorithms, 1996
J. Autom. Lang. Comb., 1996
Discret. Math., 1996
Electron. J. Comb., 1996
1995
RAIRO Theor. Informatics Appl., 1995
Inf. Process. Lett., 1995
Digital search trees and basic hypergeometric functions.
Bull. EATCS, 1995
Proceedings of the LATIN '95: Theoretical Informatics, 1995
1994
SIAM J. Comput., 1994
Random Struct. Algorithms, 1994
Some Polynomials Related to the Fibonacci Polynomials.
Bull. EATCS, 1994
1993
Inf. Process. Lett., 1993
Int. J. Found. Comput. Sci., 1993
1992
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet.
Theor. Comput. Sci., 1992
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter.
Theor. Comput. Sci., 1992
SIAM J. Comput., 1992
Some analytic techniques for the investigation of the asymptotic behaviour of tree parameters.
Bull. EATCS, 1992
How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems.
Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992
1991
1989
Theor. Comput. Sci., 1989
Discret. Appl. Math., 1989
Digital Search Trees - Further Results on a Fundamental Data Structure.
Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989
1988
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
1987
1986
Networks, 1986
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.
J. Inf. Process. Cybern., 1985
1984
RAIRO Theor. Informatics Appl., 1984
Eur. J. Comb., 1984
Proceedings of the Automata, 1984
1983
RAIRO Theor. Informatics Appl., 1983
Discret. Math., 1983
1982
1980
RAIRO Theor. Informatics Appl., 1980
1979
Discret. Math., 1979