Chee-Keng Yap

Long Lin, Chee Yap, Jihun Yu: Non-local isotopic approximation of nonsingular surfaces. Computer-Aided Design 45(2): 451-462 (2013)

Jihun Yu, Chris Wojtan, Greg Turk, Chee Yap: Explicit Mesh Surfaces for Particle Based Fluids. Comput. Graph. Forum 31(2): 815-824 (2012)

Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap: Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves. J. Symb. Comput. 47(2): 131-152 (2012)

Gert Vegter, Amit Chattopadhyay, Chee-Keng Yap: Certified computation of planar morse-smale complexes. Symposium on Computational Geometry 2012: 259-268

Vikram Sharma, Chee-Keng Yap: Near optimal tree size bounds on a simple real root isolation algorithm. ISSAC 2012: 319-326

Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien: Towards Exact Numerical Voronoi Diagrams. ISVD 2012: 2-16

Long Lin, Chee Yap: Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach. Discrete & Computational Geometry 45(4): 760-795 (2011)

Chee-Keng Yap, Michael Sagraloff: A simple but exact and efficient algorithm for complex root isolation. ISSAC 2011: 353-360

Chee Yap: A Real Elementary Approach to the Master Recurrence and Generalizations. TAMC 2011: 14-26

Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee Yap: Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves. CoRR abs/1102.5463 (2011)

Gert Vegter, Chee-Keng Yap: Foreword. Mathematics in Computer Science 4(4): 385-387 (2010)

Jihun Yu, Chee Yap, Zilin Du, Sylvain Pion, Hervé Brönnimann: The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra. ICMS 2010: 121-141

Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap: Complete numerical isolation of real roots in zero-dimensional triangular systems. J. Symb. Comput. 44(7): 768-785 (2009)

Chee-Keng Yap: In Praise of Numerical Computation. Efficient Algorithms 2009: 380-407

Long Lin, Chee-Keng Yap: Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. Symposium on Computational Geometry 2009: 351-360

W. Dale Brownawell, Chee-Keng Yap: Lower bounds for zero-dimensional projections. ISSAC 2009: 79-86

Chee-Keng Yap: Exact numerical computation in algebra and geometry. ISSAC 2009: 387-388

Chee-Keng Yap, Jihun Yu: Foundations of Exact Rounding. WALCOM 2009: 15-31

Michael Burr, Felix Krahmer, Chee Yap: Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique. Electronic Colloquium on Computational Complexity (ECCC) 16: 136 (2009)

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom examples of robustness problems in geometric computations. Comput. Geom. 40(1): 61-78 (2008)

Chee-Keng Yap: Theory of Real Computation According to EGC. Reliable Implementation of Real Number Algorithms 2008: 193-237

Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap: Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC 2008: 87-94

Chee-Keng Yap, Vikram Sharma: Robust Geometric Computation. Encyclopedia of Algorithms 2008

Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap: Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. Int. J. Comput. Geometry Appl. 17(6): 555-593 (2007)

Chee-Keng Yap, Hoon Hong: Foreword. Mathematics in Computer Science 1(1): 3-7 (2007)

Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap: Complete numerical isolation of real zeros in zero-dimensional triangular systems. ISSAC 2007: 92-99

Chee-Keng Yap, Sylvain Pion: Special Issue on Robust Geometric Algorithms and their Implementations. Comput. Geom. 33(1-2): 1-2 (2006)

Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap: Shortest Path amidst Disc Obstacles Is Computable. Int. J. Comput. Geometry Appl. 16(5-6): 567-590 (2006)

Sylvain Pion, Chee-Keng Yap: Constructive root bound for k-ary rational input numbers. Theor. Comput. Sci. 369(1-3): 361-376 (2006)

Ken Been, Eli Daiches, Chee-Keng Yap: Dynamic Map Labeling. IEEE Trans. Vis. Comput. Graph. 12(5): 773-780 (2006)

Chee-Keng Yap: Complete subdivision algorithms, I: intersection of Bezier curves. Symposium on Computational Geometry 2006: 217-226

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. Symposium on Computational Geometry 2006: 483-484

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60

Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap: Almost tight recursion tree bounds for the Descartes method. ISSAC 2006: 71-78

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: An Experimental Study of Weighted k-Link Shortest Path Algorithms. WAFR 2006: 187-202

Chen Li, Sylvain Pion, Chee-Keng Yap: Recent progress in exact geometric computation. J. Log. Algebr. Program. 64(1): 85-111 (2005)

Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap: Shortest path amidst disc obstacles is computable. Symposium on Computational Geometry 2005: 116-125

