CheeKeng Yap
According to our database^{1},
CheeKeng Yap
authored at least 164 papers
between 1976 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at linkedin.com

at cs.nyu.edu

at andrej.com
On csauthors.net:
Bibliography
2020
J. Symb. Comput., 2020
CoRR, 2020
2019
ACM Commun. Comput. Algebra, 2019
Bioinform., 2019
Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: The Averaging Method Revisited.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019
Proceedings of the 35th International Symposium on Computational Geometry, 2019
Proceedings of the Computer Algebra in Scientific Computing  21st International Workshop, 2019
Proceedings of the Computer Algebra in Scientific Computing  21st International Workshop, 2019
2018
A nearoptimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.
J. Symb. Comput., 2018
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018
Proceedings of the Mathematical Software  ICMS 2018, 2018
Proceedings of the Mathematical Software  ICMS 2018, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Theor. Comput. Sci., 2017
J. Symb. Comput., 2017
Comput. Geom., 2017
2016
Encyclopedia of Algorithms, 2016
Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams.
Comput. Graph. Forum, 2016
Proceedings of the Algorithmic Foundations of Robotics XII, 2016
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
A Simple NearOptimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.
CoRR, 2015
Comput. Geom., 2015
Proceedings of the Frontiers in Algorithmics  9th International Workshop, 2015
2014
CoRR, 2014
Proceedings of the Algorithmic Foundations of Robotics XI, 2014
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision.
Proceedings of the Mathematical Software  ICMS 2014, 2014
2013
Comput. Aided Des., 2013
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013
2012
Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves.
J. Symb. Comput., 2012
Comput. Graph. Forum, 2012
Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012
2011
Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach.
Discret. Comput. Geom., 2011
Proceedings of the Theory and Applications of Models of Computation, 2011
Empirical study of an evaluationbased subdivision algorithm for complex root isolation.
Proceedings of the SNC 2011, 2011
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011
2010
Mathematics in Computer Science, 2010
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra.
Proceedings of the Mathematical Software, 2010
2009
Complete numerical isolation of real roots in zerodimensional triangular systems.
J. Symb. Comput., 2009
Electronic Colloquium on Computational Complexity (ECCC), 2009
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009
Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009
Proceedings of the Efficient Algorithms, 2009
2008
Proceedings of the Encyclopedia of Algorithms  2008 Edition, 2008
Comput. Geom., 2008
Proceedings of the Reliable Implementation of Real Number Algorithms: Theory and Practice, 2008
2007
Mathematics in Computer Science, 2007
Int. J. Comput. Geom. Appl., 2007
Complete numerical isolation of real zeros in zerodimensional triangular systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007
2006
IEEE Trans. Vis. Comput. Graph., 2006
Theor. Comput. Sci., 2006
Int. J. Comput. Geom. Appl., 2006
Comput. Geom., 2006
Proceedings of the Algorithmic Foundation of Robotics VII, 2006
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006
Proceedings of the Computational Science and Its Applications, 2006
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
Approximating minimumcost polygonal paths of bounded number of links in weighted subdivisions.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006
2005
J. Log. Algebraic Methods Program., 2005
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Proceedings of the Algorithms, 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
Discret. Comput. Geom., 2004
Proceedings of the Computational Science and Its Applications, 2004
2003
J. Sched., 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NPhard.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003
2002
Electron. Notes Theor. Comput. Sci., 2002
Proceedings of the Visualization and Data Analysis 2002, 2002
Responsive scalable thinwire visualization: application to large geographic datasets.
Proceedings of the Visualization and Data Analysis 2002, 2002
2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
Yet another look at fractional cascading: Bgraphs with application to point location.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
2000
SIAM J. Comput., 2000
Algorithmica, 2000
Algorithmica, 2000
Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving.
Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000
Fundamental problems of algorithmic algebra.
Oxford University Press, ISBN: 9780195125160, 2000
1999
CoRR, 1999
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999
1998
Comput. Geom., 1998
1997
Int. J. Comput. Geom. Appl., 1997
Primal Dividing and Dual Pruning: OutputSensitive Construction of FourDimensional Polytopes and ThreeDimensional Voronoi Diagrams.
Discret. Comput. Geom., 1997
Comput. Geom., 1997
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997
1996
J. Symb. Comput., 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1995
A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space.
Inf. Process. Lett., 1995
Comput. Geom., 1995
OutputSensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three.
Proceedings of the Sixth Annual ACMSIAM Symposium on Discrete Algorithms, 1995
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
1994
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994
1993
Algorithmica, 1993
Algorithmica, 1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
The Geometry in Constraint Logic Programs.
Proceedings of the Principles and Practice of Constraint Programming, 1993
Low Level Issues in Computational Geometry.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
ACM Trans. Graph., 1992
Discret. Comput. Geom., 1992
Algorithmica, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
SIAM J. Comput., 1991
SIAM J. Comput., 1991
SIAM J. Comput., 1991
J. Symb. Comput., 1991
Ann. Math. Artif. Intell., 1991
1990
J. Symb. Comput., 1990
J. Comput. Syst. Sci., 1990
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990
Proceedings of the Autonomous Robot Vehicles, 1990
1989
Inf. Comput., October, 1989
Inf. Sci., 1989
Algorithmica, 1989
Proceedings of the Algorithms and Data Structures, 1989
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).
Proceedings of the Algorithms and Data Structures, 1989
1988
Discret. Comput. Geom., 1988
Discret. Comput. Geom., 1988
Algorithmica, 1988
Algorithmica, 1988
Proceedings of the SWAT 88, 1988
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988
1987
IEEE J. Robotics Autom., 1987
SIAM J. Comput., 1987
J. Algorithms, 1987
An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments.
Discret. Comput. Geom., 1987
Algorithmica, 1987
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.
Algorithmica, 1987
Proceedings of the Parallel Algorithms and Architectures, 1987
1986
Inf. Control., 1986
Discret. Comput. Geom., 1986
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Proceedings of the 1986 IEEE International Conference on Robotics and Automation, 1986
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986
1985
Vis. Comput., 1985
J. Algorithms, 1985
Inf. Process. Lett., 1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
Proceedings of the First Annual Symposium on Computational Geometry, 1985
1984
J. ACM, 1984
Inf. Process. Lett., 1984
Inf. Control., 1984
Counting digraphs and hypergraphs.
Bull. EATCS, 1984
A Polynomial Solution for Potatopeeling and other Polygon Inclusion and Enclosure Problems
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
Theor. Comput. Sci., 1983
A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs.
Inf. Process. Lett., 1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
1982
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
1980
J. Comput. Syst. Sci., 1980
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980
1978
Proceedings of the Mathematical Studies of Information Processing, 1978
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978
1977
Proceedings of the Automata, 1977
1976
Commun. ACM, 1976