Searching Monotone Multi-dimensional Arrays
classification
💻 cs.DS
cs.DM
keywords
arraysmonotonealgorithmmulti-dimensionalsearchsearchingasymptoticallycite
read the original abstract
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks' search algorithm \cite{LS1} for monotone 3-dimensional arrays to $d$-dimensions with $d\geq 4$. Our new search algorithm is asymptotically optimal for $d=4$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.