{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:32:04Z","timestamp":1725557524816},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642133206"},{"type":"electronic","value":"9783642133213"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13321-3_10","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T02:24:11Z","timestamp":1277173451000},"page":"140-156","source":"Crossref","is-referenced-by-count":1,"title":["Designing an Algorithmic Proof of the Two-Squares Theorem"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o F.","family":"Ferreira","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Dickson, L.E.: History of the Theory of Numbers: Diophantine Analysis: Diophantine Analysis, vol.\u00a02. AMS\/Chelsea Publication, American Mathematical Society (August 1999)"},{"key":"10_CR2","unstructured":"Bell, E.T.: Men of Mathematics - The Lives and Achievements of the Great Mathematicians from Zeno to Poincar\u00e9. Touchstone (July 2008)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Gauss, C.F.: Disquisitiones Arithmeticae. G. Fleischer, Leipzig (1801) English translation by Clarke, A. A. Springer, Heidelberg (1986)","DOI":"10.1007\/978-1-4939-7560-0"},{"key":"10_CR4","first-page":"15","volume":"13","author":"Hermite","year":"1848","unstructured":"Hermite: Note au sujet de l\u2019article pr\u00e9c\u00e9dent. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es\u00a013, 15 (1848)","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"10_CR5","first-page":"12","volume":"13","author":"J.A. Serret","year":"1848","unstructured":"Serret, J.A.: Sur un th\u00e9or\u00e8me relatif aux nombres entiers. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es\u00a013, 12\u201314 (1848)","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"issue":"120","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.2307\/2005889","volume":"26","author":"J. Brillhart","year":"1972","unstructured":"Brillhart, J.: Note on representing a prime as a sum of two squares. Mathematics of Computation\u00a026(120), 1011\u20131013 (1972)","journal-title":"Mathematics of Computation"},{"issue":"7","key":"10_CR7","doi-asserted-by":"publisher","first-page":"652","DOI":"10.2307\/2589495","volume":"106","author":"F.W. Clarke","year":"1999","unstructured":"Clarke, F.W., Everitt, W.N., Littlejohn, L.L., Vorster, S.J.R.: H. J. S. Smith and the Fermat two squares theorem. The American Mathematical Monthly\u00a0106(7), 652\u2013665 (1999)","journal-title":"The American Mathematical Monthly"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"144","DOI":"10.2307\/2323918","volume":"97","author":"D. Zagier","year":"1990","unstructured":"Zagier, D.: A one-sentence proof that every prime p \u2261 1(mod 4) is a sum of two squares. The American Mathematical Monthly\u00a097(2), 144 (1990)","journal-title":"The American Mathematical Monthly"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05412-3","volume-title":"Proofs From The Book","author":"M. Aigner","year":"2004","unstructured":"Aigner, M., Ziegler, G.: Proofs From The Book, 3rd edn. Springer, Heidelberg (2004)","edition":"3"},{"key":"10_CR10","unstructured":"Dijkstra, E.W.: A derivation of a proof by D. Zagier. Circulated privately (August 1993), http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd11xx\/EWD1154.PDF"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.2307\/2323912","volume":"97","author":"S. Wagon","year":"1990","unstructured":"Wagon, S.: Editor\u2019s corner: The Euclidean algorithm strikes again. The American Mathematical Monthly\u00a097(2), 125\u2013129 (1990)","journal-title":"The American Mathematical Monthly"},{"key":"10_CR12","unstructured":"Backhouse, R., Ferreira, J.F.: On Euclid\u2019s algorithm and elementary number theory. To appear in the journal Science of Computer Programming (2010), http:\/\/joaoff.com\/publications\/2009\/euclid-alg\/"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-70594-9_6","volume-title":"Mathematics of Program Construction","author":"R. Backhouse","year":"2008","unstructured":"Backhouse, R., Ferreira, J.F.: Recounting the rationals: Twice! In: Audebaud, P., Paulin-Mohring, C. (eds.) MPC 2008. LNCS, vol.\u00a05133, pp. 79\u201391. Springer, Heidelberg (2008)"},{"key":"10_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5983-1","volume-title":"The Science of Programming","author":"D. Gries","year":"1981","unstructured":"Gries, D.: The Science of Programming. Springer, Heidelberg (1981)"},{"key":"10_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2710-6","volume-title":"What Computing Is All About","author":"J.L. Snepscheut van de","year":"1993","unstructured":"van de Snepscheut, J.L.: What Computing Is All About. Springer, New York (1993)"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/978-1-4612-5695-3_63","volume-title":"Selected Writings on Computing: A Personal Perspective","author":"E.W. Dijkstra","year":"1982","unstructured":"Dijkstra, E.W.: Program inversion. In: Selected Writings on Computing: A Personal Perspective, pp. 351\u2013354. Springer, Heidelberg (1982)"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0020-0190(91)90026-E","volume":"39","author":"J.L.A. Snepscheut van de","year":"1991","unstructured":"van de Snepscheut, J.L.A.: Inversion of a recursive tree traversal. Inf. Process. Lett.\u00a039(5), 265\u2013267 (1991)","journal-title":"Inf. Process. Lett."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/100348.100410","volume-title":"CSC \u201990: Proceedings of the 1990 ACM annual conference on Cooperation","author":"W. Chen","year":"1990","unstructured":"Chen, W.: A formal approach to program inversion. In: CSC \u201990: Proceedings of the 1990 ACM annual conference on Cooperation, pp. 398\u2013403. ACM Press, New York (1990)"},{"issue":"2","key":"10_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0190(91)90141-4","volume":"37","author":"J. Wright von","year":"1991","unstructured":"von Wright, J.: Program inversion in the refinement calculus. Inf. Process. Lett.\u00a037(2), 95\u2013100 (1991)","journal-title":"Inf. Process. Lett."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","first-page":"265","volume-title":"Programming Languages and Systems","author":"S.C. Mu","year":"2003","unstructured":"Mu, S.C., Bird, R.: Rebuilding a tree from its traversals: A case study of program inversion. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 265\u2013282. Springer, Heidelberg (2003)"},{"key":"10_CR21","volume-title":"Concrete Mathematics : a Foundation for Computer Science","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: a Foundation for Computer Science, 2nd edn. Addison-Wesley Publishing Company, Reading (1994)","edition":"2"},{"key":"10_CR22","first-page":"25","volume-title":"Algorithmic Number Theory. Lattices, Number Fields, Curves and Cryptography","author":"J. Buhler","year":"2008","unstructured":"Buhler, J., Wagon, S.: Basic algorithms in number theory. In: Buhler, J.P., Stevenhagen, P. (eds.) Algorithmic Number Theory. Lattices, Number Fields, Curves and Cryptography, pp. 25\u201368. Cambridge University Press, Cambridge (2008)"},{"key":"10_CR23","first-page":"33","volume":"46","author":"G. Cornacchia","year":"1908","unstructured":"Cornacchia, G.: Su di un metodo per la risoluzione in numeri interi dell\u2019equazione $\\sum_{h=0}^{n} {C}_{h} x^{n-h} y^{h}={P}$ . Giornale di Matematiche di Battaglini\u00a046, 33\u201390 (1908)","journal-title":"Giornale di Matematiche di Battaglini"},{"issue":"191","key":"10_CR24","doi-asserted-by":"publisher","first-page":"327","DOI":"10.2307\/2008809","volume":"55","author":"K. Hardy","year":"1990","unstructured":"Hardy, K., Muskat, J.B., Williams, K.S.: A deterministic algorithm for solving n\u2009=\u2009fu 2\u2009+\u2009gv 2 in coprime integers u and v. Mathematics of Computation\u00a055(191), 327\u2013343 (1990)","journal-title":"Mathematics of Computation"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-04912-5_4","volume-title":"Teaching Formal Methods","author":"J.F. Ferreira","year":"2009","unstructured":"Ferreira, J.F., Mendes, A., Backhouse, R., Barbosa, L.S.: Which mathematics for the information society? In: Oliveira, J. (ed.) TFM 2009. LNCS, vol.\u00a05846, pp. 39\u201356. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13321-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:04:47Z","timestamp":1606169087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13321-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642133206","9783642133213"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13321-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}