Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Prodinger, Helmut"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Approximate counting with
m
counters: A detailed analysis
Helmut Prodinger
Theoretical Computer Science
439
, 2012, pp. 58-68
The analysis of Range Quickselect and related problems
Conrado Martínez
,
Alois Panholzer
,
Helmut Prodinger
Theoretical Computer Science
412
(46), 2011, pp. 6537-6555
Analysis of complements in multi-exponentiation algorithms using signed digit representations
Clemens Heuberger
,
Helmut Prodinger
International Journal of Foundations of Computer Science
20
(3), 2009, pp. 443-453
Moves and displacements of particular elements in Quicksort
Conrado Martínez
,
Helmut Prodinger
Theoretical Computer Science
410
(21-23), 2009, pp. 2279-2284
Generalized approximate counting revisited
Guy Louchard
,
Helmut Prodinger
Theoretical Computer Science
391
(1-2), 2008, pp. 109-125
Scalar multiplication on Koblitz curves using the Frobenius endomorphism and its combination with point halving: Extensions and mathematical analysis
Roberto M. Avanzi
,
Clemens Heuberger
,
Helmut Prodinger
Algorithmica
46
(3), 2006, pp. 249-270
The scientific works of Rainer Kemp (1949-2004)
Philippe Flajolet
,
Markus Nebel
,
Helmut Prodinger
Theoretical Computer Science
355
(3), 2006, pp. 371-381
Asymptotics of the moments of extreme-value related distribution functions
Guy Louchard
,
Helmut Prodinger
Algorithmica
46
(3), 2006, pp. 431-467
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
Clemens Heuberger
,
Rajendra Katti
,
Helmut Prodinger
,
Xiaoyu Ruan
Theoretical Computer Science
341
(1-3), 2005, pp. 55-72
Distribution results for low-weight binary representations for pairs of integers
Peter J. Grabner
,
Clemens Heuberger
,
Helmut Prodinger
Theoretical Computer Science
319
(1-3), 2004, pp. 307-331
The number of descents in samples of geometric random variables
Arnold Knopfmacher
,
Helmut Prodinger
Trends in Mathematics
, 2004, pp. 339-350
Permuting in place: Analysis of two stopping rules
Alois Panholzer
,
Helmut Prodinger
,
Marko Riedel
Journal of Algorithms
51
(2), 2004, pp. 170-184
A bijection between directed column-convex polyominoes and ordered trees of height at most three
Emeric Deutsch
,
Helmut Prodinger
Theoretical Computer Science
307
(2), 2003, pp. 319-325
Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis
Guy Louchard
,
Helmut Prodinger
Theoretical Computer Science
304
(1-3), 2003, pp. 59-86
Sorting algorithms for broadcast communications: Mathematical analysis
Peter J. Grabner
,
Helmut Prodinger
Theoretical Computer Science
289
(1), 2002, pp. 51-67
A multivariate view of random bucket digital search trees
Friedrich Hubalek
,
Hsien-Kuei Hwang
,
William Lew
,
Hosam Mahmoud
,
Helmut Prodinger
Journal of Algorithms
44
(1), 2002, pp. 121-158
On Stirling numbers for complex arguments and Hankel contours
Philippe Flajolet
,
Helmut Prodinger
SIAM Journal on Discrete Mathematics
12
(2), 1999, pp. 155-159
An asymtotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
Peter J. Grabner
,
Helmut Prodinger
Information Processing Letters
65
(2), 1998, pp. 89-93
On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
Helmut Prodinger
Theoretical Computer Science
181
(1), 1997, pp. 181-194
Depth and path length of heap ordered trees
Helmut Prodinger
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 293-299
Analysis of an optimized search algorithm for skip lists
Peter Kirschenhofer
,
Conrado Martínez
,
Helmut Prodinger
Theoretical Computer Science
144
(1-2), 1995, pp. 199-220
Multiple Quickselect-Hoare's find algorithm for several elements
Helmut Prodinger
Information Processing Letters
56
, 1995, pp. 123-129
Solution of a problem of Yekutieli and Mandelbrot
Helmut Prodinger
Lecture Notes in Computer Science
911
, 1995, pp. 461-468
Mellin transforms and asymptotics: Digital sums
Philippe Flajolet
,
Peter Grabner
,
Peter Kirschenhofer
,
Helmut Prodinger
,
Robert F. Tichy
Theoretical Computer Science
123
(2), 1994, pp. 291-314
Digital search trees again revisited: The internal path length perspective
Peter Kirschenhofer
,
Helmut Prodinger
,
Wojciech Szpankowski
SIAM Journal on Computing
23
(3), 1994, June, pp. 598-616
Seiten 1
2
>