In this paper we devised several efficient randomized TAS algorithms.
Most importantly, we presented an algorithm with an expected max-step complexity of O(log∗k)
against the oblivious and some slightly stronger adversary models,
where k is a measur…