{"id":"https://openalex.org/W2052746194","doi":"https://doi.org/10.1137/0217027","title":"Parallel Time $O(\\log n)$ Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM","display_name":"Parallel Time $O(\\log n)$ Acceptance of Deterministic CFLs on an Exclusive-Write P-RAM","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W2052746194","doi":"https://doi.org/10.1137/0217027","mag":"2052746194"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217027","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philip N. Klein","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007364145","display_name":"John H. Reif","orcid":"https://orcid.org/0000-0002-9096-2056"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John H. Reif","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.499,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":13,"citation_normalized_percentile":{"value":0.738248,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":81,"max":82},"biblio":{"volume":"17","issue":"3","first_page":"463","last_page":"485"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994,"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/T11567","display_name":"semigroups and automata theory","score":0.9994,"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.9991,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9989,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.79563624},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.732045},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6862499}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.79563624},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.732045},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6862499},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6088314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5516839},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.4783944},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45541668},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44950828},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.44512412},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4345194},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42950088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4205292},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.41277564},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40085107},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34744978},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26449215},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.21167913},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.15204257},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.09283307},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217027","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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":10,"referenced_works":["https://openalex.org/W1963920725","https://openalex.org/W1965022641","https://openalex.org/W1975937255","https://openalex.org/W1979328074","https://openalex.org/W1980204294","https://openalex.org/W2004618348","https://openalex.org/W2064490449","https://openalex.org/W2287117379","https://openalex.org/W4301662502","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2950941115","https://openalex.org/W2089141720","https://openalex.org/W2067895928","https://openalex.org/W2047588061","https://openalex.org/W2044199853","https://openalex.org/W2026528778","https://openalex.org/W1804899877","https://openalex.org/W1602383402","https://openalex.org/W1584306444","https://openalex.org/W1536687913"],"abstract_inverted_index":{"We":[0],"give":[1],"an":[2,13],"algorithm":[3,37,48],"for":[4],"accepting":[5],"a":[6,26,95,103],"deterministic":[7,27,58,104],"context-free":[8],"language":[9,92],"on":[10,21,43,79],"the":[11],"P-RAM,":[12],"exclusive-write,":[14],"concurrent-read":[15],"model":[16],"of":[17,23,56],"parallel":[18,54],"computation.":[19],"Whereas":[20],"inputs":[22],"length":[24],"n,":[25,35],"push-down":[28],"automaton":[29,61,107],"will":[30],"use":[31],"time":[32,40,70,77,98,112],"linear":[33],"in":[34,39,76,97,108],"our":[36],"runs":[38,75],"$O(\\log":[41],"n)$":[42],"$n^3":[44],"$":[45,81],"processors.":[46],"The":[47,73],"is":[49,84,100],"easily":[50],"generalized":[51],"to":[52],"permit":[53],"simulation":[55,74],"any":[57,91],"auxiliary":[59,105],"pushdown":[60,106],"that":[62,90],"uses":[63],"space":[64,109],"$s(n)":[65],"\\geqq":[66],"\\log":[67],"n$":[68],"and":[69,83,111],"$2^{O(s(n))}":[71,80],"$.":[72,115],"$O(s(n))$":[78],"processors,":[82],"nearly":[85],"optimal,":[86],"since":[87],"we":[88],"observe":[89],"accepted":[93,101],"by":[94,102],"P-RAM":[96],"$T(n)$":[99,110],"$2^{O(T(n)^2":[113],")}":[114]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2052746194","counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2024-12-13T05:27:21.330535","created_date":"2016-06-24"}