Vikram Sharma, Zilin Du, Chee-Keng Yap: Robust Approximate Zeros. ESA 2005: 874-886

Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Ntafos, James D. Palmer, Chee-Keng Yap: k-Link Shortest Paths in Weighted Subdivisions. WADS 2005: 325-337

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo Approximation Algorithms with Applications to Optimal Motion Planning. Discrete & Computational Geometry 31(1): 139-171 (2004)

Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713

Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap: Shortest Paths for Disc Obstacles. ICCSA (3) 2004: 62-70

Ee-Chien Chang, Chee-Keng Yap: Competitive On-Line Scheduling with Level of Service. J. Scheduling 6(3): 251-267 (2003)

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Minimizing the trace length of a rod endpoint in the presence of polygonal obstacles is NP-hard. CCCG 2003: 10-13

Sylvain Pion, Chee-Keng Yap: Constructive root bound for k-ary rational input numbers. Symposium on Computational Geometry 2003: 256-263

Zilin Du, Maria Eleftheriou, José E. Moreira, Chee-Keng Yap: Hypergeometric Functions in Exact Geometric Computation. Electr. Notes Theor. Comput. Sci. 66(1): 53-64 (2002)

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo approximation algorithms, with applications to optimal motion planning. Symposium on Computational Geometry 2002: 170-178

Chee Yap, Yunyue Zhu: Yet another look at fractional cascading: B-graphs with application to point location. CCCG 2001: 173-176

Ee-Chien Chang, Chee-Keng Yap: Competitive Online Scheduling with Level of Service. COCOON 2001: 453-462

Chen Li, Chee-Keng Yap: A new constructive root bound for algebraic expressions. SODA 2001: 496-505

Chee-Keng Yap: Fundamental problems of algorithmic algebra. Oxford University Press 2000, isbn 978-0-19-512516-0, pp. I-XV, 1-511

Ee-Chien Chang, Chee-Keng Yap: A Simultaneous Search Problem. Algorithmica 26(2): 255-262 (2000)

Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap: Smallest Enclosing Cylinders. Algorithmica 27(2): 170-186 (2000)

Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap: Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. 29(5): 1577-1595 (2000)

Daniela Tulone, Chee-Keng Yap, Chen Li: Randomized Zero Testing of Radical Expressions and Elementary Geometry Theorem Proving. Automated Deduction in Geometry 2000: 58-82

Vijay Karamcheti, C. Li, Igor Pechtchanski, Chee-Keng Yap: A Core Library for Robust Numeric and Geometric Computation. Symposium on Computational Geometry 1999: 351-359

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: Emerging Challenges in Computational Topology. CoRR cs.CG/9909001 (1999)

Dan Halperin, Chee-Keng Yap: Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9(3): 181-196 (1998)

Chee-Keng Yap: Towards Exact Geometric Computation. Comput. Geom. 7: 3-23 (1997)

Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Primal Dividing and Dual Pruning: Output-Sensitive Construction of Four-Dimensional Polytopes and Three-Dimensional Voronoi Diagrams. Discrete & Computational Geometry 18(4): 433-454 (1997)

Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap: Approximate Euclidean Shortest Paths in 3-Space. Int. J. Comput. Geometry Appl. 7(4): 271-295 (1997)

Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap: A Complete Roundness Classification Procedure. Symposium on Computational Geometry 1997: 129-138

Ee-Chien Chang, Chee-Keng Yap: A Wavelet Approach to Foveating Images. Symposium on Computational Geometry 1997: 397-399

Chung-Jen Ho, Chee-Keng Yap: The Habicht Approch to Subresultants. J. Symb. Comput. 21(1): 1-14 (1996)

Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap: Efficient Algorithms for the Smallest Enclosing Cylinder Problem. CCCG 1996: 264-269

Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: d₁-Optimal Motion for a Rod (Extended Abstract). Symposium on Computational Geometry 1996: 252-263

Joonsoo Choi, Chee-Keng Yap: Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). Symposium on Computational Geometry 1996: 339-348

Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap: Smallest Enclosing Cylinders. Symposium on Computational Geometry 1996: C-13-C-14

Diane L. Souvaine, Chee-Keng Yap: Combinatorial Complexity of Signed Discs. Comput. Geom. 5: 207-223 (1995)

Ee-Chien Chang, Chee-Keng Yap: A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. Inf. Process. Lett. 55(3): 155-157 (1995)

Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap: Precision-Sensitive Euclidean Shortest Path in 3-Space (Extended Abstract). Symposium on Computational Geometry 1995: 350-359

