{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T11:25:41Z","timestamp":1778757941155,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T00:00:00Z","timestamp":1595203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["I 4552-N"],"award-info":[{"award-number":["I 4552-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008952","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["19- CE48-0015"],"award-info":[{"award-number":["19- CE48-0015"]}],"id":[{"id":"10.13039\/501100008952","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["813211"],"award-info":[{"award-number":["813211"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,20]]},"DOI":"10.1145\/3373207.3404048","type":"proceedings-article","created":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T14:07:23Z","timestamp":1595858843000},"page":"62-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Robots, computer algebra and eight connected components"],"prefix":"10.1145","author":[{"given":"Jose","family":"Capco","sequence":"first","affiliation":[{"name":"Innsbruck University, Innsbruck, Austria"}]},{"given":"Mohab Safey El","family":"Din","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, Paris, France"}]},{"given":"Josef","family":"Schicho","sequence":"additional","affiliation":[{"name":"JKU University, Linz, Austria"}]}],"member":"320","published-online":{"date-parts":[[2020,7,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34580-2"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0269"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0432"},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"On the geometry of polar varieties. Applicable Algebra in Engineering","volume":"21","author":"Bank B.","year":"2010","unstructured":"Bank , B. , Giusti , M. , Heintz , J. , Safey El Din , M. , and Schost , E . On the geometry of polar varieties. Applicable Algebra in Engineering , Communication and Computing 21 , 1 ( 2010 ), 33--83. Bank, B., Giusti, M., Heintz, J., Safey El Din, M., and Schost, E. On the geometry of polar varieties. Applicable Algebra in Engineering, Communication and Computing 21, 1 (2010), 33--83.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0434"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-99-00311-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05355-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-014-9610-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-014-9212-1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03718-8"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/49142"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/36.5.504"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1515\/9783110881271.83"},{"key":"e_1_3_2_1_14_1","volume-title":"Commutative Algebra: with a view toward algebraic geometry","author":"Eisenbud D.","year":"2013","unstructured":"Eisenbud , D. Commutative Algebra: with a view toward algebraic geometry , vol. 150 . Springer Science & Business Media , 2013 . Eisenbud, D. Commutative Algebra: with a view toward algebraic geometry, vol. 150. Springer Science & Business Media, 2013."},{"key":"e_1_3_2_1_15_1","volume-title":"A new efficient algorithm for computing gr\u00f6bner bases (f4). Journal of pure and applied algebra 139, 1--3","author":"Faug\u00e8re J.-C.","year":"1999","unstructured":"Faug\u00e8re , J.-C. A new efficient algorithm for computing gr\u00f6bner bases (f4). Journal of pure and applied algebra 139, 1--3 ( 1999 ), 61--88. Faug\u00e8re, J.-C. A new efficient algorithm for computing gr\u00f6bner bases (f4). Journal of pure and applied algebra 139, 1--3 (1999), 61--88."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780516"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15582-6_17"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(96)00099-0"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Giusti M. Heintz J. Morais J.-E. and \n      Pardo L\n  .\n  -M. When polynomial equation systems can be solved fast? In AAECC-11\n   (\n  1995\n  ) vol. \n  948\n   of \n  LNCS Springer pp. \n  205\n  --\n  231\n  .  Giusti M. Heintz J. Morais J.-E. and Pardo L.-M. When polynomial equation systems can be solved fast? In AAECC-11 (1995) vol. 948 of LNCS Springer pp. 205--231.","DOI":"10.1007\/3-540-60114-7_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2000.0571"},{"key":"e_1_3_2_1_21_1","first-page":"4","article-title":"-J. Construction of roadmaps in semi-algebraic sets. Applicable Algebra in Engineering","volume":"4","author":"Gournay L.","year":"1993","unstructured":"Gournay , L. , and Risler , J . -J. Construction of roadmaps in semi-algebraic sets. Applicable Algebra in Engineering , Communication and Computing 4 , 4 ( 1993 ), 239--252. Gournay, L., and Risler, J.-J. Construction of roadmaps in semi-algebraic sets. Applicable Algebra in Engineering, Communication and Computing 4, 4 (1993), 239--252.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_22_1","first-page":"327","volume-title":"Proc. of Transgressive Computing","author":"Mezzarobba M.","year":"2006","unstructured":"Mezzarobba , M. , and Safey El Din , M. Computing roadmaps in smooth real algebraic sets . In Proc. of Transgressive Computing ( 2006 ), J.-G. Dumas, Ed. , pp. 327 -- 338 . Mezzarobba, M., and Safey El Din, M. Computing roadmaps in smooth real algebraic sets. In Proc. of Transgressive Computing (2006), J.-G. Dumas, Ed., pp. 327--338."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/561828"},{"key":"e_1_3_2_1_24_1","volume-title":"MEGA (Effective Methods in Algebraic Geometry) Electronic proceedings","author":"Safey El Din M.","year":"2005","unstructured":"Safey El Din , M. Finding sampling points on real hypersurfaces is easier in singular situations . MEGA (Effective Methods in Algebraic Geometry) Electronic proceedings ( 2005 ). Safey El Din, M. Finding sampling points on real hypersurfaces is easier in singular situations. MEGA (Effective Methods in Algebraic Geometry) Electronic proceedings (2005)."},{"key":"e_1_3_2_1_25_1","volume-title":"Real algebraic geometry library.","author":"Safey El Din M.","year":"2007","unstructured":"Safey El Din , M. Real algebraic geometry library. available at http:\/\/www-polsys.lip6.fr\/~safey, 2007 . Safey El Din, M. Real algebraic geometry library. available at http:\/\/www-polsys.lip6.fr\/~safey, 2007."},{"key":"e_1_3_2_1_26_1","first-page":"224","volume-title":"Proc. of the 2003 Int. Symp. on Symb. and Alg. Comp. (NY, USA, 2003), ISSAC'03, ACM","author":"Safey El Din M.","unstructured":"Safey El Din , M. , and Schost , E . Polar varieties and computation of one point in each connected component of a smooth real algebraic set . In Proc. of the 2003 Int. Symp. on Symb. and Alg. Comp. (NY, USA, 2003), ISSAC'03, ACM , pp. 224 -- 231 . Safey El Din, M., and Schost, E. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In Proc. of the 2003 Int. Symp. on Symb. and Alg. Comp. (NY, USA, 2003), ISSAC'03, ACM, pp. 224--231."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-009-9239-2"},{"key":"e_1_3_2_1_28_1","volume-title":"A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. Journal of the ACM (JACM) 63, 6","author":"Safey El Din M.","year":"2017","unstructured":"Safey El Din , M. , and Schost , \u00c9. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. Journal of the ACM (JACM) 63, 6 ( 2017 ), 48. Safey El Din, M., and Schost, \u00c9. A nearly optimal algorithm for deciding connectivity queries in smooth and bounded real algebraic sets. Journal of the ACM (JACM) 63, 6 (2017), 48."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50013-8"},{"key":"e_1_3_2_1_30_1","volume-title":"Geometric Fundamentals of Robotics. Monographs in Computer Science","author":"Selig J.","year":"2005","unstructured":"Selig , J. Geometric Fundamentals of Robotics. Monographs in Computer Science . Springer , 2005 . Selig, J. Geometric Fundamentals of Robotics. Monographs in Computer Science. Springer, 2005."},{"key":"e_1_3_2_1_31_1","volume-title":"Robot Dynamics and Control","author":"Spong M.","year":"2005","unstructured":"Spong , M. , Hutchinson , S. , and Vidyasagar , M . Robot Dynamics and Control , 2 nd ed. Monographs in Computer Science. John Wiley & Sons , 2005 . Spong, M., Hutchinson, S., and Vidyasagar, M. Robot Dynamics and Control, 2nd ed. Monographs in Computer Science. John Wiley & Sons, 2005.","edition":"2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6202-6"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05219-5_3"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.3390\/robotics8010014"}],"event":{"name":"ISSAC '20: International Symposium on Symbolic and Algebraic Computation","location":"Kalamata Greece","acronym":"ISSAC '20","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373207.3404048","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373207.3404048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:46Z","timestamp":1750203886000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373207.3404048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,20]]},"references-count":34,"alternative-id":["10.1145\/3373207.3404048","10.1145\/3373207"],"URL":"https:\/\/doi.org\/10.1145\/3373207.3404048","relation":{},"subject":[],"published":{"date-parts":[[2020,7,20]]},"assertion":[{"value":"2020-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}