{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:05Z","timestamp":1725544625079},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540333395"},{"type":"electronic","value":"9783540333401"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11734673_18","type":"book-chapter","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T17:59:04Z","timestamp":1151949544000},"page":"225-236","source":"Crossref","is-referenced-by-count":1,"title":["Knuth-Bendix Completion as a Data Structure"],"prefix":"10.1007","author":[{"given":"Georg","family":"Struth","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"18_CR2","first-page":"381","volume-title":"Proc. 41th IEEE Symp. on Foundations of Computer Science","author":"C. Demetrescu","year":"2000","unstructured":"Demetrescu, C., Italiano, G.: Fully dynamic transitive closure: Breaking through the O(n\n                           2) barrier. In: Proc. 41th IEEE Symp. on Foundations of Computer Science, pp. 381\u2013389. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"18_CR3","first-page":"664","volume-title":"Proc. 36th Symp. on Foundations of Computer Science","author":"M. Henzinger","year":"1995","unstructured":"Henzinger, M., King, V.: Fully dynamic biconnectivity and transitive closure. In: Proc. 36th Symp. on Foundations of Computer Science, pp. 664\u2013672. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-62950-5_59","volume-title":"Rewriting Techniques and Applications","author":"D. Kapur","year":"1997","unstructured":"Kapur, D.: Shostak\u2019s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 23\u201337. Springer, Heidelberg (1997)"},{"key":"18_CR5","first-page":"81","volume-title":"Proc. 40th IEEE Symp. on Foundations of Computer Science","author":"V. King","year":"1999","unstructured":"King, V.: Fully dynamic algorithms for maintaining all-time shortest paths and transitive closure in digraphs. In: Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 81\u201389. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"18_CR6","unstructured":"Nelson, G.: Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center (1981)"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(83)90038-8","volume":"17","author":"O. Shmueli","year":"1983","unstructured":"Shmueli, O.: Dynamic cycle detection. Information Processing Letters\u00a017(4), 185\u2013188 (1983)","journal-title":"Information Processing Letters"},{"key":"18_CR8","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Second International Workshop on Rule-Based Programming (RULE 2001)","author":"G. Struth","year":"2001","unstructured":"Struth, G.: Knuth-Bendix completion for non-symmetric transitive relations. In: van den Brand, M., Verma, R. (eds.) Second International Workshop on Rule-Based Programming (RULE 2001). Electronic Notes in Theoretical Computer Science, vol.\u00a059. Elsevier Science Publishers, Amsterdam (2001)"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"18_CR9","unstructured":"Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Relational Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11734673_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:36:35Z","timestamp":1552350995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11734673_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540333395","9783540333401"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11734673_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}