{"id":"https://openalex.org/W2091586606","doi":"https://doi.org/10.1142/s0129626494000399","title":"ON PARALLEL PREFIX COMPUTATION","display_name":"ON PARALLEL PREFIX COMPUTATION","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2091586606","doi":"https://doi.org/10.1142/s0129626494000399","mag":"2091586606"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626494000399","doi":"https://doi.org/10.1142/s0129626494000399","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626494000399","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,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-4"],"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"},"volume":null,"type":"article","is_traditional":true,"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","observed_orcids":["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":false,"raw_author_name":"SANJEEV SAXENA","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute Of Technology, Kanpur, 208 016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute Of Technology, Kanpur, 208 016, India","institution_ids":["https://openalex.org/I94234084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006039212","display_name":"P.C.P. Bhatt","orcid":"https://orcid.org/0000-0001-7356-4868","observed_orcids":["https://orcid.org/0000-0001-7356-4868"]},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"P.C.P. BHATT","raw_affiliation_strings":["Micro-elec. and Comp.Sys.Lab., Electrical Enginnering Department, McGill University, 3480 University Street, Montreal (Quebec) H3A 2A7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Micro-elec. and Comp.Sys.Lab., Electrical Enginnering Department, McGill University, 3480 University Street, Montreal (Quebec) H3A 2A7, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090578580","display_name":"V.C. Prasad","orcid":null,"observed_orcids":[]},"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":"V.C. PRASAD","raw_affiliation_strings":["Electrical Engineering, Indian Institute Of Technology, Delhi, New Delhi, 110 016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering, Indian Institute Of Technology, Delhi, New Delhi, 110 016, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3895,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.59893883,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":"04","issue":"04","first_page":"429","last_page":"436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9682999849319458,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9682999849319458,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.017899999395012856,"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/T11269","display_name":"Algorithms and Data Compression","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-prefix-computation","display_name":"parallel prefix computation","score":0.871999979019165},{"id":"https://openalex.org/keywords/prefix-sums","display_name":"prefix sums","score":0.9490000009536743},{"id":"https://openalex.org/keywords/crcw-pram","display_name":"CRCW PRAM","score":0.9089999794960022},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.5509999990463257},{"id":"https://openalex.org/keywords/optimal-time-complexity","display_name":"optimal time complexity","score":0.6150000095367432},{"id":"https://openalex.org/keywords/integer-arithmetic","display_name":"integer arithmetic","score":0.35899999737739563}],"concepts":[{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.7940793037414551},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6687701940536499},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.6471118927001953},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5698234438896179},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.511235237121582},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5000920295715332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46350377798080444},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.458352267742157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45392391085624695},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4486364722251892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4470210671424866},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.44348204135894775},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43215417861938477},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.41384217143058777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3585270047187805},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2891230881214142},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"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/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626494000399","doi":"https://doi.org/10.1142/s0129626494000399","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626494000399","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,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-4"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2038659996","https://openalex.org/W4296598180","https://openalex.org/W7098233128","https://openalex.org/W2144841199","https://openalex.org/W2153480667","https://openalex.org/W2139041246","https://openalex.org/W2001708046","https://openalex.org/W2082419751","https://openalex.org/W6903456810","https://openalex.org/W2097418154"],"abstract_inverted_index":{"We":[0,89],"prove":[1],"that":[2],"prefix":[3,113],"sums":[4,114],"of":[5,8,40,59,77],"n":[6],"integers":[7],"at":[9],"most":[10],"b":[11,107],"bits":[12],"can":[13,115],"be":[14,104,116],"found":[15,117],"on":[16],"a":[17,27,57,92],"COMMON":[18],"CRCW":[19],"PRAM":[20,95],"in":[21,97,118],"[Formula:":[22,45,52,64,119],"see":[23,46,53,65,120],"text]":[24,47,66,121],"time":[25,49,67],"with":[26],"linear":[28],"time-processor":[29],"product.":[30],"The":[31,62],"algorithm":[32,68,79,85],"is":[33,51,56,86],"optimally":[34],"fast,":[35],"for":[36,72],"any":[37],"polynomial":[38],"number":[39],"processors.":[41],"In":[42],"particular,":[43],"if":[44],"the":[48,99],"taken":[50],"text].":[54],"This":[55],"generalisation":[58],"previous":[60,63],"result.":[61],"was":[69],"valid":[70],"only":[71],"O(log":[73],"n)-bit":[74],"numbers.":[75],"Application":[76],"this":[78,111],"to":[80],"r-way":[81],"parallel":[82],"merge":[83],"sort":[84],"also":[87,90],"considered.":[88],"consider":[91],"more":[93],"realistic":[94],"variant,":[96],"which":[98],"word":[100],"size,":[101],"m,":[102],"may":[103],"smaller":[105],"than":[106],"(m\u2265log":[108],"n).":[109],"On":[110],"model,":[112],"optimal":[122],"time.":[123]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}
