.png){kind=icon}
返回
All nearest smaller values on the hypercube
.png){kind=icon}
PRE
AI
DOI：10.1109/71.503770.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a sequence of n elements, the All Nearest Smaller Values (ANSV) problem is to find, for each element in the sequence, the nearest element to the left (right) that is smaller, or to report that no such element exists. Time and work optimal algorithms for this problem are known on all the PRAM models [3], [5] but the running time of the best previous hypercube algorithm [6] is optimal only when the number of processors p satisfies 1 less than or equal to p less than or equal to n/(Og(3) n)((lg lg n)(2)). In this paper, we prove that any normal hypercube algorithm requires Omega(n) processors to solve the ANSV problem in O(lg n) time, and we present the first normal hypercube ANSV algorithm that is optimal for all values of n and p. We use our ANSV algorithm to give the first O(lg n)-time n-processor normal hypercube algorithms for triangulating a monotone polygon and for constructing a Cartesian tree.
Keyword:
all nearest smaller values
normal hypercube algorithm
monotone polygon triangulation
Cartesian tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
Insulin management in hospitalized patients with diabetes mellitus on high-dose glucocorticoids: Management of steroid-exacerbated hyperglycemia.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容