Searching Monotone Multi-dimensional Arrays

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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$.
13 pages, 2 figures; same results, presentation improved, add two figures

Keywords

Data Structures and Algorithms, Discrete Mathematics, F.2.2; G.2.1

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/100629

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0504026
 http://arxiv.org/abs/cs/0504026

Collections

arXiv