2012
134Near optimal tree size bounds on a simple real root isolation algorithm. Vikram Sharma, Chee-Keng Yap. ISSAC 2012, 319-326. Web SearchBibTeXDownload
133Towards Exact Numerical Voronoi Diagrams. Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien. ISVD 2012, 2-16. Web SearchBibTeXDownload
132Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap. J. Symb. Comput. (47): 131-152 (2012). Web SearchBibTeXDownload
131Certified computation of planar morse-smale complexes. Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap. Symposium on Computational Geometry 2012, 259-268. Web SearchBibTeXDownload
2011
130A simple but exact and efficient algorithm for complex root isolation. Chee-Keng Yap, Michael Sagraloff. ISSAC 2011, 353-360. Web SearchBibTeXDownload
2009
129In Praise of Numerical Computation. Chee-Keng Yap. Efficient Algorithms 2009, 380-407. Web SearchBibTeXDownload
128Lower bounds for zero-dimensional projections. W. Dale Brownawell, Chee-Keng Yap. ISSAC 2009, 79-86. Web SearchBibTeXDownload
127Exact numerical computation in algebra and geometry. Chee-Keng Yap. ISSAC 2009, 387-388. Web SearchBibTeXDownload
126Complete numerical isolation of real roots in zero-dimensional triangular systems. Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap. J. Symb. Comput. (44): 768-785 (2009). Web SearchBibTeXDownload
125Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. Long Lin, Chee-Keng Yap. Symposium on Computational Geometry 2009, 351-360. Web SearchBibTeXDownload
124Foundations of Exact Rounding. Chee-Keng Yap, Jihun Yu. WALCOM 2009, 15-31. Web SearchBibTeXDownload
2008
123Classroom examples of robustness problems in geometric computations. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap. Comput. Geom. (40): 61-78 (2008). Web SearchBibTeXDownload
122Robust Geometric Computation. Chee-Keng Yap, Vikram Sharma. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
121Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap. ISSAC 2008, 87-94. Web SearchBibTeXDownload
120Theory of Real Computation According to EGC. Chee-Keng Yap. Reliable Implementation of Real Number Algorithms 2008, 193-237. Web SearchBibTeXDownload
2007
119Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap. Int. J. Comput. Geometry Appl. (17): 555-593 (2007). Web SearchBibTeXDownload
118Complete numerical isolation of real zeros in zero-dimensional triangular systems. Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap. ISSAC 2007, 92-99. Web SearchBibTeXDownload
2006
117Special Issue on Robust Geometric Algorithms and their Implementations. Chee-Keng Yap, Sylvain Pion. Comput. Geom. (33): 1-2 (2006). Web SearchBibTeXDownload
116Reply to "Backward Error Analysis ...". Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap. ICCSA (1) 2006, 60-60. Web SearchBibTeXDownload
115Dynamic Map Labeling. Ken Been, Eli Daiches, Chee-Keng Yap. IEEE Trans. Vis. Comput. Graph. (12): 773-780 (2006). Web SearchBibTeXDownload
114Shortest Path amidst Disc Obstacles Is Computable. Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap. Int. J. Comput. Geometry Appl. (16): 567-590 (2006). Web SearchBibTeXDownload
113Almost tight recursion tree bounds for the Descartes method. Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap. ISSAC 2006, 71-78. Web SearchBibTeXDownload
112Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. Symposium on Computational Geometry 2006, 483-484. Web SearchBibTeXDownload
111Complete subdivision algorithms, I: intersection of Bezier curves. Chee-Keng Yap. Symposium on Computational Geometry 2006, 217-226. Web SearchBibTeXDownload
110Constructive root bound for k-ary rational input numbers. Sylvain Pion, Chee-Keng Yap. Theor. Comput. Sci. (369): 361-376 (2006). Web SearchBibTeXDownload
109An Experimental Study of Weighted k-Link Shortest Path Algorithms. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. WAFR 2006, 187-202. Web SearchBibTeXDownload
2005
108Robust Approximate Zeros. Vikram Sharma, Zilin Du, Chee-Keng Yap. ESA 2005, 874-886. Web SearchBibTeXDownload
107Recent progress in exact geometric computation. Chen Li, Sylvain Pion, Chee-Keng Yap. J. Log. Algebr. Program. (64): 85-111 (2005). Cited by 35Web SearchBibTeXDownload
106Shortest path amidst disc obstacles is computable. Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap. Symposium on Computational Geometry 2005, 116-125. Web SearchBibTeXDownload
105k-Link Shortest Paths in Weighted Subdivisions. Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap. WADS 2005, 325-337. Web SearchBibTeXDownload
2004
104Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Discrete & Computational Geometry (31): 139-171 (2004). Web SearchBibTeXDownload
103Classroom Examples of Robustness Problems in Geometric Computations. Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap. ESA 2004, 702-713. Web SearchBibTeXDownload
102Shortest Paths for Disc Obstacles. Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap. ICCSA (3) 2004, 62-70. Web SearchBibTeXDownload
2003
101Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. CCCG 2003, 10-13. Web SearchBibTeX
100Competitive On-Line Scheduling with Level of Service. Ee-Chien Chang, Chee-Keng Yap. J. Scheduling (6): 251-267 (2003). Web SearchBibTeXDownload
99Constructive root bound for k-ary rational input numbers. Sylvain Pion, Chee-Keng Yap. Symposium on Computational Geometry 2003, 256-263. Web SearchBibTeXDownload
2002
98Hypergeometric Functions in Exact Geometric Computation. Zilin Du, Maria Eleftheriou, José E. Moreira, Chee-Keng Yap. Electr. Notes Theor. Comput. Sci. (66): 53-64 (2002). Web SearchBibTeXDownload
97Pseudo approximation algorithms, with applications to optimal motion planning. Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Symposium on Computational Geometry 2002, 170-178. Web SearchBibTeXDownload
2001
96Competitive Online Scheduling with Level of Service. Ee-Chien Chang, Chee-Keng Yap. COCOON 2001, 453-462. Web SearchBibTeXDownload
95A new constructive root bound for algebraic expressions. Chen Li, Chee-Keng Yap. SODA 2001, 496-505. Cited by 42Web SearchBibTeXDownload
2000
94Smallest Enclosing Cylinders. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap. Algorithmica (27): 170-186 (2000). Web SearchBibTeXDownload
93A Simultaneous Search Problem. Ee-Chien Chang, Chee-Keng Yap. Algorithmica (26): 255-262 (2000). Web SearchBibTeXDownload
92Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. Daniela Tulone, Chee-Keng Yap, Chen Li. Automated Deduction in Geometry 2000, 58-82. Cited by 15Web SearchBibTeXDownload
91Precision-Sensitive Euclidean Shortest Path in 3-Space. Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap. SIAM J. Comput. (29): 1577-1595 (2000). Web SearchBibTeXDownload
1999
90Emerging Challenges in Computational Topology. Marshall W. Bern, David Eppstein, Pankaj K. Agarwal, Nina Amenta, L. Paul Chew, Tamal K. Dey, David P. Dobkin, Herbert Edelsbrunner, Cindy Grimm, Leonidas J. Guibas, John Harer, Joel Hass, Andrew Hicks, Carroll K. Johnson, Gilad Lerman, David Letscher, Paul E. Plassmann, Eric Sedgwick, Jack Snoeyink, Jeff Weeks, Chee-Keng Yap, Denis Zorin. CoRR (cs.CG/9909001) (1999). Web SearchBibTeXDownload
89A Core Library for Robust Numeric and Geometric Computation. Vijay Karamcheti, C. Li, Igor Pechtchanski, Chee-Keng Yap. Symposium on Computational Geometry 1999, 351-359. Web SearchBibTeXDownload
1998
88Combinatorial complexity of translating a box in polyhedral 3-space. Dan Halperin, Chee-Keng Yap. Comput. Geom. (9): 181-196 (1998). Web SearchBibTeXDownload
1997
87Towards Exact Geometric Computation. Chee-Keng Yap. Comput. Geom. (7): 3-23 (1997). Web SearchBibTeXDownload
86Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap. Discrete & Computational Geometry (18): 433-454 (1997). Web SearchBibTeXDownload
85Approximate Euclidean Shortest Paths in 3-Space. Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap. Int. J. Comput. Geometry Appl. (7): 271-295 (1997). Web SearchBibTeXDownload
84A Complete Roundness Classification Procedure. Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap. Symposium on Computational Geometry 1997, 129-138. Web SearchBibTeXDownload
83A Wavelet Approach to Foveating Images. Ee-Chien Chang, Chee-Keng Yap. Symposium on Computational Geometry 1997, 397-399. Web SearchBibTeXDownload
1996
82Efficient Algorithms for the Smallest Enclosing Cylinder Problem. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap. CCCG 1996, 264-269. Web SearchBibTeX
81The Habicht Approch to Subresultants. Chung-Jen Ho, Chee-Keng Yap. J. Symb. Comput. (21): 1-14 (1996). Web SearchBibTeXDownload
80Smallest Enclosing Cylinders. Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap. Symposium on Computational Geometry 1996, C-13-C-14. Web SearchBibTeXDownload
79Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). Joonsoo Choi, Chee-Keng Yap. Symposium on Computational Geometry 1996, 339-348. Web SearchBibTeXDownload
78d1-Optimal Motion for a Rod (Extended Abstract). Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap. Symposium on Computational Geometry 1996, 252-263. Web SearchBibTeXDownload
1995
77Combinatorial Complexity of Signed Discs. Diane L. Souvaine, Chee-Keng Yap. Comput. Geom. (5): 207-223 (1995). Web SearchBibTeXDownload
76A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. Ee-Chien Chang, Chee-Keng Yap. Inf. Process. Lett. (55): 155-157 (1995). Web SearchBibTeXDownload
75Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap. SODA 1995, 282-291. Web SearchBibTeXDownload
74Rectilinear Geodesics in 3-Space (Extended Abstract). Joonsoo Choi, Chee-Keng Yap. Symposium on Computational Geometry 1995, 380-389. Web SearchBibTeXDownload
73Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap. Symposium on Computational Geometry 1995, 350-359. Web SearchBibTeXDownload
1994
72Approximate Euclidean Shortest Path in 3-Space. Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap. Symposium on Computational Geometry 1994, 41-48. Web SearchBibTeXDownload
1993
71Shortest Paths for Line Segments. Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap. Algorithmica (10): 182-200 (1993). Web SearchBibTeXDownload
70Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap. Algorithmica (9): 128-141 (1993). Web SearchBibTeXDownload
69The Geometry in Constraint Logic Programs. Thomas Dubé, Chee-Keng Yap. PPCP 1993, 44-50. Web SearchBibTeX
68Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. Dan Halperin, Chee-Keng Yap. Symposium on Computational Geometry 1993, 29-37. Web SearchBibTeXDownload
67Combinatorial Complexity of Signed Discs (Extended Abstract). Diane L. Souvaine, Chee-Keng Yap. WADS 1993, 577-588. Web SearchBibTeXDownload
1992
66Refinement Methods for Geometric Bounds in Constructive Solid Geometry. Stephen Cameron, Chee-Keng Yap. ACM Trans. Graph. (11): 12-39 (1992). Web SearchBibTeXDownload
65Simultaneous Inner and Outer Approximation of Shapes. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap. Algorithmica (8): 365-389 (1992). Web SearchBibTeXDownload
64Quantitative Steinitz's Theorems Applications to Multifingered Grasping. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap. Discrete & Computational Geometry (7): 295-318 (1992). Web SearchBibTeXDownload
63Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract). Chee-Keng Yap. FOCS 1992, 437-446. Web SearchBibTeXDownload
1991
62On-line Motion Planning: Case of a Planar Rod. James Cox, Chee-Keng Yap. Ann. Math. Artif. Intell. (3): 1-20 (1991). Web SearchBibTeXDownload
61A New Lower Bound Construction for the Word Problem for Commutative Thue Systems. Chee-Keng Yap. J. Symb. Comput. (12): 1-28 (1991). Web SearchBibTeX
60Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. Kurt Mehlhorn, Chee-Keng Yap. SIAM J. Comput. (20): 603-621 (1991). Web SearchBibTeXDownload
59New Upper Bounds in Klee's Measure Problem. Mark H. Overmars, Chee-Keng Yap. SIAM J. Comput. (20): 1034-1045 (1991). Web SearchBibTeXDownload
58Reversal Complexity. Jianer Chen, Chee-Keng Yap. SIAM J. Comput. (20): 622-638 (1991). Web SearchBibTeXDownload
1990
57Geometric Consistency Theorem for a Symbolic Perturbation Scheme. Chee-Keng Yap. J. Comput. Syst. Sci. (40): 2-18 (1990). Web SearchBibTeXDownload
56Symbolic Treatment of Geometric Degeneration. Chee-Keng Yap. J. Symb. Comput. (10): 349-370 (1990). Web SearchBibTeXDownload
55Quantitative Steinitz's Theorems with Applications to Multifingered Grasping. David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap. STOC 1990, 341-351. Web SearchBibTeXDownload
54Computational Complexity of Combinatorial Surfaces. Gert Vegter, Chee-Keng Yap. Symposium on Computational Geometry 1990, 102-111. Web SearchBibTeXDownload
53On Simultaneous Inner and Outer Approximation of Shapes. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap. Symposium on Computational Geometry 1990, 216-224. Web SearchBibTeXDownload
1989
52Editor's Foreword: Special Issue on Computational Geometry. Chee-Keng Yap. Algorithmica (4): 1-2 (1989). Web SearchBibTeXDownload
51Finding Minimal Convex Nested Polygons. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap. Inf. Comput. (83): 98-110 (1989). Web SearchBibTeXDownload
50Notes on Gröbner bases. Bud Mishra, Chee-Keng Yap. Inf. Sci. (48): 219-252 (1989). Web SearchBibTeXDownload
49Motion Planning in the CL-Environment (Extended Abstract). Chee-Keng Yap, Helmut Alt. WADS 1989, 373-380. Web SearchBibTeX
48Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap. WADS 1989, 12-23. Web SearchBibTeX
1988
47Parallel Computational Geometry. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap. Algorithmica (3): 293-327 (1988). Web SearchBibTeXDownload
46Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. Chee-Keng Yap. Algorithmica (3): 279-288 (1988). Web SearchBibTeXDownload
45Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Discrete & Computational Geometry (3): 281-293 (1988). Web SearchBibTeXDownload
44The Orthogonal Convex Skull Problem. Derick Wood, Chee-Keng Yap. Discrete & Computational Geometry (3): 349-365 (1988). Web SearchBibTeXDownload
43New upper bounds in Klee's measure problem (extended abstract). Mark H. Overmars, Chee-Keng Yap. FOCS 1988, 550-556. Web SearchBibTeXDownload
42Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. Kurt Mehlhorn, Chee-Keng Yap. ICALP 1988, 410-423. Web SearchBibTeXDownload
41Applications of a Symbolic Perturbation Scheme (Abstract). Chee-Keng Yap. SWAT 1988, 138. Web SearchBibTeXDownload
40A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. Chee-Keng Yap. Symposium on Computational Geometry 1988, 134-142. Web SearchBibTeXDownload
39The Design of LINETOOL, a Geometric Editor. L. W. Ericson, Chee-Keng Yap. Symposium on Computational Geometry 1988, 83-92. Web SearchBibTeXDownload
1987
38Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap. Algorithmica (2): 27-59 (1987). Web SearchBibTeXDownload
37Preface Special Issue on Robotics. Chee-Keng Yap. Algorithmica (2): 363-365 (1987). Web SearchBibTeXDownload
36An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. Chee-Keng Yap. Discrete & Computational Geometry (2): 365-393 (1987). Web SearchBibTeXDownload
35Shape from Probing. Richard Cole, Chee-Keng Yap. J. Algorithms (8): 19-38 (1987). Web SearchBibTeXDownload
34What Can be Parallelized in Computational Geometry?. Chee-Keng Yap. Parallel Algorithms and Architectures 1987, 184-195. Web SearchBibTeXDownload
33On k-Hulls and Related Problems. Richard Cole, Micha Sharir, Chee-Keng Yap. SIAM J. Comput. (16): 61-77 (1987). Web SearchBibTeXDownload
32Reversal complexity. Jianer Chen, Chee-Keng Yap. Structure in Complexity Theory Conference 1987. Web SearchBibTeX
31Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Symposium on Computational Geometry 1987, 1-10. Web SearchBibTeXDownload
1986
30A Polynomial Solution for the Potato-peeling Problem. Jyun-Sheng Chang, Chee-Keng Yap. Discrete & Computational Geometry (1): 155-182 (1986). Web SearchBibTeXDownload
29New Upper Bounds for Neighbor Searching. Bernard Chazelle, R. Cole, Franco P. Preparata, Chee-Keng Yap. Information and Control (68): 105-124 (1986). Web SearchBibTeXDownload
28Probing Convex Polytopes. David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap. STOC 1986, 424-432. Web SearchBibTeXDownload
27Moving a Polygon Around the Corner in a Corridor. S. Maddila, Chee-Keng Yap. Symposium on Computational Geometry 1986, 187-192. Web SearchBibTeXDownload
1985
26Parallel Computational Geometry (Extended Abstract). Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap. FOCS 1985, 468-477. Web SearchBibTeXDownload
25Algebraic Cell Decomposition in NC (Preliminary Version). Dexter Kozen, Chee-Keng Yap. FOCS 1985, 515-521. Web SearchBibTeXDownload
24A Parallel Median Algorithm. Richard Cole, Chee-Keng Yap. Inf. Process. Lett. (20): 137-139 (1985). Web SearchBibTeXDownload
23A "Retraction" Method for Planning the Motion of a Disc. Colm Ó'Dúnlaing, Chee-Keng Yap. J. Algorithms (6): 104-111 (1985). Web SearchBibTeXDownload
22Computing a convex skill of an orthogonal polygon. Derick Wood, Chee-Keng Yap. Symposium on Computational Geometry 1985, 311-315. Web SearchBibTeXDownload
21Finding minimal convex nested polygons. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap. Symposium on Computational Geometry 1985, 296-304. Web SearchBibTeXDownload
20Minimum area circumscribing Polygons. Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap. The Visual Computer (1): 112-117 (1985). Web SearchBibTeXDownload
1984
19Counting digraphs and hypergraphs. Colm Ó'Dúnlaing, Chee-Keng Yap. Bulletin of the EATCS (24): 85-87 (1984). Web SearchBibTeX
18A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems. Jyun-Sheng Chang, Chee-Keng Yap. FOCS 1984, 408-416. Web SearchBibTeXDownload
17Geometric Retrieval Problems. Richard Cole, Chee-Keng Yap. Information and Control (63): 39-57 (1984). Web SearchBibTeXDownload
16Strong NP-Hardness of Moving Many Discs. Paul G. Spirakis, Chee-Keng Yap. Inf. Process. Lett. (19): 55-59 (1984). Web SearchBibTeXDownload
15The Format Model: A Theory of database Organization. Richard Hull, Chee-Keng Yap. J. ACM (31): 518-544 (1984). Cited by 151Web SearchBibTeXDownload
14On k-hulls and Related Problems. Richard Cole, Micha Sharir, Chee-Keng Yap. STOC 1984, 154-166. Web SearchBibTeXDownload
1983
13Geometric Retrieval Problems. Richard Cole, Chee-Keng Yap. FOCS 1983, 112-121. Web SearchBibTeXDownload
12A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. Chee-Keng Yap. Inf. Process. Lett. (16): 181-182 (1983). Web SearchBibTeXDownload
11Retraction: A New Approach to Motion-Planning (Extended Abstract). Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap. STOC 1983, 207-220. Web SearchBibTeXDownload
10Some Consequences of Non-Uniform Conditions on Uniform Classes. Chee-Keng Yap. Theor. Comput. Sci. (26): 287-300 (1983). Web SearchBibTeXDownload
1982
9Generic Transformation of Data Structures. Colm Ó'Dúnlaing, Chee-Keng Yap. FOCS 1982, 186-195. Web SearchBibTeXDownload
8The Format Model: A Theory of Database Organization. Richard Hull, Chee-Keng Yap. PODS 1982, 205-211. Web SearchBibTeXDownload
1980
7On Formulating Simultaneity for Studying Parallelism and Synchronization. Raymond E. Miller, Chee-Keng Yap. J. Comput. Syst. Sci. (20): 203-218 (1980). Web SearchBibTeXDownload
6Space-time Tradeoffs and First Order Problems in a Model of Programs. Chee-Keng Yap. STOC 1980, 318-325. Web SearchBibTeXDownload
1978
5On Lifted Problems (Preliminary Reports). Chee-Keng Yap. FOCS 1978, 267-279. Web SearchBibTeXDownload
4On the formal specification and analysis for loosely connected processes. Raymond E. Miller, Chee-Keng Yap. Mathematical Studies of Information Processing 1978, 33-66. Web SearchBibTeXDownload
3On Formulating Simultaneity for Studying Parallelism and Synchronization. Raymond E. Miller, Chee-Keng Yap. STOC 1978, 105-113. Web SearchBibTeXDownload
1977
2On the Computational Power of Reversal-Bounded Machines. Ronald V. Book, Chee-Keng Yap. ICALP 1977, 111-119. Web SearchBibTeXDownload
1976
1New Upper Bounds for Selection. Chee-Keng Yap. Commun. ACM (19): 501-508 (1976). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research