We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently ...

We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently ...

The problem of searching through a partially ordered set (SPOS) is the problem of devising an opti- mal search strategy for Γ(U,S). More precisely, given a ...

The problem of searching through a partially ordered set (SPOS) is the problem of devising an optimal search strategy for (U;S). More precisely, given a ...

We shall show that certain simple, fast algorithms are able to produce nearly-optimal search strategies for typical partial orders under the two models of ...

We consider the problem of searching for a given element in a partially ordered set. More precisely, we address the problem of computing efficiently ...

We shall show that certain simple, fast algorithms are able to produce nearly- optimal search strategies for typical instances under the two models of random.

We consider two classical models for random partial orders, the random graph model and the uniform model. We shall show that certain simple, fast algorithms are ...

ABSTRACT. Consider the problem of membership query for a given par- tially ordered set. We devise a greedy algorithm which can produce near-optimal search ...

Renato Carmo, Jair Donadelli, Yoshiharu Kohayakawa , Eduardo Sany Laber: Searching in Random Partially Ordered Sets. LATIN 2002: 278-292.