An optimal algorithm for finding all the jumps of a monotone step-function
Journal of Algorithms
Theory of linear and integer programming
Theory of linear and integer programming
Introduction to algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Generalization of Binary Search
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
The Precision of Query Points as a Resource for Learning Convex Polytopes with Membership Queries
COLT '00 Proceedings of the Thirteenth Annual Conference on Computational Learning Theory
On the complexity of real root isolation using continued fractions
Theoretical Computer Science
Discrete Applied Mathematics
Solving simple stochastic games with few coin toss positions
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Improved bounds for the CF algorithm
Theoretical Computer Science
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.89 |
We present a Θ(log2 M)-time algorithm that determines an unknown rational number x in QM = {p/q: p, q ∈ {1, ..., M}} by asking at most 2log2 M + O(1) queries of the form "Is x ≤ y?".