{"id":"https://openalex.org/W215972817","doi":"https://doi.org/10.1137/0220005","title":"Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes","display_name":"Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes","publication_year":1991,"publication_date":"1991-02-01","ids":{"openalex":"https://openalex.org/W215972817","doi":"https://doi.org/10.1137/0220005","mag":"215972817"},"language":"en","primary_location":{"id":"doi:10.1137/0220005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220005","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/A5056262659","display_name":"Ian Parberry","orcid":"https://orcid.org/0000-0003-2194-2817"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ian Parberry","raw_affiliation_strings":["University of North Texas, Denton"],"affiliations":[{"raw_affiliation_string":"University of North Texas, Denton","institution_ids":["https://openalex.org/I123534392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113630783","display_name":"Pei Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peiyuan Yan","raw_affiliation_strings":["Pennsylvania State University, University Park#TAB#"],"affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park#TAB#","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056262659"],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.03024479,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"1","first_page":"88","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9997000098228455,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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.7540444135665894},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6690253615379333},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.647022545337677},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6101921796798706},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.599725067615509},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.5864295959472656},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5389310717582703},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5331214070320129},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.5124931335449219},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4793853759765625},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4681558609008789},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.41821861267089844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34313148260116577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3317754864692688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23981481790542603},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08111172914505005}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7540444135665894},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6690253615379333},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.647022545337677},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6101921796798706},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.599725067615509},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.5864295959472656},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5389310717582703},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5331214070320129},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.5124931335449219},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4793853759765625},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4681558609008789},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.41821861267089844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34313148260116577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3317754864692688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23981481790542603},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08111172914505005},{"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},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0220005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220005","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"},{"id":"mag:215972817","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/icpp/icpp1989-3.html#ParberryY89","pdf_url":null,"source":{"id":"https://openalex.org/S4210174133","display_name":"Proceedings of the International Conference on Parallel Processing","issn_l":"0190-3918","issn":["0190-3918","2332-5690"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Proceedings of the International Conference on Parallel Processing","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8799999952316284,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W6968995","https://openalex.org/W1977926680","https://openalex.org/W2004618348","https://openalex.org/W2018729969","https://openalex.org/W2049337025","https://openalex.org/W2070570981","https://openalex.org/W2076058038","https://openalex.org/W2087489294","https://openalex.org/W2088350713","https://openalex.org/W2141006753","https://openalex.org/W2942481784"],"related_works":["https://openalex.org/W2070570981","https://openalex.org/W2161029544","https://openalex.org/W2062634550","https://openalex.org/W148616101","https://openalex.org/W1518878750","https://openalex.org/W1572184910","https://openalex.org/W2033838647","https://openalex.org/W2056599833","https://openalex.org/W2746574808","https://openalex.org/W1538377430","https://openalex.org/W1977926680","https://openalex.org/W2020007061","https://openalex.org/W2143623993","https://openalex.org/W2047967858","https://openalex.org/W1977014832","https://openalex.org/W2219148196","https://openalex.org/W326775426","https://openalex.org/W1578168283","https://openalex.org/W1969757713","https://openalex.org/W2091586606"],"abstract_inverted_index":{"The":[0],"time":[1],"required":[2],"by":[3,20],"a":[4,25,31,73,89],"variant":[5],"of":[6,15,34,44,54],"the":[7,41,55,108],"PRAM":[8,70],"(a":[9],"parallel":[10],"machine":[11],"model":[12],"which":[13,18,71,92],"consists":[14],"sequential":[16],"processors":[17],"communicate":[19],"reading":[21],"and":[22,85],"writing":[23],"into":[24],"common":[26],"shared":[27,56],"memory)":[28],"to":[29],"compute":[30],"certain":[32],"class":[33],"functions":[35,38],"called":[36],"critical":[37,74,90],"(which":[39],"include":[40],"Boolean":[42],"OR":[43],"n":[45,81,98],"bits)":[46],"is":[47,66],"studied.":[48],"Simultaneous":[49],"reads":[50],"from":[51],"individual":[52],"cells":[53],"memory":[57],"are":[58,63],"permitted,":[59],"but":[60],"simultaneous":[61],"writes":[62],"not.":[64],"It":[65],"shown":[67],"that":[68,86],"any":[69],"computes":[72],"function":[75,91],"must":[76],"take":[77],"at":[78],"least":[79],"$0.5\\log":[80],"-":[82,99],"O(1)$":[83,100],"steps,":[84],"there":[87],"exists":[88],"can":[93],"be":[94],"computed":[95],"in":[96,107],"$0.57\\log":[97],"steps.":[101],"These":[102],"bounds":[103],"represent":[104],"an":[105],"improvement":[106],"constant":[109],"factor":[110],"over":[111],"those":[112],"previously":[113],"known.":[114]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}