๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications

โœ Scribed by Bokka, V.; Nakano, K.; Olariu, S.; Schwing, J.L.; Wilson, L.

Book ID
120971365
Publisher
IEEE
Year
2001
Tongue
English
Weight
449 KB
Volume
12
Category
Article
ISSN
1045-9219

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Time-Optimal Multiple Search Algorithm
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
โœ D. Bhagavathi; S. Olariu; W. Shen; L. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 739 KB

Given a sorted sequence \(A=a_{1}, a_{2}, \ldots, a_{n}\) of items from a totally ordered universe, along with an arbitrary sequence \(Q=q_{1}\), \(q_{2}, \ldots, q_{m}(1 \leq m \leq n)\) of queries, the multiple search problem involves computing for every \(q_{j}(1 \leq j \leq m)\) the unique \(a_{