Suppose we know that an object is in a sorted table and we want to determine the index of that object. To achieve this goal we could perform a binary search[1]. However, suppose it is time-consuming to determine the relative position of that object to any other objects in the table. In this scenario, we might want to resort to an incomplete solution: we could device an algorithm that quickly pr...

Wederive exactmoments of the number of 2-protected nodes in binary search trees grown from random permutations. Furthermore, we show that a properly normalized version of this tree parameter converges to a Gaussian limit. © 2012 Elsevier Ltd. All rights reserved.

It consider the problem of computing efficient strategies for Searching. As a generalization of the classical binary search for ordered array, suppose one wishes to find a specific element in an ordered array by making comparisons, where each comparison indicates the endpoint closer to the desired element. Given the likelihood of each element being the one searched, the objective is to compute ...

In this paper, we propose an algorithm for the positive one-inthree satisfiability problem (Pos1In3Sat). The proposed algorithm decides the existence of a satisfying assignment in all assignments for a given formula by using a 2-dimensional binary search method without constructing all assignments.

Among the models of delayed search discussed in [1], [2], the simplest one can be formulated as the following two–player game. One player, say A, holds a secret number m ∈ M {1, 2, . . . ,M} and another player, say Q, tries to learn the secret number by asking A at time i questions, like “Is m ≥ xi?”, where xi is a number chosen by Q. The rule is that at time i+ d A must answer Q’s question at ...

Introduced a new binary search tree algorithm, cache-splay, that was the first to achieve the Unified Bound of Iacono since this problem was posed in 2001, and showed that the lower bound framework (see below) applied to a more general model of computation than binary search. Additionally, my thesis summarized my previous work on developing both lower bounds and upper bounds on the cost of sequ...

The 2DR-tree is a novel approach for accessing spatial data, particularly when spatial relationships are defined among objects. The 2DR-tree uses nodes that are the same dimensionality as the data space. Therefore, all relationships between objects are preserved and different binary search strategies are supported. This paper presents the 2DR-tree binary search strategy. A preliminary performan...

Binary clause reasoning has found some successful applications in SAT, and it is natural to investigate its use in various extensions of SAT. In this paper we investigate the use of binary clause reasoning in the context of solving Quantified Boolean Formulas (QBF). We develop a DPLL based QBF solver that employs extended binary clause reasoning (hyper-binary resolution) to infer new binary cla...

Binary search tree and framed ALOHA algorithms are commonly adopted to solve the anti-collision problem in RFID systems. In this letter, the read efficiency of these two anti-collision algorithms is compared through computer simulations. Simulation results indicate the framed ALOHA algorithm requires less total read time than the binary search tree algorithm. The initial frame length strongly a...

Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and descr...