All nearest smaller values
id:
all-nearest-smaller-values-303-18469586
title:
All nearest smaller values
text:
In computer science, the all nearest smaller values problem is the following task: for each position in a sequence of numbers, search among the previous positions for the last position that contains a smaller value. This problem can be solved efficiently both by parallel and non-parallel algorithms: Berkman, Schieber & Vishkin (1993), who first identified the procedure as a useful subroutine for other parallel programs, developed efficient algorithms to solve it in the Parallel Random Access Mac
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/All_nearest_smaller_values
date created:
date modified:
2023-12-03T23:51:39Z
main entity:
{"identifier":"Q4730032","url":"https://www.wikidata.org/entity/Q4730032"}
image:
fields total:
13
integrity:
13