Skip to search formSkip to main contentSkip to account menu

All nearest smaller values

In computer science, the all nearest smaller values problem is the following task: for each position in a sequence of numbers, search among the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Array data structureBulk synchronous parallelCartesian treeComputer science

Broader (1)

Parallel computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Development effort and performance trade-off in high-level parallel programming
Research on high-level parallel programming approaches systematically evaluate the performance of applications written using… 
2000
2000
Communication Efficient Coarse-Grained Parallel Algorithm for All Nearest Smaller Values Problem and its Applications
1999
1999
Fundamental data movement operations and its applications on a hyper-bus broadcast network
1998
1998
ANSV Problem on BSRs
1998
1998
3.1.1 Triangulating a Monotone Polygon 3.2 Range Minima 2.3.2 Query Retrieval 3.1 All Nearest Smaller Values 2.2 Preex Minima and All Nearest Smaller Values
Parallel algorithms for shared-memory machines. In J. 27] Y. Matias and U. Vishkin. Converting high probability into nearly… 
1998
1998
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
We consider the problem of computing the minimum ofnvalues, and several well-known generalizations prefix minima, range minima… 
1995
1995
Fast parallel algorithms for minimum and related problems with small integer inputs
The fundamental problem of minimum computation has several well studied generalizations such as prefix minima, range minima, and… 
1993
1993
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs
We consider the problem of computing the minimum of n values, and several well-known generalizations (prefix minima, range minima… 
1993
1993
Optimal Algorithms on the Pipelined Hypercube and Related Networks
  • J. JáJáK. Ryu
  • IEEE Trans. Parallel Distributed Syst.
  • 1993
  • Corpus ID: 34055771
Parallel algorithms for several important combinatorial problems such as the all nearest smaller values problem, triangulating a… 
1992
1992
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems
Some doubly logarithmic parallel algorithms based on nding all nearest smaller values, Tech. Optimal doubly logarithmic parallel… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)