{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:41:41Z","timestamp":1740120101698,"version":"3.37.3"},"reference-count":7,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> In this paper, a parallel algorithm for all nearest smallers problem without using doubly logarithmic tree is described. It is shown that using only [Formula: see text] time routines for merging and prefix minima, we can easily get an [Formula: see text] time parallel algorithm for the all Nearest Smallers problem. <\/jats:p>","DOI":"10.1142\/s0129626420500085","type":"journal-article","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T07:37:01Z","timestamp":1594971421000},"page":"2050008","source":"Crossref","is-referenced-by-count":0,"title":["All Nearest Smallers Made Simple"],"prefix":"10.1142","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9581-1732","authenticated-orcid":false,"given":"Sanjeev","family":"Saxena","sequence":"first","affiliation":[{"name":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2020,7,17]]},"reference":[{"key":"S0129626420500085BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-50335-8_30"},{"key":"S0129626420500085BIB002","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1018"},{"key":"S0129626420500085BIB003","doi-asserted-by":"publisher","DOI":"10.1137\/0204030"},{"key":"S0129626420500085BIB004","volume-title":"Introduction to Parallel Algorithms","author":"JaJa J.","year":"1992","edition":"1"},{"key":"S0129626420500085BIB005","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0905"},{"key":"S0129626420500085BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90010-9"},{"key":"S0129626420500085BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90008-X"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626420500085","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T07:37:17Z","timestamp":1594971437000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626420500085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":7,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S0129626420500085"],"URL":"https:\/\/doi.org\/10.1142\/s0129626420500085","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}