{"id":"https://openalex.org/W4399346709","doi":"https://doi.org/10.1145/3626183.3659979","title":"The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory","display_name":"The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4399346709","doi":"https://doi.org/10.1145/3626183.3659979"},"language":"en","primary_location":{"id":"doi:10.1145/3626183.3659979","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3659979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015446804","display_name":"Nodari Sitchinava","orcid":"https://orcid.org/0000-0001-8876-4846"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nodari Sitchinava","raw_affiliation_strings":["University of Hawaii at Manoa, Honolulu, HI, USA"],"raw_orcid":"https://orcid.org/0000-0001-8876-4846","affiliations":[{"raw_affiliation_string":"University of Hawaii at Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091954509","display_name":"Rolf Svenning","orcid":"https://orcid.org/0000-0002-9903-4651"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rolf Svenning","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-9903-4651","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05918189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"259","last_page":"268"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5651911497116089},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.457785964012146},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4223424792289734},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24036672711372375}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5651911497116089},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.457785964012146},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4223424792289734},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24036672711372375}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3626183.3659979","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3659979","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire/b01c7675-5cb2-430c-9756-90bc5c18fac8","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/b01c7675-5cb2-430c-9756-90bc5c18fac8","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Sitchinava, N & Svenning, R 2024, The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory. in SPAA '24 : Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, Annual ACM Symposium on Parallelism in Algorithms and Architectures, vol. 36, pp. 259-268, 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, 17/06/2024. https://doi.org/10.1145/3626183.3659979","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1965333879","https://openalex.org/W1976923213","https://openalex.org/W1979109797","https://openalex.org/W1985704385","https://openalex.org/W2038142281","https://openalex.org/W2054977714","https://openalex.org/W2059245171","https://openalex.org/W2072375602","https://openalex.org/W2095875205","https://openalex.org/W2100647352","https://openalex.org/W2103913570","https://openalex.org/W2130566259","https://openalex.org/W2154995125","https://openalex.org/W2175677593","https://openalex.org/W2287432258","https://openalex.org/W2732093072","https://openalex.org/W3041215255","https://openalex.org/W3117864297"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0,182,221],"present":[1,223],"a":[2,14,164,241,307],"thorough":[3],"investigation":[4],"of":[5,29,62,74,137,228,298,310,342],"the":[6,37,44,60,63,68,72,90,96,106,120,143,149,153,188,196,218,224,229,233,285,296,320,338,343],"All":[7],"Nearest":[8],"Smaller":[9],"Values":[10],"(ANSV)":[11],"problem":[12,19,78,151],"from":[13],"practical":[15,130,146,203],"perspective.":[16],"The":[17,76],"ANSV":[18,77,150],"is":[20,152,215],"defined":[21],"as":[22,105,126,187],"follows:":[23],"given":[24],"an":[25,171],"array":[26],"A":[27],"consisting":[28],"n":[30],"values,":[31],"for":[32,129,270,280,317],"each":[33],"entry":[34],"A_i":[35,52,56],"compute":[36],"largest":[38],"index":[39,46],"l":[40],"<":[41],"i":[42,49],"and":[43,55,70,84,114,132,157,178,200,236,247,264,326],"smallest":[45],"r":[47],">":[48,53,57],"such":[50],"that":[51,212,238,254,316],"A_l":[54],"A_r,":[58],"i.e.,":[59],"indices":[61],"nearest":[64,328],"smaller":[65,329],"values":[66,325,330],"to":[67,71,104,148,184,217,291,302],"left":[69],"right":[73],"A_i.":[75],"was":[79],"solved":[80],"by":[81,155,176],"Berkman,":[82],"Schieber,":[83],"Vishkin":[85],"[J.":[86],"Algorithms,":[87],"1993]":[88],"in":[89,95,232],"PRAM":[91,98],"model.":[92],"Their":[93],"solution":[94,147],"CREW":[97],"model,":[99],"which":[100],"we":[101,133,194,252,336],"will":[102],"refer":[103,183],"BSV":[107,121,198,344],"algorithm,":[108],"achieves":[109,256],"optimal":[110,245,248],"O":[111],"(n)":[112],"work":[113,246,263],"O(log":[115],"n)":[116],"span.":[117,249],"Until":[118],"now,":[119],"algorithm":[122,169,199,235,287],"has":[123],"been":[124],"perceived":[125,207],"too":[127],"complicated":[128],"use,":[131],"are":[134],"not":[135],"aware":[136],"any":[138,271],"publicly":[139],"available":[140],"implementations.":[141],"Instead,":[142],"best":[144],"existing":[145],"implementation":[154,186],"Shun":[156,179],"Zhao":[158],"presented":[159],"at":[160,180,295],"DCC'13.":[161],"They":[162],"implemented":[163,231],"simpler":[165],"O(n":[166],"log":[167],"n)-work":[168],"with":[170],"additional":[172],"heuristic":[173,230],"first":[174,225],"proposed":[175],"Blelloch":[177],"ALENEX'11.":[181],"this":[185,192],"BSZ":[189,219,234,286],"algorithm.":[190,220,345],"In":[191,250],"paper,":[193],"implement":[195],"original":[197],"demonstrate":[201],"its":[202,206,213],"efficiency.":[204],"Despite":[205],"complexity,":[208],"our":[209],"results":[210],"show":[211,237,253],"performance":[214],"comparable":[216],"also":[222],"theoretical":[226],"analysis":[227],"it":[239,255],"provides":[240],"tunable":[242],"trade-off":[243],"between":[244,324],"particular,":[251],"\\mathcalO":[257,265],"\\!\u0142eft(n\u0142eft(1":[258],"+":[259],"\\frac\u0142ogn":[260],"k":[261,267,276,281],"\\right)\\right)":[262],"\\!\u0142eft(k(1+\u0142og\\fracn":[266],")\\right)":[268],"span,":[269],"integer":[272],"parameter":[273],"1":[274],"\u0142e":[275,277],"n.":[278],"Thus,":[279],"=":[282],"\u0398\\!\u0142eft(\u0142og":[283],"n\\right),":[284],"can":[288],"be":[289,292],"made":[290],"work-optimal,":[293],"albeit":[294],"expense":[297],"increased":[299],"span":[300],"compared":[301],"BSV.":[303],"Our":[304],"discussion":[305],"includes":[306],"detailed":[308],"examination":[309],"different":[311],"input":[312],"types,":[313],"particularly":[314],"highlighting":[315],"random":[318],"inputs,":[319],"low":[321],"expected":[322],"distance":[323],"their":[327],"renders":[331],"simple":[332],"algorithms":[333],"efficient.":[334],"Finally,":[335],"analyze":[337],"input/output":[339],"(I/Oxspace)":[340],"complexities":[341]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}