{"id":"https://openalex.org/W1986921815","doi":"https://doi.org/10.1137/s0097539791224285","title":"Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines","display_name":"Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W1986921815","doi":"https://doi.org/10.1137/s0097539791224285","mag":"1986921815"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539791224285","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791224285","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5067257613","display_name":"Martin Dietzfelbinger","orcid":"https://orcid.org/0000-0001-5484-3474"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Martin Dietzfelbinger","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020329764","display_name":"Miros\u0142aw Kuty\u0142owski","orcid":"https://orcid.org/0000-0003-3192-2430"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Miros\u0142aw Kuty\u0142owski","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"R\u00fcdiger Reischuk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R\u00fcdiger Reischuk","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067257613"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0615,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86089617,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"6","first_page":"1196","last_page":"1230"},"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.9998000264167786,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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/boolean-function","display_name":"Boolean function","score":0.7836751937866211},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5718053579330444},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.555350661277771},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5164042115211487},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5121698379516602},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.49394041299819946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4798847734928131},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.44669365882873535},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4353671669960022},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4220965504646301},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41916075348854065},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.416394978761673},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3946893513202667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3827378749847412},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.35567063093185425},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.3118593692779541}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7836751937866211},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5718053579330444},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.555350661277771},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5164042115211487},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5121698379516602},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.49394041299819946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4798847734928131},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.44669365882873535},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4353671669960022},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4220965504646301},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41916075348854065},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.416394978761673},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3946893513202667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3827378749847412},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.35567063093185425},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3118593692779541},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539791224285","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539791224285","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1513982482","https://openalex.org/W1517585663","https://openalex.org/W1584086289","https://openalex.org/W1587590810","https://openalex.org/W1867758558","https://openalex.org/W1967575173","https://openalex.org/W1969865855","https://openalex.org/W1978583881","https://openalex.org/W1983849809","https://openalex.org/W1992470151","https://openalex.org/W2014319104","https://openalex.org/W2018729969","https://openalex.org/W2031713274","https://openalex.org/W2034955722","https://openalex.org/W2064007242","https://openalex.org/W2070316791","https://openalex.org/W2070570981","https://openalex.org/W2090901963","https://openalex.org/W2094693960","https://openalex.org/W2095009392","https://openalex.org/W2097575812","https://openalex.org/W2104027258","https://openalex.org/W2118858222","https://openalex.org/W2126552237","https://openalex.org/W2130566259","https://openalex.org/W2143462372","https://openalex.org/W4241840173"],"related_works":["https://openalex.org/W1597080238","https://openalex.org/W2234833091","https://openalex.org/W2011469629","https://openalex.org/W2487593933","https://openalex.org/W2055594799","https://openalex.org/W59031104","https://openalex.org/W2061512596","https://openalex.org/W3141532631","https://openalex.org/W2131164334","https://openalex.org/W2121507897"],"abstract_inverted_index":{"It":[0],"was":[1],"shown":[2,96,218],"some":[3,182],"years":[4],"ago":[5],"that":[6,45,97,107,114,219,264],"the":[7,39,77,80,110,140,165,167,253],"computation":[8],"time":[9],"for":[10,98,194],"many":[11,99],"important":[12,100],"Boolean":[13,47,180,220],"functions":[14,162,183],"of":[15,26,49,79,82,129,148,179,202,212,267],"n":[16,50,83,85,268],"arguments":[17,51],"on":[18,61],"concurrent-read":[19],"exclusive-write":[20,255],"parallel":[21],"random-access":[22],"machines":[23],"(CREW":[24],"PRAMs)":[25],"unlimited":[27],"size":[28,228],"is":[29,43,95,217,262],"at":[30],"least":[31],"$\\varphi":[32,56,117],"(n)":[33,57,118],"\\approx":[34,247],"0.72\\log":[35],"_2":[36,272],"n$.":[37],"On":[38],"other":[40],"hand,":[41],"it":[42,94,216],"known":[44],"every":[46],"function":[48,169],"can":[52,230],"be":[53,231],"computed":[54],"in":[55,113,197,241,270],"+":[58,119,245,249],"1$":[59],"steps":[60,122],"a":[62,126,176,259],"CREW":[63,104,234],"PRAM":[64,105,257],"with":[65,222,236],"$n":[66],"\\cdot":[67],"2^{n":[68],"-":[69,191],"1}":[70],"$":[71,193],"processors":[72,86,130,240],"and":[73,87,131,205,227],"memory":[74,132],"cells.":[75],"In":[76,91,138],"case":[78],"OR":[81],"bits,":[84],"cells":[88,133,141],"are":[89,103],"sufficient.":[90],"this":[92],"paper,":[93],"functions,":[101],"there":[102],"algorithms":[106,159],"almost":[108],"meet":[109],"lower":[111],"bound":[112],"they":[115],"take":[116],"o(\\log":[120],"n)$":[121],"but":[123],"use":[124],"only":[125,142],"small":[127,195],"number":[128],"(in":[134,151],"most":[135,152],"cases,":[136,153],"n).":[137],"addition,":[139],"have":[143],"to":[144],"store":[145],"binary":[146,210],"words":[147],"bounded":[149],"length":[150,154,213],"1).":[155],"We":[156],"call":[157],"such":[158],"\u201cfeasible.\u201d":[160],"The":[161],"concerned":[163],"include":[164],"following:":[166],"PARITY":[168,266],"and,":[170],"more":[171],"generally,":[172],"all":[173],"symmetric":[174],"functions;":[175],"large":[177],"class":[178],"formulas;":[181],"over":[184],"non-Boolean":[185],"domains":[186],"$\\{":[187],"0,":[188],"\\ldots":[189],",k":[190],"1\\}":[192],"k,":[196],"particular,":[198],"parallel-prefix":[199],"sums;":[200],"addition":[201],"n-bit":[203],"numbers;":[204],"sorting":[206],"${n":[207],"/":[208],"l}$":[209],"numbers":[211],"l.":[214],"Further,":[215],"circuits":[221],"fan-in":[223],"2,":[224],"depth":[225],"d,":[226],"s":[229,239],"evaluated":[232],"by":[233],"PRAMs":[235],"fewer":[237],"than":[238],",$\\varphi":[242],"(2^d":[243],")":[244],"o(d)":[246],"0.72d":[248],"o(d)$":[250],"steps.":[251,274],"For":[252],"exclusive-read":[254],"(EREW)":[256],"model,":[258],"feasible":[260],"algorithm":[261],"described":[263],"computes":[265],"bits":[269],"$0.86\\log":[271],"n$":[273]},"counts_by_year":[],"updated_date":"2026-04-16T08:26:57.006410","created_date":"2025-10-10T00:00:00"}