{"id":"https://openalex.org/W2126552237","doi":"https://doi.org/10.1137/0214024","title":"Trade-Offs between Depth and Width in Parallel Computation","display_name":"Trade-Offs between Depth and Width in Parallel Computation","publication_year":1985,"publication_date":"1985-05-01","ids":{"openalex":"https://openalex.org/W2126552237","doi":"https://doi.org/10.1137/0214024","mag":"2126552237"},"language":"en","primary_location":{"id":"doi:10.1137/0214024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214024","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/A5013018127","display_name":"Uzi Vishkin","orcid":"https://orcid.org/0000-0003-0713-2674"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Uzi Vishkin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039043184","display_name":"Avi Wigderson","orcid":"https://orcid.org/0000-0002-1539-1417"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avi Wigderson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013018127"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.5114,"has_fulltext":false,"cited_by_count":53,"citation_normalized_percentile":{"value":0.98350595,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"14","issue":"2","first_page":"303","last_page":"314"},"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.9998999834060669,"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.9998999834060669,"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.9990000128746033,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7171924114227295},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6188063025474548},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6180847883224487},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5310528874397278},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5049498677253723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4736018180847168},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4635438621044159},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.46051183342933655},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4393543004989624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4198765158653259},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41210174560546875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27611738443374634},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08931666612625122}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7171924114227295},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6188063025474548},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6180847883224487},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5310528874397278},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5049498677253723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4736018180847168},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4635438621044159},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.46051183342933655},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4393543004989624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4198765158653259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41210174560546875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27611738443374634},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08931666612625122},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214024","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1555673550","https://openalex.org/W1655990431","https://openalex.org/W1967575173","https://openalex.org/W1991509743","https://openalex.org/W2004350101","https://openalex.org/W2004618348","https://openalex.org/W2004973784","https://openalex.org/W2008840956","https://openalex.org/W2087489294","https://openalex.org/W3143083401"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2949083013","https://openalex.org/W2130100567","https://openalex.org/W2328371232","https://openalex.org/W1481287275"],"abstract_inverted_index":{"A":[0],"new":[1,204],"technique":[2,13,169],"for":[3,7,18,26,142,177,215],"proving":[4],"lower":[5,24,213,230],"bounds":[6,25],"parallel":[8,30,53],"computation":[9,31],"is":[10,82,129,239],"introduced.":[11],"This":[12],"enables":[14],"us":[15],"to":[16,36,40,62,79,170],"obtain,":[17],"the":[19,41,80,90,107,113,120,130,133,137,161,216,229],"first":[20],"time,":[21],"nontrivial":[22],"tight":[23,212],"shared-memory":[27],"models":[28],"of":[29,52,66,89,97,132,136,139,164,180,202,232],"that":[32,106,190,209],"allow":[33],"several":[34],"processors":[35],"have":[37],"simultaneous":[38,192],"access":[39,61],"same":[42],"memory":[43,65],"location.":[44],"Specifically,":[45],"we":[46,104,154],"use":[47],"a":[48,63,94,156,178,187,200,203,211],"concurrent-read":[49],"concurrent-write":[50],"model":[51,189],"computation.":[54],"It":[55],"has":[56,60],"p":[57],"processors,":[58],"each":[59],"common":[64,91],"size":[67,131],"m":[68,116],"(also":[69],"called":[70],"communication":[71,114,238],"width":[72,74,115],"or":[73],"in":[75,84,218],"short).":[76],"The":[77],"input":[78],"problem":[81],"located":[83],"an":[85],"additional":[86],"read-only":[87],"portion":[88],"memory.":[92],"For":[93],"wide":[95],"variety":[96],"problems":[98],"(including":[99,183],"parity,":[100],"majority":[101],"and":[102,112,198,234],"summation)":[103],"show":[105],"time":[108],"complexity":[109],"T":[110],"(depth)":[111],"are":[117],"related":[118],"by":[119,206],"trade-off":[121,176],"curve":[122,147],"$mT^2":[123,222],"=":[124,150,173,223],"\\Omega":[125,174,224],"(n)$,":[126],"(where":[127],"n":[128],"input),":[134],"regardless":[135],"number":[138,163],"processors.":[140,165],"Moreover,":[141],"every":[143],"point":[144],"on":[145,186],"this":[146,219],"with":[148,160],"$m":[149],"O(n/\\log":[151],"^2":[152],"n)$":[153],"give":[155,199],"matching":[157],"upper":[158],"bound":[159,214,231],"optimal":[162],"We":[166,195],"extend":[167],"our":[168],"prove":[171],"$mT^3":[172],"(n)$":[175],"class":[179],"\u201csimpler\u201d":[181],"functions":[182],"Boolean":[184],"OR)":[185],"weaker":[188],"forbids":[191],"write":[193],"access.":[194],"also":[196],"state":[197],"proof":[201],"result":[205],"Beame":[207],"[B-83]":[208],"achieves":[210],"OR":[217],"model,":[220],"namely":[221],"(n)$.":[225],"These":[226],"results":[227],"improve":[228],"Cook":[233],"Dwork":[235],"[CD-82]":[236],"when":[237],"limited.":[240]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}