{"id":"https://openalex.org/W3043347199","doi":"https://doi.org/10.1142/s0129626420500085","title":"All Nearest Smallers Made Simple","display_name":"All Nearest Smallers Made Simple","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3043347199","doi":"https://doi.org/10.1142/s0129626420500085","mag":"3043347199"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626420500085","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626420500085","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5101785418","display_name":"Sanjeev Saxena","orcid":"https://orcid.org/0000-0002-9581-1732"},"institutions":[{"id":"https://openalex.org/I94234084","display_name":"Indian Institute of Technology Kanpur","ror":"https://ror.org/05pjsgx75","country_code":"IN","type":"education","lineage":["https://openalex.org/I94234084"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sanjeev Saxena","raw_affiliation_strings":["Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India"],"raw_orcid":"https://orcid.org/0000-0002-9581-1732","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, Indian Institute of Technology, Kanpur 208 016, India","institution_ids":["https://openalex.org/I94234084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101785418"],"corresponding_institution_ids":["https://openalex.org/I94234084"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07947636,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"02","first_page":"2050008","last_page":"2050008"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9934999942779541,"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.9934999942779541,"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/T12288","display_name":"Optimization and Search Problems","score":0.9678999781608582,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11567","display_name":"semigroups and automata theory","score":0.9567000269889832,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.733497142791748},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.7025946378707886},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.6582254767417908},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.641390323638916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6060861945152283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5070028305053711},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4983828067779541},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43711191415786743},{"id":"https://openalex.org/keywords/trie","display_name":"Trie","score":0.43216028809547424},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.42841508984565735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3550349175930023},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.31866008043289185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3124144673347473},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15719860792160034}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.733497142791748},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.7025946378707886},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.6582254767417908},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.641390323638916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6060861945152283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5070028305053711},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4983828067779541},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43711191415786743},{"id":"https://openalex.org/C190290938","wikidata":"https://www.wikidata.org/wiki/Q387015","display_name":"Trie","level":3,"score":0.43216028809547424},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.42841508984565735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3550349175930023},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.31866008043289185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3124144673347473},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15719860792160034},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626420500085","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626420500085","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1521737691","https://openalex.org/W2059245171","https://openalex.org/W2067506436","https://openalex.org/W2069489095","https://openalex.org/W2087489294","https://openalex.org/W2089062581","https://openalex.org/W2120490947"],"related_works":["https://openalex.org/W54192826","https://openalex.org/W2074308207","https://openalex.org/W2395357979","https://openalex.org/W2795037468","https://openalex.org/W3092113474","https://openalex.org/W1754202134","https://openalex.org/W2800763970","https://openalex.org/W2046569047","https://openalex.org/W2186419898","https://openalex.org/W2370961680"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3],"parallel":[4,43],"algorithm":[5,44],"for":[6,29,45],"all":[7,47],"nearest":[8],"smallers":[9],"problem":[10],"without":[11],"using":[12,22],"doubly":[13],"logarithmic":[14],"tree":[15],"is":[16,19],"described.":[17],"It":[18],"shown":[20],"that":[21],"only":[23],"[Formula:":[24,39],"see":[25,40],"text]":[26,41],"time":[27,42],"routines":[28],"merging":[30],"and":[31],"prefix":[32],"minima,":[33],"we":[34],"can":[35],"easily":[36],"get":[37],"an":[38],"the":[46],"Nearest":[48],"Smallers":[49],"problem.":[50]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}