{"id":"https://openalex.org/W2006602347","doi":"https://doi.org/10.1142/s0129626496000297","title":"OPTIMAL PARALLEL SUPERPRIMITIVITY TESTING FOR SQUARE ARRAYS","display_name":"OPTIMAL PARALLEL SUPERPRIMITIVITY TESTING FOR SQUARE ARRAYS","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2006602347","doi":"https://doi.org/10.1142/s0129626496000297","mag":"2006602347"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626496000297","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626496000297","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/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["AU","GB"],"is_corresponding":true,"raw_author_name":"COSTAS S. ILIOPOULOS","raw_affiliation_strings":["Department of Computer Science, King\u2019s College London, Strand London, England","School of Computing, Curtin University Perth, WA, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King\u2019s College London, Strand London, England","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"School of Computing, Curtin University Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031348059","display_name":"Maureen Korda","orcid":null},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"MAUREEN KORDA","raw_affiliation_strings":["Department of Computer Science, King\u2019s College London, Strand London, England","School of Computing, Curtin University Perth, WA, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, King\u2019s College London, Strand London, England","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"School of Computing, Curtin University Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058155947"],"corresponding_institution_ids":["https://openalex.org/I183935753","https://openalex.org/I205640436"],"apc_list":null,"apc_paid":null,"fwci":1.1045,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.8201875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"06","issue":"03","first_page":"299","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9799000024795532,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9799000024795532,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9763000011444092,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9735999703407288,"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/square","display_name":"Square (algebra)","score":0.7823183536529541},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5690261125564575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5579396486282349},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5068123936653137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4822162389755249},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47957342863082886},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4530569612979889},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.43182775378227234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3836963176727295},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10240688920021057}],"concepts":[{"id":"https://openalex.org/C135692309","wikidata":"https://www.wikidata.org/wiki/Q111124","display_name":"Square (algebra)","level":2,"score":0.7823183536529541},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5690261125564575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5579396486282349},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5068123936653137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4822162389755249},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47957342863082886},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4530569612979889},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.43182775378227234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3836963176727295},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10240688920021057}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626496000297","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626496000297","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2070865675","https://openalex.org/W2071635571","https://openalex.org/W1657646819","https://openalex.org/W338671845","https://openalex.org/W2055625272","https://openalex.org/W2054653010","https://openalex.org/W2036758175","https://openalex.org/W2070426974","https://openalex.org/W1577155814","https://openalex.org/W1838063489"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"optimal":[3],"O(":[4],"log":[5,6],"n)":[7],"time":[8],"algorithm":[9,32],"on":[10],"the":[11,31,34,37],"CRCW":[12],"PRAM":[13],"which":[14],"tests":[15],"whether":[16],"a":[17],"square":[18,39],"array,":[19],"A,":[20],"of":[21],"size":[22],"n\u00d7n,":[23],"is":[24,28],"superprimitive.":[25],"If":[26],"A":[27],"not":[29],"superprimitive,":[30],"returns":[33],"quasiperiod,":[35],"i.e.,":[36],"smallest":[38],"array":[40],"that":[41],"covers":[42],"A.":[43]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}