{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:00:11Z","timestamp":1725577211844},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669074"},{"type":"electronic","value":"9783540466420"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-46642-0_38","type":"book-chapter","created":{"date-parts":[[2011,1,28]],"date-time":"2011-01-28T18:35:26Z","timestamp":1296239726000},"page":"261-268","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Real Root Isolation Using the Descartes Method"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Decker","sequence":"first","affiliation":[]},{"given":"Werner","family":"Krandick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-60321-2_13","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"C. Boeres","year":"1995","unstructured":"Boeres, C., Chochia, G., Thanisch, P.: On the scope of applicability of the ETF algorithm. In: Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1995. LNCS, vol.\u00a0980, pp. 159\u2013164. Springer, Heidelberg (1995)"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/800205.806346","volume-title":"Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation","author":"G.E. Collins","year":"1976","unstructured":"Collins, G.E., Akritas, A.G.: Polynomial real root isolation using Descartes\u2019 rule of signs. In: Jenks, R.D. (ed.) Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pp. 272\u2013275. ACM, New York (1976)"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/3-540-55328-2_6","volume-title":"Computer Algebra and Parallelism","author":"G.E. Collins","year":"1992","unstructured":"Collins, G.E., Johnson, J.R., K\u00fcchlin, W.: Parallel real root isolation using the coefficient sign variation method. In: Zippel, R.E. (ed.) CAP 1990. LNCS, vol.\u00a0584, pp. 71\u201387. Springer, Heidelberg (1992)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/155332.155333","volume-title":"Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","author":"D. Culler","year":"1993","unstructured":"Culler, D., Kark, R., Patterson, D., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: Towards a realistic model of parallel computation. In: Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1\u201312. ACM, New York (1993)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-63138-0_15","volume-title":"Solving Irregularly Structured Problems in Parallel","author":"T. Decker","year":"1997","unstructured":"Decker, T.: Virtual Data Space\u2014A universal load balancing scheme. In: L\u00fcling, R., Bilardi, G., Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1997. LNCS, vol.\u00a01253, pp. 159\u2013166. Springer, Heidelberg (1997)"},{"issue":"4","key":"38_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., Leung, Y.-T.: Complexity of scheduling parallel tasks systems. SIAM Journal of Discrete Mathematics\u00a02(4), 473\u2013487 (1989)","journal-title":"SIAM Journal of Discrete Mathematics"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/0219008","volume":"19","author":"M.L. Dowling","year":"1990","unstructured":"Dowling, M.L.: A fast parallel Horner algorithm. SIAM Journal on Computing\u00a019(1), 133\u2013142 (1990)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BFb0027119","volume-title":"Solving Combinatorial Optimization Problems in Parallel Methods and Techniques","author":"M. Gengler","year":"1996","unstructured":"Gengler, M.: An introduction to parallel and dynamic programming. In: Ferreira, A., Pardalos, P.M. (eds.) SCOOP 1995. LNCS, vol.\u00a01054, pp. 87\u2013114. Springer, Heidelberg (1996)"},{"issue":"3","key":"38_CR9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/88.242438","volume":"1","author":"A. Grama","year":"1993","unstructured":"Grama, A., Gupta, A., Kumar, V.: Isoefficiency function: A scalability metric for parallel algorithms and architectures. IEEE Parallel and Distributed Technology, Special Issue on Parallel and Distributed Systems: From Theory to Practice\u00a01(3), 12\u201321 (1993)","journal-title":"IEEE Parallel and Distributed Technology, Special Issue on Parallel and Distributed Systems: From Theory to Practice"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1006\/jpdc.1994.1053","volume":"21","author":"Z. Galil","year":"1994","unstructured":"Galil, Z., Park, K.: Parallel algorithms for dynamic programming recurrences with more than o(1) dependency. Journal of Parallel and Distributed Computing\u00a021, 213\u2013222 (1994)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"38_CR11","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"J.-J. Hwang","year":"1989","unstructured":"Hwang, J.-J., Chow, Y.-C., Anger, F.D., Lee, C.-Y.: Scheduling precedence graphs in systems with interprocessor communication times. SIAM Journal of Computing\u00a018(2), 244\u2013257 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(92)90258-H","volume":"106","author":"S.-H.S. Huang","year":"1992","unstructured":"Huang, S.-H.S., Liu, H., Viswanathan, V.: A sublinear parallel algorithm for some dynamic programming problems. Theoretical Computer Science\u00a0106, 361\u2013371 (1992)","journal-title":"Theoretical Computer Science"},{"key":"38_CR13","unstructured":"Karypis, G., Kumar, V.: Efficient parallel formulations for some dynamic programming algorithms. In: Proc. of the 7th International Parallel Processing Symposium, IPPS (1993)"},{"issue":"12","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1109\/12.214665","volume":"41","author":"R. Krishnamurti","year":"1992","unstructured":"Krishnamurti, R., Ma, E.: An approximation algorithm for scheduling tasks on varying partition sizes in partitionable multiprocessor systems. IEEE Transactions on Computers\u00a041(12), 1572\u20131579 (1992)","journal-title":"IEEE Transactions on Computers"},{"key":"38_CR15","first-page":"105","volume-title":"Wissenschaftliches Rechnen","author":"W. Krandick","year":"1995","unstructured":"Krandick, W.: Isolierung reeller Nullstellen von Polynomen. In: Herzberger, J. (ed.) Wissenschaftliches Rechnen, pp. 105\u2013154. Akademie Verlag, Berlin (1995)"},{"issue":"4","key":"38_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/71.494636","volume":"7","author":"G. Lewandowski","year":"1996","unstructured":"Lewandowski, G., Condon, A., Bach, E.: Asynchronous analysis of parallel dynamic programming algorithms. IEEE Transactions on Parallel and Distributed Systems\u00a07(4), 425\u2013437 (1996)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing \u2013 HiPC\u201999"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-46642-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:39:51Z","timestamp":1558309191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-46642-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669074","9783540466420"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-46642-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}