{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T15:07:19Z","timestamp":1770476839395,"version":"3.49.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"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":12526,"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":[[1979,4]]},"DOI":"10.1016\/0022-0000(79)90042-4","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T06:41:56Z","timestamp":1070606516000},"page":"110-127","source":"Crossref","is-referenced-by-count":187,"title":["A class of algorithms which require nonlinear time to maintain disjoint sets"],"prefix":"10.1016","volume":"18","author":[{"given":"Robert Endre","family":"Tarjan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90042-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(79)90042-4_BIB2","series-title":"The Computational Complexity of Algebraic and Numeric Problems","author":"Borodin","year":"1975"},{"key":"10.1016\/0022-0000(79)90042-4_BIB3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0020-0190(76)90061-2","article-title":"Linear expected time of a simple union-find algorithm","volume":"5","author":"Doyle","year":"1976","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0022-0000(79)90042-4_BIB4","series-title":"Complexity of Computer Computations","first-page":"153","article-title":"Efficiency of equivalence algorithms","author":"Fischer","year":"1972"},{"key":"10.1016\/0022-0000(79)90042-4_BIB5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/364099.364331","article-title":"An improved equivalence algorithm","volume":"7","author":"Galler","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(79)90042-4_BIB6","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\/0022-0000(79)90042-4_BIB7","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1145\/361227.361231","article-title":"The intrinsically exponential complexity of the circularity problem for attribute grammars","volume":"18","author":"Jazayeri","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(79)90042-4_BIB8","series-title":"The Art of Computer Programming","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0022-0000(79)90042-4_BIB9","series-title":"Sorting and Searching","volume":"Vol. 3","author":"Knuth","year":"1975"},{"key":"10.1016\/0022-0000(79)90042-4_BIB10","article-title":"The expected linearity of a simple equivalence algorithm","author":"Knuth","year":"1977"},{"key":"10.1016\/0022-0000(79)90042-4_BIB11","first-page":"175","article-title":"On the notion of algorithm","volume":"8","author":"Kolmogorov","year":"1953","journal-title":"Uspehi Mat. Nauk."},{"key":"10.1016\/0022-0000(79)90042-4_BIB12_1","first-page":"3","article-title":"On the definition of an algorithm","volume":"13","author":"Kolmogorov","year":"1958","journal-title":"Uspehi Mat. Nauk."},{"key":"10.1016\/0022-0000(79)90042-4_BIB12_2","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1090\/trans2\/029\/07","volume":"29","author":"Kolmogorov","year":"1963","journal-title":"Amer. Math. Soc. Transl."},{"key":"10.1016\/0022-0000(79)90042-4_BIB13","series-title":"Proc. l3th Annual Symp. on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/0022-0000(79)90042-4_BIB14","first-page":"27","article-title":"Super-exponential complexity of Presburger arithmetic","volume":"7","author":"Rabin","year":"1974"},{"key":"10.1016\/0022-0000(79)90042-4_BIB15","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","article-title":"On recognizing graph properties from adjacency matrices","volume":"3","author":"Rivest","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(79)90042-4_BIB16","article-title":"Real-time simulation of multidimensional Turing machines by storage modification machines","author":"Sch\u00f6nhage","year":"1973"},{"key":"10.1016\/0022-0000(79)90042-4_BIB17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear disjoint set union algorithm","volume":"22","author":"Tartan","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(79)90042-4_BIB18","series-title":"Technical Report STANCS-75-512","article-title":"Applications of path compression on balanced trees","author":"Tartan","year":"1975"},{"key":"10.1016\/0022-0000(79)90042-4_BIB19","series-title":"Technical Report STAN-CS-75-528","article-title":"Solving path problems on directed graphs","author":"Tartan","year":"1975"},{"key":"10.1016\/0022-0000(79)90042-4_BIB20","series-title":"Proc. Eighth Annual ACM Symp. on Theory of Computing","first-page":"192","article-title":"On the average behavior of set merging algorithms","author":"Yao","year":"1976"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900424?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900424?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:20:36Z","timestamp":1550301636000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0022000079900424"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90042-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}