The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Inserting Points Uniformly at Every Instance
IEICE - Transactions on Information and Systems
Online uniformly inserting points on grid
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Uniformly inserting points on square grid
Information Processing Letters
Approximately uniform online checkpointing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
| Hi-index | 0.89 |
This Letter presents algorithms for computing a uniform sequence of n integer points in a given interval [0,m] where m and n are integers such that mn0. The uniformity of a point set is measured by the ratio of the minimum gap over the maximum gap. We prove that we can insert n integral points one by one into the interval [0,m] while keeping the uniformity of the point set at least 1/2. If we require uniformity strictly greater than 1/2, such a sequence does not always exist, but we can prove a tight upper bound on the length of the sequence for given values of n and m.