{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:42Z","timestamp":1725664962158},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617327"},{"type":"electronic","value":"9783540707400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61732-9_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:16:54Z","timestamp":1330294614000},"page":"176-190","source":"Crossref","is-referenced-by-count":0,"title":["PATCH Graphs: An efficient data structure for completion of finitely presented groups"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Lynch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Polina","family":"Strogova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"R. V. Book and F. Otto. String-Rewriting Sytsems. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"11_CR2","unstructured":"Hans B\u00fccken. Reduction-systems and small cancellation theory. In Proceedings of 4th Workshop on Automated Deduction, pages 53\u201359, 1979."},{"key":"11_CR3","first-page":"244","volume-title":"Handbook of Theoretical Computer Science, volume B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0747-7171(08)80093-4","volume":"12","author":"D. B. A. Epstein","year":"1991","unstructured":"D. B. A. Epstein, D. F. Holt, and S. Rees. The use of knuth-bendix methods to solve the word problem in authomatic groups. Journal of Symbolic Computation, 12:397\u2013414, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR5","unstructured":"D. Fortin, C. Kirchner, and P. Strogova. Routing in Regular Networks Using Rewriting. In J. Slaney, editor, Proceedings of the CADE international workshop on automated reasoning in algebra (ARIA), pages 5\u20138, June 1994."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/0021-8693(79)90238-2","volume":"57","author":"R. H. Gilman","year":"1979","unstructured":"R. H. Gilman. Presentations of groups and monoids. J. of Algebra, 57:544\u2013554, 1979.","journal-title":"J. of Algebra"},{"key":"11_CR7","volume-title":"Testing for isomorphism between finitely presented groups","author":"D. Holt","year":"1989","unstructured":"D. Holt and S. Rees. Testing for isomorphism between finitely presented groups. In Proceedings of the Conference on Groups and Combinatorics, Cambridge, 1989. Cambridge University Press."},{"key":"11_CR8","first-page":"263","volume-title":"Computational Problems in Abstract Algebra","author":"D. E. Knuth","year":"1970","unstructured":"Donald E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263\u2013297. Pergamon Press, Oxford, 1970."},{"key":"11_CR9","first-page":"768","volume-title":"volume 310 of Lecture Notes in Computer Science","author":"D. Kapur","year":"1988","unstructured":"D. Kapur and H. Zhang. RRL: A rewrite rule laboratory. In Proceedings 9th International Conference on Automated Deduction, Argonne (Ill. USA), volume 310 of Lecture Notes in Computer Science, pages 768\u2013769. Springer-Verlag, 1988."},{"key":"11_CR10","unstructured":"Ph. Le Chenadec. Canonical Forms in Finitely Presented Algebras. John Wiley & Sons, 1986."},{"key":"11_CR11","unstructured":"Christopher Lynch and Polina Strogova. Sour graphs for efficient completion. Technical Report 95-R-343, CRIN, 1995."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Christopher Lynch. Paramodulation without duplication. In Dexter Kozen, editor, Proceedings of LICS'95, San Diego, June 1995.","DOI":"10.1109\/LICS.1995.523254"},{"key":"11_CR13","volume-title":"Th\u00e8se de Doctorat d'Universit\u00e9","author":"C. March\u00e9","year":"1993","unstructured":"C. March\u00e9. R\u00e9\u00e9criture modulo une th\u00e9orie pr\u00e9sent\u00e9e par un syst\u00e8me convergent et d\u00e9cidabilit\u00e9 du probl\u00e8me du mot dans certaines classes de th\u00e9ories \u00e9quationnelles. Th\u00e8se de Doctorat d'Universit\u00e9, Universit\u00e9 de Paris-Sud, Orsay (France), October 1993."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"U. Martin. Theorem proving with group presentations: examples and questions. In Proceedings of CADE-13, 1996. To appear.","DOI":"10.1007\/3-540-61511-3_100"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"W. W. McCune. Otter 3.0: Reference manual and guide. Technical Report 6, Argonne National Laboratory, 1994.","DOI":"10.2172\/10129052"},{"key":"11_CR16","series-title":"volume 516 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-54233-7_141","volume-title":"Proceedings 18th ICALP Conference","author":"K. Madlener","year":"1991","unstructured":"K. Madlener, P. Narendran, and F. Otto. A specialized completion procedure for monadic string-rewriting systems presenting groups. In Proceedings 18th ICALP Conference, Madrid (Spain), volume 516 of Lecture Notes in Computer Science, pages 279\u2013290. Springer-Verlag, 1991."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0747-7171(87)80002-0","volume":"3","author":"C. C. Sims","year":"1987","unstructured":"C. C. Sims. Verifying nilpotence. Journal of Symbolic Computation, 3:231\u2013247, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"H. Zhang. Herky: High-performance rewriting techniques in rrl. In D. Kapur, editor, Proceedings of 1992 International Conference of Automated Deduction, volume 607 of Lecture Notes in Artificial Intelligence, pages 696\u2013700. Springer-Verlag, 1992.","DOI":"10.1007\/3-540-55602-8_206"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Symbolic Mathematical Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61732-9_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:50Z","timestamp":1605647390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61732-9_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617327","9783540707400"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-61732-9_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}