{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:34:34Z","timestamp":1794335674375,"version":"4.9.0"},"reference-count":18,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1987,12]]},"abstract":"<jats:p>We present improved partition refinement algorithms for three problems: lexicographic sorting, relational coarsest partition, and double lexical ordering. Our double lexical ordering algorithm uses a new, efficient method for unmerging two sorted sets.<\/jats:p>","DOI":"10.1137\/0216062","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:28:18Z","timestamp":1109226498000},"page":"973-989","source":"Crossref","is-referenced-by-count":888,"title":["Three Partition Refinement Algorithms"],"prefix":"10.1137","volume":"16","author":[{"given":"Robert","family":"Paige","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","volume-title":"The design and analysis of computer algorithms","author":"Aho Alfred V.","year":"1975"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0209045"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(82)90016-0"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322228"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264025"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288968"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis, S. A. Smolka,  CCS expressions, finite state processes, and three problems of equivalence,  Proc. ACM Symposium on Principles of Distributed Computing,  1983,  228\u2013240","DOI":"10.1145\/800221.806724"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90023-3"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0216057"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90101-0"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90159-8"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010410"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0216062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:03Z","timestamp":1787337783000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0216062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["10.1137\/0216062"],"URL":"https:\/\/doi.org\/10.1137\/0216062","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}