{"id":"https://openalex.org/W2034207034","doi":"https://doi.org/10.1142/s0129626402001051","title":"TIME OPTIMAL n-SIZE MATCHING PARENTHESES AND BINARY TREE DECODING ALGORITHMS ON A p-PROCESSOR BSR","display_name":"TIME OPTIMAL n-SIZE MATCHING PARENTHESES AND BINARY TREE DECODING ALGORITHMS ON A p-PROCESSOR BSR","publication_year":2002,"publication_date":"2002-09-01","ids":{"openalex":"https://openalex.org/W2034207034","doi":"https://doi.org/10.1142/s0129626402001051","mag":"2034207034"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626402001051","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626402001051","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/A5103338018","display_name":"Limin Xiang","orcid":null},"institutions":[{"id":"https://openalex.org/I199028557","display_name":"Kyushu Sangyo University","ror":"https://ror.org/01wqrpc44","country_code":"JP","type":"education","lineage":["https://openalex.org/I199028557"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"LIMIN XIANG","raw_affiliation_strings":["Department of Information Science, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, Fukuoka 812-8581, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Science, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, Fukuoka 812-8581, Japan","institution_ids":["https://openalex.org/I199028557"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113793130","display_name":"Kazuo Ushijima","orcid":null},"institutions":[{"id":"https://openalex.org/I199028557","display_name":"Kyushu Sangyo University","ror":"https://ror.org/01wqrpc44","country_code":"JP","type":"education","lineage":["https://openalex.org/I199028557"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"KAZUO USHIJIMA","raw_affiliation_strings":["Department of Information Science, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, Fukuoka 812-8581, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Information Science, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, Fukuoka 812-8581, Japan","institution_ids":["https://openalex.org/I199028557"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065190767","display_name":"Jianjun Zhao","orcid":"https://orcid.org/0000-0001-8083-4352"},"institutions":[{"id":"https://openalex.org/I100722782","display_name":"Fukuoka Institute of Technology","ror":"https://ror.org/00bmxak18","country_code":"JP","type":"education","lineage":["https://openalex.org/I100722782"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"JIANJUN ZHAO","raw_affiliation_strings":["Department of Computer Science and Engineering, Fukuoka Institute of Technology, 3-10-1 Wajiro-Higashi, Higasi-ku, Fukuoka 811-0295, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Fukuoka Institute of Technology, 3-10-1 Wajiro-Higashi, Higasi-ku, Fukuoka 811-0295, Japan","institution_ids":["https://openalex.org/I100722782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103338018"],"corresponding_institution_ids":["https://openalex.org/I199028557"],"apc_list":null,"apc_paid":null,"fwci":1.2507,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81880519,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"03n04","first_page":"365","last_page":"374"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/computer-science","display_name":"Computer science","score":0.6815736293792725},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6567941308021545},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6483493447303772},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6219266653060913},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.532270073890686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.521406888961792},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5019283294677734},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49751999974250793},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4950803816318512},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.43869996070861816},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42894506454467773},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.3379296660423279},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28423619270324707},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.25166457891464233},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.23485758900642395}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6815736293792725},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6567941308021545},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6483493447303772},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6219266653060913},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.532270073890686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.521406888961792},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5019283294677734},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49751999974250793},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4950803816318512},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.43869996070861816},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42894506454467773},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.3379296660423279},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28423619270324707},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.25166457891464233},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.23485758900642395},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/s0129626402001051","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626402001051","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":12,"referenced_works":["https://openalex.org/W181802644","https://openalex.org/W1531886005","https://openalex.org/W1964400175","https://openalex.org/W1981682421","https://openalex.org/W2045542171","https://openalex.org/W2087191404","https://openalex.org/W2120490947","https://openalex.org/W2123301304","https://openalex.org/W2134855860","https://openalex.org/W2136524237","https://openalex.org/W2150752303","https://openalex.org/W2151240503"],"related_works":["https://openalex.org/W3145288231","https://openalex.org/W2371263218","https://openalex.org/W2092552144","https://openalex.org/W2354196777","https://openalex.org/W2965473297","https://openalex.org/W2108265183","https://openalex.org/W2257399947","https://openalex.org/W2248278495","https://openalex.org/W2386746909","https://openalex.org/W2387316851"],"abstract_inverted_index":{"Time":[0],"optimal":[1],"algorithms":[2,43,76],"on":[3,21,44,58,77],"an":[4,59],"n-processor":[5,60],"BSR":[6,47,80],"PRAM":[7,26],"for":[8,27,48,81],"many":[9],"n-size":[10,50,84],"problems":[11,51,85],"can":[12,52],"be":[13,54,66],"found":[14],"in":[15],"the":[16,28,82],"literature.":[17],"They":[18],"outpace":[19],"those":[20,57],"EREW,":[22],"CREW":[23],"or":[24],"CRCW":[25],"same":[29],"problems.":[30],"When":[31],"only":[32],"p":[33,36],"(1":[34],"<":[35,37],"n)":[38],"processors":[39],"are":[40,102],"available,":[41],"efficient":[42],"a":[45,78,91],"p-processor":[46,79],"some":[49],"not":[53],"obtained":[55],"from":[56,94],"BSR,":[61],"and":[62,73,89,98],"they":[63,101],"have":[64],"to":[65],"reconsidered.":[67],"In":[68],"this":[69],"paper,":[70],"we":[71],"discuss":[72],"give":[74],"two":[75,83],"of":[86],"matching":[87],"parentheses":[88],"decoding":[90],"binary":[92],"tree":[93],"its":[95],"bit-string,":[96],"respectively,":[97],"show":[99],"that":[100],"time":[103],"optimal.":[104]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}