Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,209,251 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Array data structure
Bulk synchronous parallel
Cartesian tree
Computer science
Expand
Broader (1)
Parallel computing
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2000
2000
Communication Efficient Coarse-Grained Parallel Algorithm for All Nearest Smaller Values Problem and its Applications
Chun-Hsi Huang
,
Xin He
International Conference on Parallel and…
2000
Corpus ID: 28843456
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
P. Ragde
,
W. Steiger
,
+9 authors
F. Meyer Auf Der Heide
1998
Corpus ID: 14610928
Parallel algorithms for shared-memory machines. In J. 27] Y. Matias and U. Vishkin. Converting high probability into nearly…
Expand
1998
1998
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
O. Berkman
,
Yossi Matias
,
P. Ragde
J. Algorithms
1998
Corpus ID: 6420107
We consider the problem of computing the minimum ofnvalues, and several well-known generalizations prefix minima, range minima…
Expand
1995
1995
Fast parallel algorithms for minimum and related problems with small integer inputs
O. Berkman
,
Yossi Matias
Proceedings of 9th International Parallel…
1995
Corpus ID: 31768364
The fundamental problem of minimum computation has several well studied generalizations such as prefix minima, range minima, and…
Expand
1993
1993
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs
O. Berkman
,
Yossi Matias
,
P. Ragde
Workshop on Algorithms and Data Structures
1993
Corpus ID: 33438137
We consider the problem of computing the minimum of n values, and several well-known generalizations (prefix minima, range minima…
Expand
1992
1992
Lower Bounds for Constant Depth Circuits for Preex Problems, in Proc. of 10th International 5. Conclusion and Open Problems
H N Gabow
,
J. Bentley
,
+14 authors
Im
1992
Corpus ID: 14918263
Some doubly logarithmic parallel algorithms based on nding all nearest smaller values, Tech. Optimal doubly logarithmic parallel…
Expand