{"id":"https://openalex.org/W2151282032","doi":"https://doi.org/10.1109/ipdps.2004.1302994","title":"Finding satisfying global states: all for one and one for all","display_name":"Finding satisfying global states: all for one and one for all","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2151282032","doi":"https://doi.org/10.1109/ipdps.2004.1302994","mag":"2151282032"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1302994","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1302994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-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/A5103161933","display_name":"Neeraj Mittal","orcid":"https://orcid.org/0000-0002-8734-1400"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"N. Mittal","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050136674","display_name":"Alper \u015een","orcid":"https://orcid.org/0000-0002-5508-6484"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alper Sen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061474994","display_name":"Vijay K. Garg","orcid":"https://orcid.org/0000-0002-5797-4389"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V.K. Garg","raw_affiliation_strings":["Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030847317","display_name":"Ranganath Atreya","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Atreya","raw_affiliation_strings":["Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Texas at Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103161933"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":1.2453,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84766669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"972","issue":null,"first_page":"66","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9912999868392944,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9782999753952026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.8126169443130493},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.7094120979309082},{"id":"https://openalex.org/keywords/slicing","display_name":"Slicing","score":0.7051416039466858},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5863771438598633},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.573155403137207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5714308023452759},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5472913384437561},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4904915988445282},{"id":"https://openalex.org/keywords/program-slicing","display_name":"Program slicing","score":0.47284963726997375},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3928203284740448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35092759132385254}],"concepts":[{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.8126169443130493},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7094120979309082},{"id":"https://openalex.org/C2776190703","wikidata":"https://www.wikidata.org/wiki/Q488148","display_name":"Slicing","level":2,"score":0.7051416039466858},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5863771438598633},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.573155403137207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5714308023452759},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5472913384437561},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4904915988445282},{"id":"https://openalex.org/C91071405","wikidata":"https://www.wikidata.org/wiki/Q1413145","display_name":"Program slicing","level":3,"score":0.47284963726997375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3928203284740448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35092759132385254},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/ipdps.2004.1302994","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1302994","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.7028","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.7028","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.ece.utexas.edu/~garg/dist/equivalence.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.1362","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.1362","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~nxm020100/publications/23/ipdps04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.2340","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.2340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.utexas.edu/~garg/dist/ipdps04.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.7965","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.7965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.utexas.edu/~garg/dist/ipdps04.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.8114","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.8114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.utexas.edu/%7Egarg/dist/ipdps04.ps","raw_type":"text"}],"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/W1529733775","https://openalex.org/W1547206149","https://openalex.org/W1591298262","https://openalex.org/W1652742168","https://openalex.org/W1914135806","https://openalex.org/W1973501242","https://openalex.org/W1990697576","https://openalex.org/W2010892521","https://openalex.org/W2065156609","https://openalex.org/W2093397547","https://openalex.org/W2096225456","https://openalex.org/W2100559484","https://openalex.org/W2108837172","https://openalex.org/W2126793939","https://openalex.org/W2128553025","https://openalex.org/W2131053137","https://openalex.org/W2135697757","https://openalex.org/W2147066648","https://openalex.org/W2166842511","https://openalex.org/W3137220996","https://openalex.org/W4285719527","https://openalex.org/W4300885858","https://openalex.org/W6636927302","https://openalex.org/W6639934010","https://openalex.org/W6676447161","https://openalex.org/W6679356634"],"related_works":["https://openalex.org/W2134982133","https://openalex.org/W1964336761","https://openalex.org/W4239953224","https://openalex.org/W2011854888","https://openalex.org/W1595405651","https://openalex.org/W2347708239","https://openalex.org/W4302024603","https://openalex.org/W2112395437","https://openalex.org/W2086289103","https://openalex.org/W2949284097"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"Given":[4],"a":[5,9,91,95,154,187],"distributed":[6],"computation":[7,29,38,63,75,96],"and":[8,74,77,135],"global":[10,25],"predicate,":[11],"predicate":[12,72,92,161,188],"detection":[13,73,126,162,209],"involves":[14],"determining":[15],"whether":[16],"there":[17],"exists":[18],"at":[19],"least":[20,50],"one":[21],"consistent":[22,53,59],"cut":[23],"(or":[24],"state)":[26],"of":[27,52,61,106,114,124,133,140,197,207],"the":[28,32,35,44,49,62,65,69,80,104,115,122,125,131,138,145,159,184,198,205,208,214,218],"that":[30,56,79,189],"satisfies":[31],"predicate.":[33,66],"On":[34],"other":[36],"hand,":[37],"slicing":[39,76,117],"is":[40,119,130,137,200,213],"concerned":[41],"with":[42,48,108],"computing":[43,183],"smallest":[45],"sub-computation":[46],"-":[47,55],"number":[51,132],"cuts":[54,60],"contains":[57],"all":[58,172],"satisfying":[64],"We":[67,142,176],"investigate":[68],"relationship":[70],"between":[71],"show":[78],"two":[81],"problems":[82],"are":[83,171],"equivalent.":[84],"Specifically,":[85],"given":[86],"an":[87,100,179],"algorithm":[88,101,118,156,181,199],"to":[89,102,110,152],"detect":[90],"b":[93],"in":[94,167,174,217],"C,":[97],"we":[98],"derive":[99,153],"compute":[103],"slice":[105,185],"C":[107],"respect":[109],"b.":[111],"The":[112,194],"time-complexity":[113,123,196,206],"(derived)":[116],"O(n|E|)":[120],"times":[121,204],"algorithm,":[127,210],"where":[128,211],"n":[129],"processes":[134],"E":[136],"set":[139],"events.":[141],"discuss":[143],"how":[144],"\"equivalence":[146],"\"":[147],"result":[148],"can":[149,190],"be":[150,191],"utilized":[151],"faster":[155],"for":[157,182,186],"solving":[158],"general":[160],"problem.":[163],"Slicing":[164],"algorithms":[165],"described":[166],"our":[168],"earlier":[169],"papers":[170],"off-line":[173],"nature.":[175],"also":[177],"give":[178],"online":[180],"detected":[192],"efficiently.":[193],"amortized":[195],"O(n(c":[201],"+":[202],"n))":[203],"c":[212],"average":[215],"concurrency":[216],"computation.":[219]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}