{"id":"https://openalex.org/W2042647740","doi":"https://doi.org/10.1137/0217046","title":"Parallel Algorithms for Term Matching","display_name":"Parallel Algorithms for Term Matching","publication_year":1988,"publication_date":"1988-08-01","ids":{"openalex":"https://openalex.org/W2042647740","doi":"https://doi.org/10.1137/0217046","mag":"2042647740"},"language":"en","primary_location":{"id":"doi:10.1137/0217046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217046","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/A5011820318","display_name":"Cynthia Dwork","orcid":"https://orcid.org/0000-0001-7177-3738"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cynthia Dwork","raw_affiliation_strings":["IBM Research Lab, San Jose and MIT Lab for Computer Science, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research Lab, San Jose and MIT Lab for Computer Science, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110195580","display_name":"Paris C. Kanellakis","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Paris C. Kanellakis","raw_affiliation_strings":["Brown University and MIT Lab for Computer Science, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University and MIT Lab for Computer Science, USA","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111558966","display_name":"Larry Stockmeyer","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Larry Stockmeyer","raw_affiliation_strings":["IBM Research Lab, San Jose,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research Lab, San Jose,","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6719,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.89972527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"17","issue":"4","first_page":"711","last_page":"731"},"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.9991000294685364,"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.9991000294685364,"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.9983999729156494,"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/T11567","display_name":"semigroups and automata theory","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.6892265677452087},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5805736184120178},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.5632081031799316},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5623030066490173},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5603048205375671},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.531636118888855},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5209338068962097},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.5130075812339783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.507415235042572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48812493681907654},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4711659848690033},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.4617811143398285},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.43858981132507324},{"id":"https://openalex.org/keywords/freivalds-algorithm","display_name":"Freivalds' algorithm","score":0.43253570795059204},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3912133276462555},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3778042793273926},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3101479113101959},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2180367112159729},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.20127072930335999}],"concepts":[{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.6892265677452087},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5805736184120178},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.5632081031799316},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5623030066490173},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5603048205375671},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.531636118888855},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5209338068962097},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.5130075812339783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.507415235042572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48812493681907654},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4711659848690033},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.4617811143398285},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.43858981132507324},{"id":"https://openalex.org/C38506071","wikidata":"https://www.wikidata.org/wiki/Q6522941","display_name":"Freivalds' algorithm","level":5,"score":0.43253570795059204},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3912133276462555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3778042793273926},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3101479113101959},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2180367112159729},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.20127072930335999},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0217046","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0217046","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":26,"referenced_works":["https://openalex.org/W1578088218","https://openalex.org/W1598625331","https://openalex.org/W1968380471","https://openalex.org/W1972332180","https://openalex.org/W1972433940","https://openalex.org/W1975146994","https://openalex.org/W1979036815","https://openalex.org/W1982347904","https://openalex.org/W1982801224","https://openalex.org/W1986597203","https://openalex.org/W1995040285","https://openalex.org/W1998777945","https://openalex.org/W2004618348","https://openalex.org/W2035476608","https://openalex.org/W2042607215","https://openalex.org/W2074456731","https://openalex.org/W2080132708","https://openalex.org/W2085750496","https://openalex.org/W2088956149","https://openalex.org/W2100738443","https://openalex.org/W2139932807","https://openalex.org/W2140380153","https://openalex.org/W2149410722","https://openalex.org/W2166822586","https://openalex.org/W2171608071","https://openalex.org/W4213232664"],"related_works":["https://openalex.org/W1508924483","https://openalex.org/W2007715402","https://openalex.org/W2565865680","https://openalex.org/W2049645503","https://openalex.org/W3137469021","https://openalex.org/W4205469090","https://openalex.org/W4390439624","https://openalex.org/W4249066376","https://openalex.org/W2053924317","https://openalex.org/W1992170089"],"abstract_inverted_index":{"We":[0,152],"present":[1],"a":[2,84],"randomized":[3,52,150],"parallel":[4,35,116,129],"algorithm":[5,30,53,72,141],"for":[6],"term":[7,125],"matching.":[8],"Let":[9],"n":[10],"be":[11,26],"the":[12,17,23,43,56,62,71,96,99,145,155,164],"number":[13,80],"of":[14,16,45,55,81,98,148,158],"nodes":[15],"directed":[18,121],"acyclic":[19],"graphs":[20],"(dags)":[21],"representing":[22],"terms":[24,176],"to":[25,75,110,124],"matched.":[27],"Then":[28],"our":[29,149],"uses":[31],"$O(\\log":[32,113],"^2":[33,114],"n)$":[34,115],"time":[36,130],"and":[37,131,161],"$M(n)$":[38,41],"processors,":[39],"where":[40],"is":[42,54,64,83,136,170],"complexity":[44],"$n":[46],"\\times":[47],"n$":[48],"matrix":[49],"multiplication.":[50],"The":[51,79],"Las":[57],"Vegas":[58],"type,":[59],"that":[60,138,168],"is,":[61],"answer":[63],"always":[65],"correct,":[66],"although":[67],"with":[68],"small":[69],"probability":[70],"might":[73],"fail":[74],"produce":[76],"an":[77],"answer.":[78],"processors":[82,105],"significant":[85],"improvement":[86],"over":[87],"previously":[88],"known":[89],"bounds.":[90],"Under":[91],"various":[92],"syntactic":[93],"restrictions":[94],"on":[95,163],"form":[97],"input":[100,175],"dags,":[101],"only":[102],"$O(n^2":[103,132],")$":[104,133],"are":[106,177],"required":[107],"in":[108,186],"order":[109],"achieve":[111],"deterministic":[112,140],"time.":[117],"Furthermore,":[118],"we":[119],"reduce":[120],"graph":[122],"reachability":[123],"matching":[126],"using":[127],"constant":[128],"processors.":[134],"This":[135],"evidence":[137],"no":[139,180],"can":[142],"significantly":[143],"beat":[144],"processor":[146],"bound":[147],"algorithm.":[151],"also":[153],"improve":[154],"P-completeness":[156],"result":[157],"Dwork,":[159],"Kanellakis,":[160],"Mitchell":[162],"unification":[165,169],"problem,":[166],"showing":[167],"P-complete":[171],"even":[172],"if":[173],"both":[174],"linear,":[178],"i.e.,":[179],"variable":[181],"appears":[182],"more":[183],"than":[184],"once":[185],"each":[187],"term.":[188]},"counts_by_year":[{"year":2014,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}