{"id":"https://openalex.org/W2022140469","doi":"https://doi.org/10.1145/1837210.1837232","title":"Cache-oblivious polygon indecomposability testing","display_name":"Cache-oblivious polygon indecomposability testing","publication_year":2010,"publication_date":"2010-07-21","ids":{"openalex":"https://openalex.org/W2022140469","doi":"https://doi.org/10.1145/1837210.1837232","mag":"2022140469"},"language":"en","primary_location":{"id":"doi:10.1145/1837210.1837232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1837210.1837232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International Workshop on Parallel and Symbolic Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102948039","display_name":"Fatima K. Abu Salem","orcid":"https://orcid.org/0000-0003-2098-824X"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Fatima K. Abu Salem","raw_affiliation_strings":["American University of Beirut, Riad El Solh Beirut, Lebanon","[American University of Beirut, Riad El-Solh/Beirut, Lebanon]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"American University of Beirut, Riad El Solh Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]},{"raw_affiliation_string":"[American University of Beirut, Riad El-Solh/Beirut, Lebanon]","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102948039"],"corresponding_institution_ids":["https://openalex.org/I98635879"],"apc_list":null,"apc_paid":null,"fwci":0.2934,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43906094,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9987999796867371,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9948999881744385,"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/computer-science","display_name":"Computer science","score":0.6731640100479126},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.6304378509521484},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5826195478439331},{"id":"https://openalex.org/keywords/locality-of-reference","display_name":"Locality of reference","score":0.5717049241065979},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.556939959526062},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5009121894836426},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.43227052688598633},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4138437807559967},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40128037333488464},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.31154757738113403}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6731640100479126},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6304378509521484},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5826195478439331},{"id":"https://openalex.org/C27602214","wikidata":"https://www.wikidata.org/wiki/Q1868547","display_name":"Locality of reference","level":3,"score":0.5717049241065979},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.556939959526062},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5009121894836426},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.43227052688598633},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4138437807559967},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40128037333488464},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.31154757738113403},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1837210.1837232","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1837210.1837232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 4th International Workshop on Parallel and Symbolic Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4337637124","display_name":null,"funder_award_id":"111135-988119","funder_id":"https://openalex.org/F4320309999","funder_display_name":"American University of Beirut"}],"funders":[{"id":"https://openalex.org/F4320309999","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1497812785","https://openalex.org/W1544836076","https://openalex.org/W1562183207","https://openalex.org/W1592580490","https://openalex.org/W1964031104","https://openalex.org/W1968013322","https://openalex.org/W1988874385","https://openalex.org/W1989622633","https://openalex.org/W2006706309","https://openalex.org/W2017799838","https://openalex.org/W2018425753","https://openalex.org/W2022117185","https://openalex.org/W2038142281","https://openalex.org/W2043135185","https://openalex.org/W2063354603","https://openalex.org/W2083576929","https://openalex.org/W2095875205","https://openalex.org/W2102182691","https://openalex.org/W2117098610","https://openalex.org/W2121920914","https://openalex.org/W2125173284","https://openalex.org/W2150486346","https://openalex.org/W2162169073","https://openalex.org/W2221822168","https://openalex.org/W2728600909","https://openalex.org/W4247459116"],"related_works":["https://openalex.org/W1555349535","https://openalex.org/W2583128298","https://openalex.org/W2053359564","https://openalex.org/W2161159383","https://openalex.org/W1495260638","https://openalex.org/W1511204342","https://openalex.org/W1487545099","https://openalex.org/W2369125128","https://openalex.org/W2142761843","https://openalex.org/W2527471267"],"abstract_inverted_index":{"We":[0,13,62],"examine":[1],"a":[2,71,81,83],"cache-oblivious":[3,84],"reformulation":[4],"of":[5,11,18,22,67,74,139],"the":[6,15,19,26,31,41,59,64,75,95,103,112,129,149,157,170],"(iterative)":[7],"polygon":[8],"indecomposability":[9],"test":[10,24],"[19].":[12],"analyse":[14],"cache":[16],"complexity":[17],"iterative":[20,42,65],"version":[21,151],"this":[23,124],"within":[25],"ideal-cache":[27],"model":[28],"and":[29,49,78,91,109,117,145,156,180],"identify":[30],"bottlenecks":[32],"affecting":[33],"its":[34],"memory":[35,51],"performance.":[36],"Our":[37],"analysis":[38],"reveals":[39],"that":[40,50,102],"algorithm":[43],"does":[44],"not":[45],"address":[46,60],"data":[47],"locality":[48,93],"accesses":[52],"progress":[53],"with":[54],"arbitrarily":[55],"sized":[56],"jumps":[57],"in":[58,115,127,134,154],"space.":[61],"reformulate":[63],"computations":[66],"[19]":[68,155],"according":[69],"to":[70,123,136],"DFS":[72,104,130,171],"traversal":[73],"computation":[76],"tree":[77],"obtain,":[79],"as":[80,152,173],"result,":[82],"variant":[85,105,131,172],"which":[86],"exhibits":[87],"asymptotically":[88],"improved":[89,167],"spatial":[90,107,116],"temporal":[92,118],"over":[94,142],"original":[96,150],"one.":[97],"In":[98,120],"particular,":[99],"we":[100],"show":[101],"ensures":[106],"locality,":[108],"describe":[110],"quantitatively":[111],"asymptotic":[113],"improvements":[114],"locality.":[119],"an":[121],"extension":[122],"work":[125],"appearing":[126],"[3],":[128],"is":[132],"implemented":[133],"relation":[135],"absolute":[137],"irreducibility":[138],"bivariate":[140],"polynomials":[141],"arbitrary":[143],"fields,":[144],"tested":[146],"against":[147],"both":[148],"given":[153],"powerful":[158],"computer":[159],"algebra":[160],"system":[161],"MAGMA.":[162],"The":[163],"results":[164],"demonstrate":[165],"significantly":[166],"performance":[168],"for":[169],"indicated":[174],"by":[175],"L1":[176],"misses,":[177,179],"L2":[178],"total":[181],"execution":[182],"time.":[183]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}