AAAAAA

   
Results: 1-11 |
Results: 11
THE NUMBER OF WINNERS IN A DISCRETE GEOMETRICALLY DISTRIBUTED SAMPLE (VOL 6, PG 687, 1996)
Authors: KIRSCHENHOFER P PRODINGER H
Citation: P. Kirschenhofer et H. Prodinger, THE NUMBER OF WINNERS IN A DISCRETE GEOMETRICALLY DISTRIBUTED SAMPLE (VOL 6, PG 687, 1996), The Annals of applied probability, 8(2), 1998, pp. 647-647
THE SUM-OF-DIGITS FUNCTION FOR COMPLEX BASES
Authors: GRABNER PJ KIRSCHENHOFER P PRODINGER H
Citation: Pj. Grabner et al., THE SUM-OF-DIGITS FUNCTION FOR COMPLEX BASES, Journal of the London Mathematical Society, 57, 1998, pp. 20-40
ANALYSIS OF HOARE FIND ALGORITHM WITH MEDIAN-OF-3 PARTITION
Authors: KIRSCHENHOFER P PRODINGER H MARTINEZ C
Citation: P. Kirschenhofer et al., ANALYSIS OF HOARE FIND ALGORITHM WITH MEDIAN-OF-3 PARTITION, Random structures & algorithms, 10(1-2), 1997, pp. 143-156
ANALYSIS OF A SPLITTING PROCESS ARISING IN PROBABILISTIC COUNTING ANDOTHER RELATED ALGORITHMS
Authors: KIRSCHENHOFER P PRODINGER H SZPANKOWSKI W
Citation: P. Kirschenhofer et al., ANALYSIS OF A SPLITTING PROCESS ARISING IN PROBABILISTIC COUNTING ANDOTHER RELATED ALGORITHMS, Random structures & algorithms, 9(4), 1996, pp. 379-401
ANALYSIS OF AN OPTIMIZED SEARCH ALGORITHM FOR SKIP LISTS
Authors: KIRSCHENHOFER P MARTINEZ C PRODINGER H
Citation: P. Kirschenhofer et al., ANALYSIS OF AN OPTIMIZED SEARCH ALGORITHM FOR SKIP LISTS, Theoretical computer science, 144(1-2), 1995, pp. 199-220
MULTIDIMENSIONAL DIGITAL SEARCHING - ALTERNATIVE DATA-STRUCTURES
Authors: KIRSCHENHOFER P PRODINGER H
Citation: P. Kirschenhofer et H. Prodinger, MULTIDIMENSIONAL DIGITAL SEARCHING - ALTERNATIVE DATA-STRUCTURES, Random structures & algorithms, 5(1), 1994, pp. 123-134
MELLIN TRANSFORMS AND ASYMPTOTICS - DIGITAL SUMS
Authors: FLAJOLET P GRABNER P KIRSCHENHOFER P PRODINGER H TICHY RF
Citation: P. Flajolet et al., MELLIN TRANSFORMS AND ASYMPTOTICS - DIGITAL SUMS, Theoretical computer science, 123(2), 1994, pp. 291-314
DIGITAL SEARCH-TREES AGAIN REVISITED - THE INTERNAL PATH-LENGTH PERSPECTIVE
Authors: KIRSCHENHOFER P PRODINGER H SZPANKOWSKI W
Citation: P. Kirschenhofer et al., DIGITAL SEARCH-TREES AGAIN REVISITED - THE INTERNAL PATH-LENGTH PERSPECTIVE, SIAM journal on computing, 23(3), 1994, pp. 598-616
THE HIGHER MOMENTS OF THE NUMBER OF RETURNS OF A SIMPLE RANDOM-WALK
Authors: KIRSCHENHOFER P PRODINGER H
Citation: P. Kirschenhofer et H. Prodinger, THE HIGHER MOMENTS OF THE NUMBER OF RETURNS OF A SIMPLE RANDOM-WALK, Advances in Applied Probability, 26(2), 1994, pp. 561-563
THE PATH-LENGTH OF RANDOM SKIP LISTS
Authors: KIRSCHENHOFER P PRODINGER H
Citation: P. Kirschenhofer et H. Prodinger, THE PATH-LENGTH OF RANDOM SKIP LISTS, Acta informatica, 31(8), 1994, pp. 775-792
A RESULT IN ORDER-STATISTICS RELATED TO PROBABILISTIC COUNTING
Authors: KIRSCHENHOFER P PRODINGER H
Citation: P. Kirschenhofer et H. Prodinger, A RESULT IN ORDER-STATISTICS RELATED TO PROBABILISTIC COUNTING, Computing, 51(1), 1993, pp. 15-27
Risultati: 1-11 |