Alphabetic codes and binary search trees are combinatorial structures that abstract search
procedures in ordered sets endowed with probability distributions. In this paper, we design …

Consider a generalization of the classical binary search problem in linearly sorted data to
the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a …

Modern online platforms rely on effective rating systems to learn about items. We consider
the optimal design of rating systems that collect binary feedback after transactions. We make …

The paper presents a novel method for processing information with a spatial component or
querying geospatial databases. It proposes an interactive toponym disambiguation method …

We investigate two types of query games played on a graph, pair queries and edge queries.
We concentrate on investigating the two associated graph parameters for binomial random …

Twenty questions' is a guessing game played by two players: Bob thinks of an integer
between $1 $ and $ n $, and Alice's goal is to recover it using a minimal number of Yes/No …

Search trees are commonly used to implement access operations to a set of stored keys. If
this set is static and the probabilities of membership queries are known in advance, then one …

Binary search is one of the most fundamental search routines, exploiting the hidden
structure of the search space. In particular, it cuts down exponentially on the complexity of …

Given a weighted, ordered query set Q and a partition of Q into classes, we study the
problem of computing a minimum-cost decision tree that, given any query q∈ Q, uses …

We define a D-ary Fano code based on a natural generalization of the splitting criterion of
the binary Fano code to the case of D-ary code. We show that this choice allows for an …