Joonsoo Choi, Chee-Keng Yap: Rectilinear Geodesics in 3-Space (Extended Abstract). Symposium on Computational Geometry 1995: 380-389

Timothy M. Chan, Jack Snoeyink, Chee-Keng Yap: Output-Sensitive Construction of Polytopes in Four Dimensions and Clipped Voronoi Diagrams in Three. SODA 1995: 282-291

Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap: Approximate Euclidean Shortest Path in 3-Space. Symposium on Computational Geometry 1994: 41-48

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9(2): 128-141 (1993)

Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap: Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993)

Chee Yap: Low Level Issues in Computational Geometry. CCCG 1993: 405-419

Dan Halperin, Chee-Keng Yap: Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. Symposium on Computational Geometry 1993: 29-37

Thomas Dubé, Chee-Keng Yap: The Geometry in Constraint Logic Programs. PPCP 1993: 44-50

Diane L. Souvaine, Chee-Keng Yap: Combinatorial Complexity of Signed Discs (Extended Abstract). WADS 1993: 577-588

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992)

David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap: Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discrete & Computational Geometry 7: 295-318 (1992)

Stephen Cameron, Chee-Keng Yap: Refinement Methods for Geometric Bounds in Constructive Solid Geometry. ACM Trans. Graph. 11(1): 12-39 (1992)

Chee-Keng Yap: Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract). FOCS 1992: 437-446

James Cox, Chee-Keng Yap: On-line Motion Planning: Case of a Planar Rod. Ann. Math. Artif. Intell. 3(1): 1-20 (1991)

Chee-Keng Yap: A New Lower Bound Construction for the Word Problem for Commutative Thue Systems. J. Symb. Comput. 12(1): 1-28 (1991)

Kurt Mehlhorn, Chee-Keng Yap: Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20(4): 603-621 (1991)

Jianer Chen, Chee-Keng Yap: Reversal Complexity. SIAM J. Comput. 20(4): 622-638 (1991)

Mark H. Overmars, Chee-Keng Yap: New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20(6): 1034-1045 (1991)

Chee-Keng Yap: Geometric Consistency Theorem for a Symbolic Perturbation Scheme. J. Comput. Syst. Sci. 40(1): 2-18 (1990)

Chee-Keng Yap: Symbolic Treatment of Geometric Degeneration. J. Symb. Comput. 10(3/4): 349-370 (1990)

Gert Vegter, Chee-Keng Yap: Computational Complexity of Combinatorial Surfaces. Symposium on Computational Geometry 1990: 102-111

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: On Simultaneous Inner and Outer Approximation of Shapes. Symposium on Computational Geometry 1990: 216-224

David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap: Quantitative Steinitz's Theorems with Applications to Multifingered Grasping. STOC 1990: 341-351

Chee-Keng Yap: Editor's Foreword: Special Issue on Computational Geometry. Algorithmica 4(1): 1-2 (1989)

Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding Minimal Convex Nested Polygons. Inf. Comput. 83(1): 98-110 (1989)

Bud Mishra, Chee-Keng Yap: Notes on Gröbner bases. Inf. Sci. 48(3): 219-252 (1989)

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap: Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS 1989: 12-23

Chee-Keng Yap, Helmut Alt: Motion Planning in the CL-Environment (Extended Abstract). WADS 1989: 373-380

Chee-Keng Yap: Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. Algorithmica 3: 279-288 (1988)

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry. Algorithmica 3: 293-327 (1988)

William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Discrete & Computational Geometry 3: 281-293 (1988)

Derick Wood, Chee-Keng Yap: The Orthogonal Convex Skull Problem. Discrete & Computational Geometry 3: 349-365 (1988)

L. W. Ericson, Chee-Keng Yap: The Design of LINETOOL, a Geometric Editor. Symposium on Computational Geometry 1988: 83-92

Chee-Keng Yap: A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. Symposium on Computational Geometry 1988: 134-142

Mark H. Overmars, Chee-Keng Yap: New upper bounds in Klee's measure problem (extended abstract). FOCS 1988: 550-556

Kurt Mehlhorn, Chee-Keng Yap: Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP 1988: 410-423

Chee-Keng Yap: Applications of a Symbolic Perturbation Scheme (Abstract). SWAT 1988: 138

Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap: Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica 2: 27-59 (1987)

Chee-Keng Yap: Preface Special Issue on Robotics. Algorithmica 2: 363-365 (1987)

