Metraipolis › archive › dc_006c89522425

All nearest smaller values — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/All_nearest_smaller_values
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-08T14:24:17.041Z
SHA-256 of the archived text
c3010940f85019ab2545beac9081f1326e09dfbe24dc2c9f4c081ef70b06234d
Stable URL of this page
https://metraipolis.com/documento/dc_006c89522425

How to cite

All nearest smaller values — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/All_nearest_smaller_values (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_006c89522425 (Metraipolis archive dc_006c89522425, sha256 c3010940f85019ab2545beac9081f1326e09dfbe24dc2c9f4c081ef70b06234d)
BibTeX
@misc{dc006c89522425,
  title = {All nearest smaller values — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/All_nearest_smaller_values},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_006c89522425; sha256 c3010940f85019ab2545beac9081f1326e09dfbe24dc2c9f4c081ef70b06234d},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/All_nearest_smaller_values. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, the all nearest smaller values (ANSV) problem is: given an array A[1..n], compute for each position i the index P[i]=max{j<i∣A[j]<A[i]}, or determine that no such j exists. The corresponding nearest-smaller value is A[P[i]]. Some presentations report A[P[i]], but many applications require the indices P[i]. 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 Machine model; it may also be solved in linear time on a non-parallel computer using a stack-based algorithm. Later researchers have studied algorithms to solve it in other models of parallel computation.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «All nearest smaller values» — https://en.wikipedia.org/wiki/All_nearest_smaller_values
Wikidata Q4730032: «computational problem» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4730032
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/All_nearest_smaller_values?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377501815, consultata il 2026-11-08T14:17:58.323Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 798631aedc119eed7787773929621afc706e2f82aa45ab46bdcf8fe2bf2b356e