Your search returned the following 13 documents:

13. Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests
    Chee Yap, Michael Sagraloff, and Vikram Sharma
    . Note: submitted to Computability in Europe 2013, an extended version is available at http://www.mpi-inf.mpg.de/~msagralo/SoftPredicate.pdf
    
12. A Simple But Exact and Efficient Algorithm for Complex Root Isolation
    Michael Sagraloff and Chee Yap
    In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, San Jose, CA, 2011, 353-360. Note: To appear, see \url{http://www.mpi-inf.mpg.de/~msagralo/ceval.pdf} for a preliminary version.
    
11. Classroom Examples of Robustness Problems in Geometric Computations
    Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
    Computational Geometry: Theory and Applications 40 (1): 61-78, 2008
    
    
10. Almost Tight Recursion Tree Bounds for the Descartes Method
    Arno Eigenwillig, Vikram Sharma, and Chee K. Yap
    In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, Genova, Italy, 2006, 71-78
    [PDF: Download: ESY-DescTree-ISSAC06-authprep.pdf]
    
9. Reply to "Backward Error Analysis ..."
   Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
   In: Computational Science and Its Applications - ICCSA 2006, I, Glasgow, UK, 2006, 60-60
   
8. Classroom Examples of Robustness Problems in Geometric Computations
   Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
   Effective Computational Geometry for Curves and Surfaces, Sophia Antipolis, ECG-TR-363100-01, Technical Report
   
7. Classroom Examples of Robustness Problems in Geometric Computations
   Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, and Chee Yap
   In: ESA 2004: 12th Annual European Symposium on Algorithms, Bergen, Norway, 2004, 702-713
   
   
6. A complete roundness classification procedure
   Kurt Mehlhorn, Thomas C. Shermer, and Chee Yap
   In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), Nice, France, June, 4 - 6, 1997, 129-138
   
   
5. Simultaneous Inner and Outer Approximation of Shapes
   Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee-Keng Yap
   Algorithmica 8 (5/6): 365-389, 1992
   
4. Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
   Kurt Mehlhorn and Chee-Keng Yap
   SIAM Journal on Computing 20 (4): 603-621, 1991
   
3. On Simultaneous Inner and Outer Approximation of Shapes
   Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, and Chee-Keng Yap
   In: Computational geometry (SCG-90) : 6th annual symposium, Berkeley, USA, 1990, 216-224
   
2. Constructive Hopf's theorem: or how to untangle closed planar curves
   Kurt Mehlhorn and Chee-Keng Yap
   Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, A 88/01
   
1. Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
   Kurt Mehlhorn and Chee-Keng Yap
   In: Automata, languages and programming (ICALP-88) : 15th international colloquium, Tampere, Finland, 1988, 410-423