{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:41:24Z","timestamp":1787503284299,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540565031","type":"print"},{"value":"9783540475743","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:15:55Z","timestamp":1330236955000},"page":"463-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Capabilities and complexity of computations with integer division"],"prefix":"10.1007","author":[{"given":"Katharina","family":"L\u00fcrwer-Br\u00fcggemeier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Friedhelm","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"2","key":"46_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0890-5401(88)90031-4","volume":"78","author":"L. Babai","year":"1988","unstructured":"L. Babai, B. Just, F. Meyer auf der Heide, On the limits of computations with the floor function, Information and Computation 78(2), 99\u2013107, 1988.","journal-title":"Information and Computation"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Lower bounds for algebraic computation trees, 15th ACM-STOC, 80\u201386, 1983.","DOI":"10.1145\/800061.808735"},{"key":"46_CR3","unstructured":"R. Brent, H. Kung, Systolic VLSI-arrays for linear time GCD-computation, Proc. Int. Conf. on Very Large Scale Integration. (VLSI 83, IFIP), F. Anceau and E. J. Aas (eds.), 145\u2013154, 1983."},{"key":"46_CR4","unstructured":"N. Bshouty, Euclidean GCD algorithm is not optimal, preprint 1989."},{"key":"46_CR5","unstructured":"N. Bshouty, private communication, 1992."},{"key":"46_CR6","first-page":"417","volume":"16","author":"D. Dobkin","year":"1975","unstructured":"D. Dobkin, R. L. Lipton, A lower bound of 1\/2n\n2 on linear search programs for the knapsack problem, JCSS 16, 417\u2013421, 1975.","journal-title":"JCSS"},{"issue":"1","key":"46_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1051\/ita\/1989230101011","volume":"23","author":"B. Just","year":"1989","unstructured":"B. Just, F. Meyer auf der Heide, A. Wigderson, On computations with integer division, RAIRO Informatique Theoretique 23(1), 101\u2013111, 1989.","journal-title":"RAIRO Informatique Theoretique"},{"issue":"3","key":"46_CR8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF00290735","volume":"19","author":"P. Klein","year":"1983","unstructured":"P. Klein, F. Meyer auf der Heide, A lower bound for the knapsack problem on random access machines, Acta Informatica 19(3), 385\u2013396, 1983.","journal-title":"Acta Informatica"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Y. Mansur, B. Schieber, P. Tiwari, Lower bounds for integer greatest common divisor computation, 29 IEEE FOCS, 54\u201363, 1988.","DOI":"10.1109\/SFCS.1988.21921"},{"key":"46_CR10","unstructured":"J. Meidanis, private communication, 1992."},{"issue":"4","key":"46_CR11","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/4221.4250","volume":"32","author":"F. Meyer","year":"1985","unstructured":"F. Meyer auf der Heide, Lower bounds for solving linear Diophantine equations on random access machines, J. ACM 32(4), 929\u2013937, 1985.","journal-title":"J. ACM"},{"key":"46_CR12","first-page":"331","volume-title":"Monographie 30, L'Enseignement Mathematique, Logique et Algorithmique","author":"W. J. Paul","year":"1992","unstructured":"W. J. Paul, J. Simon, Decision trees and random access machines, Monographie 30, L'Enseignement Mathematique, Logique et Algorithmique, Univ. Geneva, Switzerland, 331\u2013340, 1992."},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"A. Yao, Lower bounds for algebraic computation trees with integer inputs, 30th IEEE FOCS, 308\u2013313, 1989.","DOI":"10.1109\/SFCS.1989.63495"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:03:02Z","timestamp":1578510182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_46"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}