We consider a simple model of imprecise comparisons: there exists some δ> 0 such that
when a subject is given two elements to compare, if the values of those elements (as …

Contract scheduling is a general technique that allows the design of systems with
interruptible capabilities, given an algorithm that is not necessarily interruptible. Previous …

In the online (time-series) search problem, a player is presented with a sequence of prices
which are revealed in an online manner. In the standard definition of the problem, for each …

We consider the problem of sorting $ n $ elements in the case of\emph {persistent}
comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison …

We present a sorting algorithm for the case of recurrent random comparison errors. The
algorithm essentially achieves simultaneously good properties of previous algorithms for …

Given a teacher that holds a function f: X→ R from some class of functions C. The teacher
can receive from the learner an element d in the domain X (a query) and returns the value of …

We consider the problem of searching for an unknown target vertex $ t $ in a (possibly edge-
weighted) graph. Each\emph {vertex-query} points to a vertex $ v $ and the response either …

We study the problem of estimating the number of defective items in adaptive Group testing
by using a minimum number of queries. We improve the existing algorithm and prove a …

Let X be a set of items of size n that contains some defective items, denoted by I, where I⊆
X. In group testing, a test refers to a subset of items Q⊂ X. The outcome of a test is 1 if Q …

We study the problem of sorting N elements in the presence of persistent errors in
comparisons: In this classical model, each comparison between two elements is wrong …