Searching Monotone Multi-dimensional Arrays

Simple item page
dc.creatorCheng, Yongxi
dc.creatorSun, Xiaoming
dc.creatorYin, Yiqun Lisa
dc.date2005-04-07
dc.date2006-08-21
dc.date.accessioned2026-07-07T06:38:08Z
dc.date.available2026-07-07T06:38:08Z
dc.descriptionIn 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$.
dc.description13 pages, 2 figures; same results, presentation improved, add two figures
dc.identifierhttps://arxiv.org/abs/cs/0504026
dc.identifierhttp://arxiv.org/abs/cs/0504026
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100629
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.subjectF.2.2; G.2.1
dc.titleSearching Monotone Multi-dimensional Arrays
dc.typetext

Files

Collections

arXiv