{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:22Z","timestamp":1759638502834},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":14108,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,12]]},"DOI":"10.1016\/s0022-0000(74)80049-8","type":"journal-article","created":{"date-parts":[[2010,11,10]],"date-time":"2010-11-10T04:46:40Z","timestamp":1289364400000},"page":"355-365","source":"Crossref","is-referenced-by-count":128,"title":["Testing flow graph reducibility"],"prefix":"10.1016","volume":"9","author":[{"given":"R. Endre","family":"Tarjan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80049-8_bib1","series-title":"Proc. 5th Annual ACM Symposium on Theory of Computing","first-page":"253","article-title":"On finding lowest common ancestors in trees","author":"Aho","year":"1972"},{"key":"10.1016\/S0022-0000(74)80049-8_bib2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/390013.808480","article-title":"Global common subexpression elimination","volume":"5","author":"Cocke","year":"1970","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0022-0000(74)80049-8_bib3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00289078","article-title":"Fast algorithms for the elimination of common subexpressions","volume":"2","author":"Ullman","year":"1974","journal-title":"Acta Informatica"},{"key":"10.1016\/S0022-0000(74)80049-8_bib4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/00207167108803048","article-title":"A global flow analysis algorithm","volume":"3","author":"Kennedy","year":"1971","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0022-0000(74)80049-8_bib5","author":"Shaeffer","year":"1973"},{"key":"10.1016\/S0022-0000(74)80049-8_bib6","author":"Aho","year":"1973"},{"key":"10.1016\/S0022-0000(74)80049-8_bib7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/390013.808479","article-title":"Program optimization","volume":"5","author":"Allen","year":"1970","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/S0022-0000(74)80049-8_bib8","article-title":"Program optimization","volume":"Vol. 5","author":"Allen","year":"1969"},{"key":"10.1016\/S0022-0000(74)80049-8_bib9","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0201014","article-title":"Flow graph reducibility","volume":"1","author":"Hecht","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(74)80049-8_bib10","series-title":"Proc. 2nd International Conf. on System Sciences","first-page":"143","article-title":"Some analysis techniques for optimizing computer programs","author":"Cocke","year":"1969"},{"key":"10.1016\/S0022-0000(74)80049-8_bib11","article-title":"Characterizations of Reducible Flow Graphs","author":"Hecht","year":"1973"},{"key":"10.1016\/S0022-0000(74)80049-8_bib12","series-title":"Proc. 6th Annual Princeton Conf. on Inf. Sciences and Systems","first-page":"119","article-title":"An n log n algorithm for detecting reducible graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/S0022-0000(74)80049-8_bib13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(74)80049-8_bib14","unstructured":"R. E. Tarjan, Finding dominators in directed graphs, SIAM J. Comput. in press."},{"key":"10.1016\/S0022-0000(74)80049-8_bib15","series-title":"Complexity of Computer Computations","first-page":"153","article-title":"Efficiency of equivalence algorithms","author":"Fischer","year":"1972"},{"key":"10.1016\/S0022-0000(74)80049-8_bib16","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0202024","article-title":"Set merging algorithms","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(74)80049-8_bib17","article-title":"On the efficiency of a good but not linear disjoint set union algorithm","author":"Tarjan","year":"1972"},{"key":"10.1016\/S0022-0000(74)80049-8_bib18","first-page":"315","author":"Knuth","year":"1968"},{"key":"10.1016\/S0022-0000(74)80049-8_bib19","first-page":"170","author":"Knuth","year":"1973"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800498?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800498?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T18:52:04Z","timestamp":1544122324000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["S0022000074800498"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80049-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}