Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657812 | Theoretical Computer Science | 2005 | 13 Pages |
Abstract
A detailed probabilistic analysis is given of algorithms for the Dutch national flag problem. We derive central and local limit theorems for the cost, as well as probabilities of large deviations. Performance of a related algorithm is also studied.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Wei-Mei Chen,