{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:50:52Z","timestamp":1648572652529},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0020-0190(88)90230-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:10:11Z","timestamp":1027642211000},"page":"307-313","source":"Crossref","is-referenced-by-count":9,"title":["Efficient parallel circuits and algorithms for division"],"prefix":"10.1016","volume":"29","author":[{"given":"Narayan","family":"Shankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90230-X_BIB1","series-title":"Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"4","key":"10.1016\/0020-0190(88)90230-X_BIB2","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","article-title":"Log depth circuits for division and related problems","volume":"15","author":"Beame","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(88)90230-X_BIB3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(88)90230-X_BIB4","series-title":"Ph.D. Thesis","article-title":"On the minimum computation time of functions","author":"Cook","year":"1966"},{"key":"10.1016\/0020-0190(88)90230-X_BIB5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math. Comput."},{"key":"10.1016\/0020-0190(88)90230-X_BIB6","unstructured":"J. Hastad and T. Leighton, unpublished result."},{"key":"10.1016\/0020-0190(88)90230-X_BIB7","first-page":"105","article-title":"Asymptotic estimation of addition time of a parallel adder","volume":"19","author":"Krapchenko","year":"1970","journal-title":"Syst. Theory Res."},{"issue":"4","key":"10.1016\/0020-0190(88)90230-X_BIB8","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(88)90230-X_BIB9","series-title":"Tech. Rept.","article-title":"Area-Time Optimal Division for T = \u03c9((log n)1+\u03b5)","author":"Mehlhorn","year":"1986"},{"issue":"7","key":"10.1016\/0020-0190(88)90230-X_BIB10","first-page":"589","article-title":"On the algorithmic complexity of discrete functions","volume":"7","author":"Offman","year":"1963","journal-title":"Soviet Phys. Dokl."},{"issue":"1","key":"10.1016\/0020-0190(88)90230-X_BIB11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","article-title":"Logarithmic depth circuits for algebraic functions","volume":"15","author":"Reif","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(88)90230-X_BIB12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System. Sci."},{"key":"10.1016\/0020-0190(88)90230-X_BIB13","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0020-0190(88)90230-X_BIB14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","article-title":"Schnelle multiplikation grosser zahlen","volume":"7","author":"Schonhage","year":"1971","journal-title":"Computing"},{"issue":"1","key":"10.1016\/0020-0190(88)90230-X_BIB15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","article-title":"A suggestion for a fast multiplier","volume":"EC-13","author":"Wallace","year":"1964","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908890230X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908890230X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:54:59Z","timestamp":1555073699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908890230X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["002001908890230X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90230-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}