{"id":"https://openalex.org/W2068182735","doi":"https://doi.org/10.1145/2312005.2312020","title":"Brief announcement","display_name":"Brief announcement","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2068182735","doi":"https://doi.org/10.1145/2312005.2312020","mag":"2068182735"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual 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/A5100632013","display_name":"Neeraj Sharma","orcid":"https://orcid.org/0000-0002-9044-4267"},"institutions":[{"id":"https://openalex.org/I105695857","display_name":"Siemens (Hungary)","ror":"https://ror.org/01rk7mv85","country_code":"HU","type":"company","lineage":["https://openalex.org/I105695857","https://openalex.org/I1325886976"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Neeraj Sharma","raw_affiliation_strings":["Mentor Graphics (INDIA) Pvt. Ltd., Noida, UP, India","Mentor Graphics (INDIA) Pvt. Ltd., Noida, UP, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Mentor Graphics (INDIA) Pvt. Ltd., Noida, UP, India","institution_ids":[]},{"raw_affiliation_string":"Mentor Graphics (INDIA) Pvt. Ltd., Noida, UP, India#TAB#","institution_ids":["https://openalex.org/I105695857"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110042808","display_name":"Sandeep Sen","orcid":"https://orcid.org/0009-0004-1562-8746"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sandeep Sen","raw_affiliation_strings":["Indian Institute of Technology, Delhi, New Delhi, India","Indian Institute of Technology Delhi, New Delhi, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Delhi, New Delhi, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Indian Institute of Technology Delhi, New Delhi, India#TAB#","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100632013"],"corresponding_institution_ids":["https://openalex.org/I105695857"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13070809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"74","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7435085773468018},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.731645405292511},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6723117232322693},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6450742483139038},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.6297645568847656},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.5772912502288818},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.5719650983810425},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5204196572303772},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48013946413993835},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4330011010169983},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42213165760040283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35710981488227844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2408657670021057}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7435085773468018},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.731645405292511},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6723117232322693},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6450742483139038},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.6297645568847656},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.5772912502288818},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.5719650983810425},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5204196572303772},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48013946413993835},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4330011010169983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42213165760040283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35710981488227844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2408657670021057}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2312005.2312020","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312020","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1518270726","https://openalex.org/W2003533142","https://openalex.org/W2028637266","https://openalex.org/W2038142281","https://openalex.org/W2089064856","https://openalex.org/W2148290033","https://openalex.org/W2154995125","https://openalex.org/W2605605369","https://openalex.org/W4238964467"],"related_works":["https://openalex.org/W2001324285","https://openalex.org/W2046128376","https://openalex.org/W3194705018","https://openalex.org/W4388717692","https://openalex.org/W2475955799","https://openalex.org/W2147122795","https://openalex.org/W2038423975","https://openalex.org/W2527471267","https://openalex.org/W2792468622","https://openalex.org/W2167303720"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,80,90],"present":[4],"a":[5],"cache-oblivious":[6],"framework":[7],"for":[8,38,78,97],"randomized":[9],"divide":[10],"and":[11,51,66,87,89],"conquer":[12],"algorithms":[13],"on":[14],"the":[15,55,59,67],"multicore":[16],"model":[17],"with":[18,42,101],"private":[19],"cache.":[20],"We":[21],"first":[22],"derive":[23],"an":[24,62,95],"O(n/p":[25],"log":[26,29,31,32],"n":[27,30,40],"+":[28],"n)":[33,46],"expected":[34,43],"parallel":[35],"depth":[36],"algorithm":[37,96],"sorting":[39],"numbers":[41],"O(n/B":[44],"logM":[45],"cache":[47,64],"misses":[48],"where":[49],"p,M":[50],"B":[52],"respectively":[53],"denote":[54],"number":[56],"of":[57,61],"processors,":[58],"size":[60,69],"individual":[63],"memory":[65],"block":[68],"respectively.":[70],"Although":[71],"similar":[72,102],"results":[73],"have":[74],"been":[75],"obtained":[76],"recently":[77],"sorting,":[79],"feel":[81],"that":[82],"our":[83],"approach":[84],"is":[85],"simpler":[86],"general":[88],"apply":[91],"it":[92],"to":[93],"obtain":[94],"3D":[98],"convex":[99],"hulls":[100],"bounds.":[103]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}