A note on searching sorted unbalanced three-dimensional arrays

12/06/2017
by   Márcia R. Cappelle, et al.
0

We examine the problem of searching sequentially for a desired real value (a key) within a sorted unbalanced three-dimensional finite real array. This classic problem can be viewed as determining the correct dimensional threshold function from a finite class of such functions within the array, based on sequential queries that take the form of point samples. This note addresses the challenge of constructing algorithms that require the minimum number of queries necessary in the worst case, to search for a given key in arrays that have three dimensions with sizes that are not necessarily equal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2020

Searching, Sorting, and Cake Cutting in Rounds

We study sorting and searching in rounds motivated by a cake cutting pro...
research
10/30/2021

Counting and Verifying Abelian Border Arrays of Binary Words

In this note, we consider the problem of counting and verifying abelian ...
research
08/03/2022

Multidimensional Costas Arrays and Their Periodicity

A novel higher-dimensional definition for Costas arrays is introduced. T...
research
04/05/2020

The n-dimensional k-vector and its application to orthogonal range searching

This work focuses on the definition and study of the n-dimensional k-vec...
research
04/22/2021

Algorithms for finding generalized minimum aberration designs

Statistical design of experiments is widely used in scientific and indus...
research
04/19/2018

Efficient Interpolation for the Theory of Arrays

Existing techniques for Craig interpolation for the quantifier-free frag...
research
01/31/2021

The Zero Cubes Free and Cubes Unique Multidimensional Constraints

This paper studies two families of constraints for two-dimensional and m...

Please sign up or login with your details

Forgot password? Click here to reset