{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:40Z","timestamp":1759638940290},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01530929","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:14:30Z","timestamp":1113869670000},"page":"331-360","source":"Crossref","is-referenced-by-count":26,"title":["The input\/output complexity of transitive closure"],"prefix":"10.1007","volume":"3","author":[{"given":"Jeffrey D.","family":"Ullman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"A. Agrawal and H.V. Jagadish, Direct algorithms for computing the transitive closure of database relations,Proc. Int. Conf. on Very Large Data Bases (1987) pp. 255?266."},{"key":"CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974)."},{"key":"CR3","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V.E. Benes","year":"1965","unstructured":"V.E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic (Academic Press, New York, 1965)"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions,Proc. 19th Annual ACM Symp. on the Theory of Computing (1987) pp. 1?6.","DOI":"10.1145\/28395.28396"},{"key":"CR5","unstructured":"H.-T. Kung and J.-W. Hong, The red-blue pebble game,Proc. 13th Annual ACM Symp. on the Theory of Computing (1980) pp. 326?333."},{"issue":"6","key":"CR6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J.E. Hopcroft","year":"1973","unstructured":"J.E. Hopcroft and R.E. Tarjan, Efficient algorithms for graph manipulation, Comm. ACM 16: 6 (1973) 372?378.","journal-title":"Comm. ACM"},{"key":"CR7","unstructured":"Y.E. Ioannidis and R. Ramakrishnan, Efficient transitive closure algorithms, CSTR-765, Dept. of CS, Univ. of Wisconsin (1988)."},{"key":"CR8","volume-title":"Combinatorial Problems and Exercises","author":"G.L. Lovasz","year":"1979","unstructured":"G.L. Lovasz,Combinatorial Problems and Exercises (North-Holland, Amsterdam, 1979)."},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/362875.362879","volume":"12","author":"A.C. McKellar","year":"1969","unstructured":"A.C. McKellar and E.G. Coffman, Organizing matrices and matrix operations for paged memory systems, Comm. ACM 12: 3 (1969) 153?165.","journal-title":"Comm. ACM"},{"key":"CR10","volume-title":"Principles of Database and Knowledge-Base Systems, Vol. 1: Classical Database Systems","author":"J.D. Ullman","year":"1989","unstructured":"J.D. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 1: Classical Database Systems (Computer Science Press, New York, 1989)."},{"key":"CR11","volume-title":"Principles of Database and Knowledge-Base Systems, Vol. 2: The New Technologies","author":"J.D. Ullman","year":"1989","unstructured":"J.D. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 2: The New Technologies (Computer Science Press, New York, 1989)."},{"issue":"4","key":"CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"H.S. Warren","year":"1975","unstructured":"H.S. Warren, A modification of Warshall's algorithm for the transitive closure of binary relations, Comm. ACM 18: 4 (1975) 218?220.","journal-title":"Comm. ACM"},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall, A theorem on Boolean matrices, J. ACM 9: 1 (1962) 11?12.","journal-title":"J. ACM"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530929\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530929.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530929\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T13:31:32Z","timestamp":1556890292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":13,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01530929"],"URL":"https:\/\/doi.org\/10.1007\/bf01530929","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}