{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:17Z","timestamp":1725662897284},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:51Z","timestamp":1330192971000},"page":"371-379","source":"Crossref","is-referenced-by-count":3,"title":["A linear time algorithm to solve the single function coarsest partition problem"],"prefix":"10.1007","author":[{"given":"Robert","family":"Paige","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"33_CR1","unstructured":"Aho, A., Hopcroft, J., Ullman, J., Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"33_CR2","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1966","unstructured":"Birkhoff, G. Lattice Theory. American Mathematical Society, Providence, 1966."},{"issue":"45","key":"33_CR3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"K. S. Booth","year":"1980","unstructured":"Booth, K. S. \"Lexicographically Least Circular Substrings.\" IPL 10, 4,5 (July 1980), 240\u2013242.","journal-title":"IPL"},{"issue":"4","key":"33_CR4","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","volume":"27","author":"P. Downey","year":"1980","unstructured":"Downey, P., Sethi, R., and Tarjan, R. \"Variations on the Common Subexpression Problem.\" JACM 27, 4 (Oct 1980), 758\u2013771.","journal-title":"JACM"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J. E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E. An n log n Algorithm for Minimizing States in a Finite Automaton. In Theory of Machines and Computations, Kohavi, and Paz, Ed., Academic Press, New York, 1971, pp. 189\u2013196."},{"issue":"2","key":"33_CR6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R. \"Fast Pattern Matching in Strings.\" SIAM J. Computing 6, 2 (1977), 323\u2013350.","journal-title":"SIAM J. Computing"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Nelson, G., and Oppen, D. \"Fast Decision Procedures Based on Congruence Closure.\" JACM 27, 2 (Apr 1980).","DOI":"10.1145\/322186.322198"},{"issue":"3","key":"33_CR8","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/357172.357177","volume":"4","author":"R. Paige","year":"1982","unstructured":"Paige, R., and Koenig, S. \"Finite Differencing of Computable Expressions.\" ACM TOPLAS 4, 3 (July 1982), 402\u2013454.","journal-title":"ACM TOPLAS"},{"issue":"12","key":"33_CR9","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1145\/361227.361235","volume":"18","author":"J. T. Schwartz","year":"1975","unstructured":"Schwartz, J.T. \"Automatic Data Structure Choice in a Language of Very High Level.\" CACM 18, 12 (Dec 1975), 722\u2013728.","journal-title":"CACM"},{"key":"33_CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y. \"Fast Canonization of Circular Strings.\" Journal of Algorithms 2 (June 1981), 107\u2013121.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:48Z","timestamp":1619556768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}