{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:20:15Z","timestamp":1725596415883},"publisher-location":"Vienna","reference-count":18,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783211835937"},{"type":"electronic","value":"9783709162804"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/978-3-7091-6280-4_6","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T14:55:26Z","timestamp":1311000926000},"page":"55-67","source":"Crossref","is-referenced-by-count":1,"title":["Isoefficiency and the Parallel Descartes Method"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Decker","sequence":"first","affiliation":[]},{"given":"Werner","family":"Krandick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0203001","volume":"3","author":"GE Collins","year":"1974","unstructured":"Collins, G.E. (1974). The computing time of the Euclidean algorithm. SIAM Journal on Computing, 3(1), 1\u201310.","journal-title":"SIAM Journal on Computing"},{"unstructured":"Collins, G.E., & Akritas, A.G. (1976). Polynomial real root isolation using Descartes\u2019 rule of signs. In R.D. Jenks (Ed.), Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation (pp. 272\u2013275). ACM.","key":"6_CR2"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-55328-2_6","volume-title":"Computer Algebra and Parallelism","author":"GE Collins","year":"1992","unstructured":"Collins, G.E., Johnson, J.R., & K\u00fcchlin, W. (1992). Parallel real root isolation using the coefficient sign variation method. In R.E. Zippel (Ed.), Computer Algebra and Parallelism., LNCS 584, pp. 71\u201387. Springer-Verlag."},{"issue":"11","key":"6_CR4","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/240455.240477","volume":"39","author":"DE Culler","year":"1996","unstructured":"Culler, D.E., Karp, R.M., Patterson, D., Sahay, A., Santos, E.E., Schauser, K.E., Subramonian, R., & von Eicken, T. (1996). LogP: A practical model of parallel computation. Communications of the ACM, 39(11),78\u201385.","journal-title":"Communications of the ACM"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-540-46642-0_38","volume-title":"High Performance Computing-HIPC\u201999","author":"T Decker","year":"1999","unstructured":"Decker, T., & Krandick, W. (1999). Parallel real root isolation using the Descartes method. In P. Banerjee, V.K. Prasanna, & B.P. Sinha (Eds.), High Performance Computing-HIPC\u201999, LNCS 1745, pp. 261\u2013268. Springer-Verlag."},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/88.242438","volume":"1","author":"AY Grama","year":"1993","unstructured":"Grama, A.Y., Gupta, A., & Kumar, V. (1993). Isoefficiency: Measuring the scalability of parallel algorithms and architectures. IEEE Parallel and Distributed Technology, 1(3), 12\u201321.","journal-title":"IEEE Parallel and Distributed Technology"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1109\/71.598277","volume":"8","author":"A Gupta","year":"1997","unstructured":"Gupta, A., Karypis, G., & Kumar, V. (1997). Highly scalable parallel algorithms for sparse matrix factorization. IEEE Transactions on Parallel and Distributed Systems, 8(5), 502\u2013520.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"8","key":"6_CR8","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/71.238626","volume":"4","author":"A Gupta","year":"1993","unstructured":"Gupta, A., & Kumar, V. (1993). The scalability of FFT on parallel computers. IEEE Transactions on Parallel and Distributed Systems, 4(8), 922\u2013932.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"doi-asserted-by":"crossref","unstructured":"Johnson, J.R., & Krandick, W. (1997). Polynomial real root isolation using approximate arithmetic. In W. K\u00fcchlin (Ed.), International Symposium on Symbolic and Algebraic Computation (pp. 225\u2013232). ACM.","key":"6_CR9","DOI":"10.1145\/258726.258790"},{"key":"6_CR10","first-page":"105","volume-title":"Wissenschaftliches Rechnen","author":"W Krandick","year":"1995","unstructured":"Krandick, W. (1995). Isolierung reeller NullstelIen von Polynomen. In J. Herzberger (Ed.), Wissenschaftliches Rechnen (pp. 105\u2013154). Akademie Verlag, Berlin."},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"CP Kruskal","year":"1990","unstructured":"Kruskal, C.P., Rudolph, L., & Snir, M. (1990). A complexity theory of efficient parallel algorithms. Theoretical Computer Science, 71(1),95\u2013132.","journal-title":"Theoretical Computer Science"},{"key":"6_CR12","volume-title":"Introduction to Parallel C011lputing: Design and Analysis of Algorithms","author":"V Kumar","year":"1994","unstructured":"Kumar, V., Grama, A., Gupta, A., & Karypis, G. (1994). Introduction to Parallel C011lputing: Design and Analysis of Algorithms. Redwood City, CA, USA: Benjamin\/Cummings."},{"unstructured":"Kumar, V., Nageshwara Rao, V., & Ramesh, K. (1988). Parallel depth first search on the ring architecture. In D.H. Bailey (Ed.), Proceedings of the 1988 International Conference on Parallel Processing (Vol. III, pp. 128\u2013132). The Pennsylvania State University Press.","key":"6_CR13"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0743-7315(91)90083-L","volume":"13","author":"V Kumar","year":"1991","unstructured":"Kumar, V., & Singh, V. (1991). Scalability of parallel algorithms for the all-pairs shortest-path problem. Journal of Parallel and Distrihuted Computing, 13, 124\u2013138.","journal-title":"Journal of Parallel and Distrihuted Computing"},{"issue":"7","key":"6_CR15","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1109\/71.598348","volume":"8","author":"NR Mahapatra","year":"1997","unstructured":"Mahapatra, N.R., & Dutt, S. (1997). Scalable global and local hashing strategies for duplicate pruning in parallel A* graph search. IEEE Transactions on Parallel and Distributed Systems, 8(7), 738\u2013756.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/88.481664","volume":"4","author":"S Sahni","year":"1996","unstructured":"Sahni, S., & Thanvantri, V. (1996). Performance metrics: Keeping the focus on runtime. IEEE Parallel and Distributed Technology, 4(1),43\u201356.","journal-title":"IEEE Parallel and Distributed Technology"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1007\/3-540-44520-X_168","volume-title":"Euro-Par 2000 Parallel Processing","author":"W Schreiner","year":"2000","unstructured":"Schreiner, W., Mittermaier, C., & Winkler, F. (2000). On solving a problem in algebraic geometry by cluster computing. In A. Bode, T. Ludwig, W. Karl, & R. Wism\u00fcller (Eds.), Euro-Par 2000 Parallel Processing, LNCS 1900, pp. 1196\u20131200. Springer-Verlag."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/BFb0031617","volume-title":"High-Performance Computing and Networking","author":"T-R Yang","year":"1997","unstructured":"Yang. T.-R., & Lin, H.-X. (1997). Isoefficiency analysis of CGLS algorithm for parallel least squares problems. In B. Hertzberger & P. Sloot (Eds.), High-Performance Computing and Networking, LNCS 1225, pp. 452\u2013461. Springer-Verlag."}],"container-title":["Symbolic Algebraic Methods and Verification Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6280-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T04:32:42Z","timestamp":1606105962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6280-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783211835937","9783709162804"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6280-4_6","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}