Sagraloff, Michael; Mehlhorn, Kurt Computing real roots of real polynomials. (English) Zbl 1330.65072 J. Symb. Comput. 73, 46-86 (2016). MSC: 65H05 12D10 PDFBibTeX XMLCite \textit{M. Sagraloff} and \textit{K. Mehlhorn}, J. Symb. Comput. 73, 46--86 (2016; Zbl 1330.65072) Full Text: DOI arXiv
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming From approximate factorization to root isolation with application to cylindrical algebraic decomposition. (English) Zbl 1357.68305 J. Symb. Comput. 66, 34-69 (2015). MSC: 68W30 14Q05 30C15 65H04 68W40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., J. Symb. Comput. 66, 34--69 (2015; Zbl 1357.68305) Full Text: DOI arXiv
Mehlhorn, Kurt; Sagraloff, Michael; Wang, Pengming From approximate factorization to root isolation. (English) Zbl 1360.68944 Kauers, Manuel (ed.), Proceedings of the 38th international symposium on symbolic and algebraic computation, ISSAC 2013, Boston, MA, USA, June 26–29, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2059-7). 283-290 (2013). MSC: 68W30 14Q05 30C15 65H04 68W40 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., in: Proceedings of the 38th international symposium on symbolic and algebraic computation, ISSAC 2013, Boston, MA, USA, June 26--29, 2013. New York, NY: Association for Computing Machinery (ACM). 283--290 (2013; Zbl 1360.68944) Full Text: DOI
Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael A general approach to the analysis of controlled perturbation algorithms. (English) Zbl 1247.65024 Comput. Geom. 44, No. 9, 507-528 (2011). Reviewer: Juan Monterde (Burjasot) MSC: 65D18 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Comput. Geom. 44, No. 9, 507--528 (2011; Zbl 1247.65024) Full Text: DOI
Mehlhorn, Kurt; Sagraloff, Michael A deterministic algorithm for isolating real roots of a real polynomial. (English) Zbl 1207.65048 J. Symb. Comput. 46, No. 1, 70-90 (2011). Reviewer: Temur Jangveladze (Tbilisi) MSC: 65H04 65Y20 26C10 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{M. Sagraloff}, J. Symb. Comput. 46, No. 1, 70--90 (2011; Zbl 1207.65048) Full Text: DOI
Mehlhorn, Kurt Reliable and efficient geometric computing. (English) Zbl 1294.68143 Fukuda, Komei (ed.) et al., Mathematical software – ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13–17, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15581-9/pbk). Lecture Notes in Computer Science 6327, 10-11 (2010). MSC: 68U05 65D17 65D18 68U07 PDFBibTeX XMLCite \textit{K. Mehlhorn}, Lect. Notes Comput. Sci. 6327, 10--11 (2010; Zbl 1294.68143) Full Text: DOI
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee Classroom examples of robustness problems in geometric computations. (English) Zbl 1135.65311 Comput. Geom. 40, No. 1, 61-78 (2008). MSC: 65D18 PDFBibTeX XMLCite \textit{L. Kettner} et al., Comput. Geom. 40, No. 1, 61--78 (2008; Zbl 1135.65311) Full Text: DOI
Gotsman, Craig; Kaligosi, Kanela; Mehlhorn, Kurt; Michail, Dimitrios; Pyrga, Evangelia Cycle bases of graphs and sampled manifolds. (English) Zbl 1171.65334 Comput. Aided Geom. Des. 24, No. 8-9, 464-480 (2007). MSC: 65D17 68U07 PDFBibTeX XMLCite \textit{C. Gotsman} et al., Comput. Aided Geom. Des. 24, No. 8--9, 464--480 (2007; Zbl 1171.65334) Full Text: DOI Link
Hachenberger, Peter; Kettner, Lutz; Mehlhorn, Kurt Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments. (English) Zbl 1118.65308 Comput. Geom. 38, No. 1-2, 64-99 (2007). MSC: 65D18 PDFBibTeX XMLCite \textit{P. Hachenberger} et al., Comput. Geom. 38, No. 1--2, 64--99 (2007; Zbl 1118.65308) Full Text: DOI
Mehlhorn, Kurt; Osbild, Ralf; Sagraloff, Michael Reliable and efficient computational geometry via controlled perturbation. (English) Zbl 1183.68671 Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-35904-3/pbk). Lecture Notes in Computer Science 4051, 299-310 (2006). MSC: 68U05 65D18 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Lect. Notes Comput. Sci. 4051, 299--310 (2006; Zbl 1183.68671) Full Text: DOI
Kettner, Lutz; Mehlhorn, Kurt; Pion, Sylvain; Schirra, Stefan; Yap, Chee Reply to “Backward error analysis \(\dots \)”. (English) Zbl 1162.68752 Gavrilova, Marina (ed.) et al., Computational science and its applications – ICCSA 2006. International conference, Glasgow, UK, May 8–11, 2006. Proceedings, Part I. Berlin: Springer (ISBN 3-540-34070-X/pbk). Lecture Notes in Computer Science 3980, 60 (2006). MSC: 68U05 65D18 PDFBibTeX XMLCite \textit{L. Kettner} et al., Lect. Notes Comput. Sci. 3980, 60 (2006; Zbl 1162.68752) Full Text: DOI
Aronov, Boris; Asano, Tetsuo; Katoh, Naoki; Mehlhorn, Kurt; Tokuyama, Takeshi Polyline fitting of planar points under min-sum criteria. (English) Zbl 1098.65011 Int. J. Comput. Geom. Appl. 16, No. 2-3, 97-116 (2006). Reviewer: Sonia Pérez Díaz (Madrid) MSC: 65D17 65D10 62J02 65C60 PDFBibTeX XMLCite \textit{B. Aronov} et al., Int. J. Comput. Geom. Appl. 16, No. 2--3, 97--116 (2006; Zbl 1098.65011) Full Text: DOI
Eigenwillig, Arno; Kettner, Lutz; Krandick, Werner; Mehlhorn, Kurt; Schmitt, Susanne; Wolpert, Nicola A Descartes algorithm for polynomials with bit-stream coefficients. (English) Zbl 1169.65315 Ganzha, Victor G. (ed.) et al., Computer algebra in scientific computing. 8th international workshop, CASC 2005, Kalamata, Greece, September 12–16, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28966-6/pbk). Lecture Notes in Computer Science 3718, 138-149 (2005). MSC: 65H05 68W30 PDFBibTeX XMLCite \textit{A. Eigenwillig} et al., Lect. Notes Comput. Sci. 3718, 138--149 (2005; Zbl 1169.65315) Full Text: DOI
Berberich, Eric; Eigenwillig, Arno; Hemmer, Michael; Hert, Susan; Kettner, Lutz; Mehlhorn, Kurt; Reichel, Joachim; Schmitt, Susanne; Schömer, Elmar; Wolpert, Nicola EXACUS: Efficient and exact algorithms for curves and surfaces. (English) Zbl 1162.68733 Brodal, Gerth Stølting (ed.) et al., Algorithms – ESA 2005. 13th annual European symposium, Palma de Mallorca, Spain, October 3–6, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29118-0/pbk). Lecture Notes in Computer Science 3669, 155-166 (2005). MSC: 68U05 52B55 65D18 PDFBibTeX XMLCite \textit{E. Berberich} et al., Lect. Notes Comput. Sci. 3669, 155--166 (2005; Zbl 1162.68733) Full Text: DOI
Funke, Stefan; Mehlhorn, Kurt; Näher, Stefan Structural filtering: a paradigm for efficient and exact geometric programs. (English) Zbl 1078.65015 Comput. Geom. 31, No. 3, 179-194 (2005). Reviewer: Ivana Linkeová (Praha) MSC: 65D18 68Q25 68P10 PDFBibTeX XMLCite \textit{S. Funke} et al., Comput. Geom. 31, No. 3, 179--194 (2005; Zbl 1078.65015) Full Text: DOI
Aronov, Boris; Asano, Tetsuo; Katoh, Naoki; Mehlhorn, Kurt; Tokuyama, Takeshi Polyline fitting of planar points under min-sum criteria. (English) Zbl 1116.65310 Fleischer, Rudolf (ed.) et al., Algorithms and computation. 15th international symposium, ISAAC 2004, Hong Kong, China, December 20–22, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24131-0/pbk). Lecture Notes in Computer Science 3341, 77-88 (2004). MSC: 65D10 62J02 68U05 PDFBibTeX XMLCite \textit{B. Aronov} et al., Lect. Notes Comput. Sci. 3341, 77--88 (2004; Zbl 1116.65310) Full Text: DOI
Mehlhorn, Kurt; Meiser, Stefan; Rasch, Ronald Furthest site abstract Voronoi diagrams. (English) Zbl 1074.68643 Int. J. Comput. Geom. Appl. 11, No. 6, 583-616 (2001). MSC: 68U05 05C85 65D18 PDFBibTeX XMLCite \textit{K. Mehlhorn} et al., Int. J. Comput. Geom. Appl. 11, No. 6, 583--616 (2001; Zbl 1074.68643) Full Text: DOI
Kececioglu, John D.; Lenhof, Hans-Peter; Mehlhorn, Kurt; Mutzel, Petra; Reinert, Knut; Vingron, Martin A polyhedral approach to sequence alignment problems. (English) Zbl 0998.92017 Discrete Appl. Math. 104, No. 1-3, 143-186 (2000). MSC: 92C40 05C90 92D20 90C27 65Y20 PDFBibTeX XMLCite \textit{J. D. Kececioglu} et al., Discrete Appl. Math. 104, No. 1--3, 143--186 (2000; Zbl 0998.92017) Full Text: DOI
Althaus, Ernst; Mehlhorn, Kurt TSP-based curve reconstruction in polynomial time. (English) Zbl 0954.65011 Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 686-695 (2000). MSC: 65D17 65K05 90C35 90C27 PDFBibTeX XMLCite \textit{E. Althaus} and \textit{K. Mehlhorn}, in: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms, SODA 2000, San Francisco, CA, USA, January 9--11, 2000. Philadelphia, PA: SIAM. 686--695 (2000; Zbl 0954.65011)
Cheriyan, Joseph; Hagerup, Torben; Mehlhorn, Kurt Can a maximum flow be computed in \(o(nm)\) time? (English) Zbl 0768.90020 Automata, languages and programming, Proc. 17th Int. Colloq., Warwick/GB 1990, Lect. Notes Comput. Sci. 443, 235-248 (1990). MSC: 90B10 68Q25 90C60 65Y05 PDFBibTeX XMLCite \textit{J. Cheriyan} et al., Lect. Notes Comput. Sci. 443, 235--248 (1990; Zbl 0768.90020)
Fürer, Martin; Mehlhorn, Kurt \(AT^2\)-optimal Galois field multiplier for VLSI. (English) Zbl 1395.68355 IEEE Trans. Comput. 38, No. 9, 1333-1336 (1989). MSC: 68W35 11Y16 65T50 65Y10 PDFBibTeX XMLCite \textit{M. Fürer} and \textit{K. Mehlhorn}, IEEE Trans. Comput. 38, No. 9, 1333--1336 (1989; Zbl 1395.68355) Full Text: DOI
Mehlhorn, K.; Galil, Z. Monotone switching circuits and Boolean matrix product. (English) Zbl 0323.94019 Computing 16, 99-111 (1976). MSC: 94C10 65F30 15A12 PDFBibTeX XMLCite \textit{K. Mehlhorn} and \textit{Z. Galil}, Computing 16, 99--111 (1976; Zbl 0323.94019) Full Text: DOI