Chee-Keng Yap: An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments. Discrete & Computational Geometry 2: 365-393 (1987)

Richard Cole, Chee-Keng Yap: Shape from Probing. J. Algorithms 8(1): 19-38 (1987)

Richard Cole, Micha Sharir, Chee-Keng Yap: On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987)

Jianer Chen, Chee-Keng Yap: Reversal complexity. Structure in Complexity Theory Conference 1987

William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap: Computing the Link Center of a Simple Polygon. Symposium on Computational Geometry 1987: 1-10

Chee-Keng Yap: What Can be Parallelized in Computational Geometry?. Parallel Algorithms and Architectures 1987: 184-195

Jyun-Sheng Chang, Chee-Keng Yap: A Polynomial Solution for the Potato-peeling Problem. Discrete & Computational Geometry 1: 155-182 (1986)

Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap: New Upper Bounds for Neighbor Searching. Information and Control 68(1-3): 105-124 (1986)

S. Maddila, Chee-Keng Yap: Moving a Polygon Around the Corner in a Corridor. Symposium on Computational Geometry 1986: 187-192

David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap: Probing Convex Polytopes. STOC 1986: 424-432

Richard Cole, Chee-Keng Yap: A Parallel Median Algorithm. Inf. Process. Lett. 20(3): 137-139 (1985)

Colm Ó'Dúnlaing, Chee-Keng Yap: A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms 6(1): 104-111 (1985)

Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap: Minimum area circumscribing Polygons. The Visual Computer 1(2): 112-117 (1985)

Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding minimal convex nested polygons. Symposium on Computational Geometry 1985: 296-304

Derick Wood, Chee-Keng Yap: Computing a convex skill of an orthogonal polygon. Symposium on Computational Geometry 1985: 311-315

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry (Extended Abstract). FOCS 1985: 468-477

Dexter Kozen, Chee-Keng Yap: Algebraic Cell Decomposition in NC (Preliminary Version). FOCS 1985: 515-521

Colm Ó'Dúnlaing, Chee-Keng Yap: Counting digraphs and hypergraphs. Bulletin of the EATCS 24: 85-87 (1984)

Richard Cole, Chee-Keng Yap: Geometric Retrieval Problems. Information and Control 63(1/2): 39-57 (1984)

Paul G. Spirakis, Chee-Keng Yap: Strong NP-Hardness of Moving Many Discs. Inf. Process. Lett. 19(1): 55-59 (1984)

Richard Hull, Chee-Keng Yap: The Format Model: A Theory of database Organization. J. ACM 31(3): 518-544 (1984)

Jyun-Sheng Chang, Chee-Keng Yap: A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems. FOCS 1984: 408-416

Richard Cole, Micha Sharir, Chee-Keng Yap: On k-hulls and Related Problems. STOC 1984: 154-166

Chee-Keng Yap: A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs. Inf. Process. Lett. 16(4): 181-182 (1983)

Chee-Keng Yap: Some Consequences of Non-Uniform Conditions on Uniform Classes. Theor. Comput. Sci. 26: 287-300 (1983)

Richard Cole, Chee-Keng Yap: Geometric Retrieval Problems. FOCS 1983: 112-121

Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap: Retraction: A New Approach to Motion-Planning (Extended Abstract). STOC 1983: 207-220

Colm Ó'Dúnlaing, Chee-Keng Yap: Generic Transformation of Data Structures. FOCS 1982: 186-195

Richard Hull, Chee-Keng Yap: The Format Model: A Theory of Database Organization. PODS 1982: 205-211

Raymond E. Miller, Chee-Keng Yap: On Formulating Simultaneity for Studying Parallelism and Synchronization. J. Comput. Syst. Sci. 20(2): 203-218 (1980)

Chee-Keng Yap: Space-time Tradeoffs and First Order Problems in a Model of Programs. STOC 1980: 318-325

Chee-Keng Yap: On Lifted Problems (Preliminary Reports). FOCS 1978: 267-279

Raymond E. Miller, Chee-Keng Yap: On the formal specification and analysis for loosely connected processes. Mathematical Studies of Information Processing 1978: 33-66

Raymond E. Miller, Chee-Keng Yap: On Formulating Simultaneity for Studying Parallelism and Synchronization. STOC 1978: 105-113

Ronald V. Book, Chee-Keng Yap: On the Computational Power of Reversal-Bounded Machines. ICALP 1977: 111-119

Chee-Keng Yap: New Upper Bounds for Selection. Commun. ACM 19(9): 501-508 (1976)