{"id":"https://openalex.org/W1867758558","doi":"https://doi.org/10.1137/0220062","title":"CREW PRAM<scp>s</scp> and Decision Trees","display_name":"CREW PRAM<scp>s</scp> and Decision Trees","publication_year":1991,"publication_date":"1991-12-01","ids":{"openalex":"https://openalex.org/W1867758558","doi":"https://doi.org/10.1137/0220062","mag":"1867758558"},"language":"en","primary_location":{"id":"doi:10.1137/0220062","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220062","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/A5081416898","display_name":"Noam Nisan","orcid":"https://orcid.org/0000-0003-3106-6304"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Noam Nisan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5081416898"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9824,"has_fulltext":false,"cited_by_count":180,"citation_normalized_percentile":{"value":0.83489026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"20","issue":"6","first_page":"999","last_page":"1007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.998199999332428,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9980999827384949,"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.7588235139846802},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.749506413936615},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.683337926864624},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5939626097679138},{"id":"https://openalex.org/keywords/crew","display_name":"Crew","score":0.5631489753723145},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5143738985061646},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4962049126625061},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4623727798461914},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4502234160900116},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.44518420100212097},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39769649505615234},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.36950790882110596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33711254596710205},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2950761914253235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24214628338813782}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7588235139846802},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.749506413936615},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.683337926864624},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5939626097679138},{"id":"https://openalex.org/C2780179797","wikidata":"https://www.wikidata.org/wiki/Q345844","display_name":"Crew","level":2,"score":0.5631489753723145},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5143738985061646},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4962049126625061},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4623727798461914},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4502234160900116},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.44518420100212097},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39769649505615234},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.36950790882110596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33711254596710205},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2950761914253235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24214628338813782},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C178802073","wikidata":"https://www.wikidata.org/wiki/Q8421","display_name":"Aeronautics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220062","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220062","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":[{"display_name":"Peace, Justice and strong institutions","score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1542212162","https://openalex.org/W1763066259","https://openalex.org/W1966167835","https://openalex.org/W2016606569","https://openalex.org/W2026325622","https://openalex.org/W2070570981","https://openalex.org/W2080620555","https://openalex.org/W2089621728","https://openalex.org/W2094321606","https://openalex.org/W2126552237","https://openalex.org/W2147862220"],"related_works":["https://openalex.org/W257150968","https://openalex.org/W3140601928","https://openalex.org/W1996923656","https://openalex.org/W1536220277","https://openalex.org/W2168881618","https://openalex.org/W86917440","https://openalex.org/W2057159994","https://openalex.org/W2109998394","https://openalex.org/W2110222718","https://openalex.org/W1608751818"],"abstract_inverted_index":{"This":[0,79,154,196],"paper":[1],"gives":[2],"a":[3,12,16,31,41,113,120,133,138,150,190],"full":[4],"characterization":[5,25],"of":[6,23,30,35,43,84,95,102,137,159,171],"the":[7,38,44,58,64,68,75,92,96,100,103,116,141,164,169,174],"time":[8,117],"needed":[9],"to":[10,55,57,123],"compute":[11,124,145],"boolean":[13,36,59,126,175],"function":[14],"on":[15],"CREW":[17,76,121,139,152],"PRAM":[18,77,122],"with":[19],"an":[20,81,156],"unlimited":[21],"number":[22],"processors.The":[24],"is":[26,52,66,130,180,205],"given":[27],"in":[28,91,99,173,183],"terms":[29],"new":[32],"complexity":[33,71],"measure":[34],"functions:":[37],"\u201cblock":[39],"sensitivity,\u201d":[40],"generalization":[42],"well-known":[45],"\u201ccritical":[46],"sensitivity\u201d":[47],"measure.":[48],"The":[49,86],"block":[50],"sensitivity":[51],"also":[53,72,206],"shown":[54,131,181],"relate":[56],"decision":[60,69,176],"tree":[61,70,177],"complexity,":[62],"and":[63,161,215],"implication":[65],"that":[67,89,132,182],"fully":[73],"characterizes":[74],"complexity.":[78],"solves":[80,155],"open":[82,157],"problem":[83,158],"Wegener.":[85],"results":[87,165],"imply":[88],"changes":[90],"instruction":[93],"set":[94],"processors":[97],"or":[98],"capacity":[101],"shared":[104],"memory":[105],"cells":[106],"do":[107],"not":[108],"change":[109],"by":[110,119],"more":[111],"than":[112],"constant":[114],"factor":[115],"required":[118],"any":[125],"function.":[127],"Moreover,":[128],"it":[129,204],"seemingly":[134],"weaker":[135],"version":[136],"PRAM,":[140,143],"CROW":[142],"can":[144],"functions":[146],"as":[147,149],"quickly":[148],"general":[151],"PRAM.":[153],"Dymond":[160],"Ruzzo.":[162],"Finally,":[163],"have":[166],"implications":[167],"regarding":[168],"power":[170],"randomization":[172,186],"model.":[178],"It":[179],"this":[184],"model,":[185],"may":[187],"achieve":[188],"only":[189],"polynomial":[191],"speedup":[192],"over":[193],"deterministic":[194],"computation.":[195],"was":[197],"known":[198],"for":[199,208],"Las":[200],"Vegas":[201],"randomized":[202],"computation;":[203],"proven":[207],"one-sided":[209],"error":[210,217],"computation":[211],"(a":[212,218],"quadratic":[213],"bound)":[214],"two-sided":[216],"cubic":[219],"bound).":[220]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}