Computational geometry: an introduction
Computational geometry: an introduction
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Optimal Prioritized Conflict Resolution on a Multiple Access Channel
IEEE Transactions on Computers
Discrete Mathematics
Maximum finding on a multiple access broadcast network
Information Processing Letters
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
A fast maximum finding algorithm on broadcast communication
Information Processing Letters
Search for the maximum of a random walk
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Analytical depoissonization and its applications
Theoretical Computer Science
Information Processing Letters
Singularity analysis and asymptotics of Bernoulli sums
Theoretical Computer Science
Average Case Analysis of Algorithms on Sequences
Average Case Analysis of Algorithms on Sequences
Distributed Algorithms
Phase changes in random m-ary search trees and generalized quicksort
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
SIAM Journal on Computing
A multivariate view of random bucket digital search trees
Journal of Algorithms - Analysis of algorithms
Sorting algorithms for broadcast communications: mathematical analysis
Theoretical Computer Science
Finding an extremum in a network
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Quickselect and the Dickman Function
Combinatorics, Probability and Computing
| Hi-index | 0.00 |
The limit laws of three cost measures are derived of two algorithms for finding the maximum in a single-channel broadcast communication model. Both algorithms use coin flips and comparisons. Besides the ubiquitous normal limit law, the Dickman distribution also appears in a natural way. The method of proof proceeds along the line via the method of moments and the "asymptotic transfers," which roughly bridges the asymptotics of the "conquering cost of the subproblems" and that of the total cost. Such a general approach has proved very fruitful for a number of problems in the analysis of recursive algorithms.