Chee-Keng Yap

Chee Yap

	2012
140		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)
	2011
139		Chee-Keng Yap, Michael Sagraloff: A simple but exact and efficient algorithm for complex root isolation. ISSAC 2011: 353-360
138		Chee Yap: A Real Elementary Approach to the Master Recurrence and Generalizations. TAMC 2011: 14-26
137		Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee Yap: Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves CoRR abs/1102.5463: (2011)
136		Long Lin, Chee Yap: Adaptive Isotopic Approximation of Nonsingular Curves: the Parameterizability and Nonlocal Isotopy Approach. Discrete & Computational Geometry 45(4): 760-795 (2011)
	2010
135		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
134		Gert Vegter, Chee-Keng Yap: Foreword. Mathematics in Computer Science 4(4): 385-387 (2010)
	2009
133		Chee-Keng Yap: In Praise of Numerical Computation. Efficient Algorithms 2009: 380-407
132		Chee-Keng Yap: Exact numerical computation in algebra and geometry. ISSAC 2009: 387-388
131		W. Dale Brownawell, Chee-Keng Yap: Lower bounds for zero-dimensional projections. ISSAC 2009: 79-86
130		Long Lin, Chee-Keng Yap: Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach. Symposium on Computational Geometry 2009: 351-360
129		Chee-Keng Yap, Jihun Yu: Foundations of Exact Rounding. WALCOM 2009: 15-31
128		Michael Burr, Felix Krahmer, Chee Yap: Continuous Amortization: A Non-Probabilistic Adaptive Analysis Technique. Electronic Colloquium on Computational Complexity (ECCC) 16: 136 (2009)
127		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)
	2008
126		Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee-Keng Yap: Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves. ISSAC 2008: 87-94
125		Chee-Keng Yap: Theory of Real Computation According to EGC. Reliable Implementation of Real Number Algorithms 2008: 193-237
124		Chee-Keng Yap, Vikram Sharma: Robust Geometric Computation. Encyclopedia of Algorithms 2008
123		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)
	2007
122		Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap: Complete numerical isolation of real zeros in zero-dimensional triangular systems. ISSAC 2007: 92-99
121		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)
120		Chee-Keng Yap, Hoon Hong: Foreword. Mathematics in Computer Science 1(1): 3-7 (2007)
	2006
119		Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Reply to "Backward Error Analysis ...". ICCSA (1) 2006: 60-60
118		Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap: Almost tight recursion tree bounds for the Descartes method. ISSAC 2006: 71-78
117		Chee-Keng Yap: Complete subdivision algorithms, I: intersection of Bezier curves. Symposium on Computational Geometry 2006: 217-226
116		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
115		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
114		Chee-Keng Yap, Sylvain Pion: Special Issue on Robust Geometric Algorithms and their Implementations. Comput. Geom. 33(1-2): 1-2 (2006)
113		Ken Been, Eli Daiches, Chee-Keng Yap: Dynamic Map Labeling. IEEE Trans. Vis. Comput. Graph. 12(5): 773-780 (2006)
112		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)
111		Sylvain Pion, Chee-Keng Yap: Constructive root bound for k-ary rational input numbers. Theor. Comput. Sci. 369(1-3): 361-376 (2006)
	2005
110		Vikram Sharma, Zilin Du, Chee-Keng Yap: Robust Approximate Zeros. ESA 2005: 874-886
109		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
108		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
107		Chen Li, Sylvain Pion, Chee-Keng Yap: Recent progress in exact geometric computation. J. Log. Algebr. Program. 64(1): 85-111 (2005)
	2004
106		Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan Schirra, Chee-Keng Yap: Classroom Examples of Robustness Problems in Geometric Computations. ESA 2004: 702-713
105		Deok-Soo Kim, Kwangseok Yu, Youngsong Cho, Donguk Kim, Chee-Keng Yap: Shortest Paths for Disc Obstacles. ICCSA (3) 2004: 62-70
104		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)
	2003
103		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
102		Sylvain Pion, Chee-Keng Yap: Constructive root bound for k-ary rational input numbers. Symposium on Computational Geometry 2003: 256-263
101		Ee-Chien Chang, Chee-Keng Yap: Competitive On-Line Scheduling with Level of Service. J. Scheduling 6(3): 251-267 (2003)
	2002
100		Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: Pseudo approximation algorithms, with applications to optimal motion planning. Symposium on Computational Geometry 2002: 170-178
99		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)
	2001
98		Chee Yap, Yunyue Zhu: Yet another look at fractional cascading: B-graphs with application to point location. CCCG 2001: 173-176
97		Ee-Chien Chang, Chee-Keng Yap: Competitive Online Scheduling with Level of Service. COCOON 2001: 453-462
96		Chen Li, Chee-Keng Yap: A new constructive root bound for algebraic expressions. SODA 2001: 496-505
	2000
95		Chee-Keng Yap: Fundamental problems of algorithmic algebra. Oxford University Press 2000: I-XV, 1-511
94		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
93		Ee-Chien Chang, Chee-Keng Yap: A Simultaneous Search Problem. Algorithmica 26(2): 255-262 (2000)
92		Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap: Smallest Enclosing Cylinders. Algorithmica 27(2): 170-186 (2000)
91		Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap: Precision-Sensitive Euclidean Shortest Path in 3-Space. SIAM J. Comput. 29(5): 1577-1595 (2000)
	1999
90		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
89		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)
	1998
88		Dan Halperin, Chee-Keng Yap: Combinatorial complexity of translating a box in polyhedral 3-space. Comput. Geom. 9(3): 181-196 (1998)
	1997
87		Kurt Mehlhorn, Thomas C. Shermer, Chee-Keng Yap: A Complete Roundness Classification Procedure. Symposium on Computational Geometry 1997: 129-138
86		Ee-Chien Chang, Chee-Keng Yap: A Wavelet Approach to Foveating Images. Symposium on Computational Geometry 1997: 397-399
85		Chee-Keng Yap: Towards Exact Geometric Computation. Comput. Geom. 7: 3-23 (1997)
84		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)
83		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)
	1996
82		Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap: Efficient Algorithms for the Smallest Enclosing Cylinder Problem. CCCG 1996: 264-269
81		Tetsuo Asano, David G. Kirkpatrick, Chee-Keng Yap: d1-Optimal Motion for a Rod (Extended Abstract). Symposium on Computational Geometry 1996: 252-263
80		Joonsoo Choi, Chee-Keng Yap: Monotonicity of Rectilinear Geodesics in d-Space (Extended Abstract). Symposium on Computational Geometry 1996: 339-348
79		Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap: Smallest Enclosing Cylinders. Symposium on Computational Geometry 1996: C-13-C-14
78		Chung-Jen Ho, Chee-Keng Yap: The Habicht Approch to Subresultants. J. Symb. Comput. 21(1): 1-14 (1996)
	1995
77		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
76		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
75		Joonsoo Choi, Chee-Keng Yap: Rectilinear Geodesics in 3-Space (Extended Abstract). Symposium on Computational Geometry 1995: 380-389
74		Diane L. Souvaine, Chee-Keng Yap: Combinatorial Complexity of Signed Discs. Comput. Geom. 5: 207-223 (1995)
73		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)
	1994
72		Joonsoo Choi, Jürgen Sellen, Chee-Keng Yap: Approximate Euclidean Shortest Path in 3-Space. Symposium on Computational Geometry 1994: 41-48
	1993
71		Chee Yap: Low Level Issues in Computational Geometry. CCCG 1993: 405-419
70		Thomas Dubé, Chee-Keng Yap: The Geometry in Constraint Logic Programs. PPCP 1993: 44-50
69		Dan Halperin, Chee-Keng Yap: Combinatorial Complexity of Translating a Box in Polyhedral 3-Space. Symposium on Computational Geometry 1993: 29-37
68		Diane L. Souvaine, Chee-Keng Yap: Combinatorial Complexity of Signed Discs (Extended Abstract). WADS 1993: 577-588
67		Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap: Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993)
66		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)
	1992
65		Chee-Keng Yap: Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract) FOCS 1992: 437-446
64		Stephen Cameron, Chee-Keng Yap: Refinement Methods for Geometric Bounds in Constructive Solid Geometry. ACM Trans. Graph. 11(1): 12-39 (1992)
63		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)
62		David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap: Quantitative Steinitz's Theorems Applications to Multifingered Grasping. Discrete & Computational Geometry 7: 295-318 (1992)
	1991
61		James Cox, Chee-Keng Yap: On-line Motion Planning: Case of a Planar Rod. Ann. Math. Artif. Intell. 3(1): 1-20 (1991)
60		Chee-Keng Yap: A New Lower Bound Construction for the Word Problem for Commutative Thue Systems. J. Symb. Comput. 12(1): 1-28 (1991)
59		Kurt Mehlhorn, Chee-Keng Yap: Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves. SIAM J. Comput. 20(4): 603-621 (1991)
58		Jianer Chen, Chee-Keng Yap: Reversal Complexity. SIAM J. Comput. 20(4): 622-638 (1991)
57		Mark H. Overmars, Chee-Keng Yap: New Upper Bounds in Klee's Measure Problem. SIAM J. Comput. 20(6): 1034-1045 (1991)
	1990
56		David G. Kirkpatrick, Bhubaneswar Mishra, Chee-Keng Yap: Quantitative Steinitz's Theorems with Applications to Multifingered Grasping STOC 1990: 341-351
55		Gert Vegter, Chee-Keng Yap: Computational Complexity of Combinatorial Surfaces. Symposium on Computational Geometry 1990: 102-111
54		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
53		Chee-Keng Yap: Geometric Consistency Theorem for a Symbolic Perturbation Scheme. J. Comput. Syst. Sci. 40(1): 2-18 (1990)
52		Chee-Keng Yap: Symbolic Treatment of Geometric Degeneration. J. Symb. Comput. 10(3/4): 349-370 (1990)
	1989
51		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
50		Chee-Keng Yap, Helmut Alt: Motion Planning in the CL-Environment (Extended Abstract). WADS 1989: 373-380
49		Chee-Keng Yap: Editor's Foreword: Special Issue on Computational Geometry. Algorithmica 4(1): 1-2 (1989)
48		Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding Minimal Convex Nested Polygons Inf. Comput. 83(1): 98-110 (1989)
47		Bud Mishra, Chee-Keng Yap: Notes on Gröbner bases. Inf. Sci. 48(3): 219-252 (1989)
	1988
46		Mark H. Overmars, Chee-Keng Yap: New upper bounds in Klee's measure problem (extended abstract) FOCS 1988: 550-556
45		Kurt Mehlhorn, Chee-Keng Yap: Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. ICALP 1988: 410-423
44		Chee-Keng Yap: Applications of a Symbolic Perturbation Scheme (Abstract). SWAT 1988: 138
43		Chee-Keng Yap: A Geometric Consistency Theorem for a Symbolic Perturbation Scheme. Symposium on Computational Geometry 1988: 134-142
42		L. W. Ericson, Chee-Keng Yap: The Design of LINETOOL, a Geometric Editor. Symposium on Computational Geometry 1988: 83-92
41		Chee-Keng Yap: Parallel Triangulation of a Polygon in Two Cails to the Trapezoidal Map. Algorithmica 3: 279-288 (1988)
40		Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry. Algorithmica 3: 293-327 (1988)
39		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)
38		Derick Wood, Chee-Keng Yap: The Orthogonal Convex Skull Problem. Discrete & Computational Geometry 3: 349-365 (1988)
	1987
37		Chee-Keng Yap: What Can be Parallelized in Computational Geometry?. Parallel Algorithms and Architectures 1987: 184-195
36		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
35		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)
34		Chee-Keng Yap: Preface Special Issue on Robotics. Algorithmica 2: 363-365 (1987)
33		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)
32		Richard Cole, Chee-Keng Yap: Shape from Probing. J. Algorithms 8(1): 19-38 (1987)
31		Richard Cole, Micha Sharir, Chee-Keng Yap: On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987)
	1986
30		David P. Dobkin, Herbert Edelsbrunner, Chee-Keng Yap: Probing Convex Polytopes STOC 1986: 424-432
29		S. Maddila, Chee-Keng Yap: Moving a Polygon Around the Corner in a Corridor. Symposium on Computational Geometry 1986: 187-192
28		Jyun-Sheng Chang, Chee-Keng Yap: A Polynomial Solution for the Potato-peeling Problem. Discrete & Computational Geometry 1: 155-182 (1986)
27		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)
	1985
26		Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry (Extended Abstract) FOCS 1985: 468-477
25		Dexter Kozen, Chee-Keng Yap: Algebraic Cell Decomposition in NC (Preliminary Version) FOCS 1985: 515-521
24		Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap: Finding minimal convex nested polygons. Symposium on Computational Geometry 1985: 296-304
23		Derick Wood, Chee-Keng Yap: Computing a convex skill of an orthogonal polygon. Symposium on Computational Geometry 1985: 311-315
22		Richard Cole, Chee-Keng Yap: A Parallel Median Algorithm. Inf. Process. Lett. 20(3): 137-139 (1985)
21		Colm Ó'Dúnlaing, Chee-Keng Yap: A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms 6(1): 104-111 (1985)
20		Alok Aggarwal, Jyun-Sheng Chang, Chee-Keng Yap: Minimum area circumscribing Polygons. The Visual Computer 1(2): 112-117 (1985)
	1984
19		Jyun-Sheng Chang, Chee-Keng Yap: A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems FOCS 1984: 408-416
18		Richard Cole, Micha Sharir, Chee-Keng Yap: On k-hulls and Related Problems STOC 1984: 154-166
17		Colm Ó'Dúnlaing, Chee-Keng Yap: Counting digraphs and hypergraphs. Bulletin of the EATCS 24: 85-87 (1984)
16		Paul G. Spirakis, Chee-Keng Yap: Strong NP-Hardness of Moving Many Discs. Inf. Process. Lett. 19(1): 55-59 (1984)
15		Richard Cole, Chee-Keng Yap: Geometric Retrieval Problems Information and Control 63(1/2): 39-57 (1984)
14		Richard Hull, Chee-Keng Yap: The Format Model: A Theory of database Organization. J. ACM 31(3): 518-544 (1984)
	1983
13		Richard Cole, Chee-Keng Yap: Geometric Retrieval Problems FOCS 1983: 112-121
12		Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap: Retraction: A New Approach to Motion-Planning (Extended Abstract) STOC 1983: 207-220
11		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)
10		Chee-Keng Yap: Some Consequences of Non-Uniform Conditions on Uniform Classes. Theor. Comput. Sci. 26: 287-300 (1983)
	1982
9		Colm Ó'Dúnlaing, Chee-Keng Yap: Generic Transformation of Data Structures FOCS 1982: 186-195
8		Richard Hull, Chee-Keng Yap: The Format Model: A Theory of Database Organization. PODS 1982: 205-211
	1980
7		Chee-Keng Yap: Space-time Tradeoffs and First Order Problems in a Model of Programs STOC 1980: 318-325
6		Raymond E. Miller, Chee-Keng Yap: On Formulating Simultaneity for Studying Parallelism and Synchronization. J. Comput. Syst. Sci. 20(2): 203-218 (1980)
	1978
5		Chee-Keng Yap: On Lifted Problems (Preliminary Reports) FOCS 1978: 267-279
4		Raymond E. Miller, Chee-Keng Yap: On the formal specification and analysis for loosely connected processes. Mathematical Studies of Information Processing 1978: 33-66
3		Raymond E. Miller, Chee-Keng Yap: On Formulating Simultaneity for Studying Parallelism and Synchronization STOC 1978: 105-113
	1977
2		Ronald V. Book, Chee-Keng Yap: On the Computational Power of Reversal-Bounded Machines. ICALP 1977: 111-119
	1976
1		Chee-Keng Yap: New Upper Bounds for Selection. Commun. ACM 19(9): 501-508 (1976)

Coauthor Index

1	Pankaj K. Agarwal	[89]
2	Alok Aggarwal	[20] [24] [26] [40] [48]
3	Helmut Alt	[50]
4	Nina Amenta	[89]
5	Tetsuo Asano	[81] [100] [103] [104]
6	Ken Been	[113]
7	Marshall W. Bern	[89]
8	Ronald V. Book	[2]
9	Heather Booth	[24] [48]
10	Hervé Brönnimann	[135]
11	W. Dale Brownawell	[131]
12	Michael Burr	[126] [128] [137] [140]
13	Stephen Cameron	[64]
14	Timothy M. Chan	[77] [84]
15	Ee-Chien Chang	[73] [86] [93] [97] [101] [109] [112]
16	Jyun-Sheng Chang	[19] [20] [28]
17	Bernard Chazelle	[26] [27] [40]
18	Jianer Chen	[58]
19	Jin-San Cheng	[122] [127]
20	L. Paul Chew	[89]
21	Youngsong Cho	[105]
22	Joonsoo Choi	[72] [75] [76] [80] [83] [91]
23	Sung Woo Choi	[109] [112] [126] [137] [140]
24	Richard Cole	[13] [15] [18] [22] [27] [31] [32]
25	James Cox	[61]
26	Ovidiu Daescu	[108] [115] [116]
27	Eli Daiches	[113]
28	Tamal K. Dey	[89]
29	David P. Dobkin	[30] [89]
30	Zilin Du	[99] [110] [135]
31	Thomas Dubé	[70]
32	Herbert Edelsbrunner	[30] [89]
33	Arno Eigenwillig	[118]
34	Maria Eleftheriou	[99]
35	David Eppstein	[89]
36	L. W. Ericson	[42]
37	Rudolf Fleischer	[54] [63]
38	Benjamin Galehouse	[126] [137] [140]
39	Xiao-Shan Gao	[122] [127]
40	Michael T. Goodrich	[51] [66]
41	Cindy Grimm (Cindy M. Grimm)	[89]
42	Leonidas J. Guibas	[26] [40] [89]
43	Dan Halperin	[69] [88]
44	John Harer	[89]
45	Paul Harrington	[121]
46	Joel Hass	[89]
47	Andrew Hicks	[89]
48	Chung-Jen Ho	[78]
49	Hoon Hong	[120]
50	Richard Hull	[8] [14]
51	Christian Icking	[67]
52	Carroll K. Johnson	[89]
53	Vijay Karamcheti	[90]
54	Lutz Kettner	[106] [119] [123]
55	Deok-Soo Kim	[105]
56	Donguk Kim	[105]
57	David G. Kirkpatrick	[56] [62] [81] [100] [103] [104]
58	Dexter Kozen	[25]
59	Felix Krahmer	[128]
60	DoYong Kwon	[109] [112]
61	William J. Lenhart (William Lenhart)	[36] [39]
62	Gilad Lerman	[89]
63	David Letscher	[89]
64	C. Li	[90]
65	Chen Li	[94] [96] [107]
66	Long Lin	[130] [136]
67	S. Maddila	[29]
68	Kurt Mehlhorn	[45] [54] [59] [63] [87] [106] [119] [123]
69	Raymond E. Miller	[3] [4] [6]
70	Bud Mishra (Bhubaneswar Mishra)	[47] [56] [62]
71	Joseph S. B. Mitchell	[108] [115] [116]
72	José E. Moreira	[99]
73	Simeon C. Ntafos	[108] [115] [116]
74	Colm Ó'Dúnlaing	[9] [12] [17] [21] [26] [35] [40] [51] [66] [121]
75	Joseph O'Rourke	[24] [48]
76	Mark H. Overmars	[46] [57]
77	James D. Palmer	[108] [115] [116]
78	Hyungju Park	[109] [112]
79	Igor Pechtchanski	[90]
80	Sylvain Pion	[102] [106] [107] [111] [114] [119] [123] [135]
81	Paul E. Plassmann	[89]
82	Richard Pollack	[36] [39]
83	Franco P. Preparata	[27]
84	Günter Rote	[54] [63] [67]
85	Jörg-Rüdiger Sack	[36] [39]
86	Michael Sagraloff	[139]
87	Stefan Schirra	[106] [119] [123]
88	Elmar Schömer	[79] [82] [92]
89	Eric Sedgwick	[89]
90	Raimund Seidel	[36] [39]
91	Jürgen Sellen	[72] [76] [79] [82] [83] [91] [92]
92	Micha Sharir	[12] [18] [31] [35] [36] [39]
93	Vikram Sharma	[110] [118] [124]
94	Thomas C. Shermer	[87]
95	Jack Snoeyink	[77] [84] [89]
96	Diane L. Souvaine	[68] [74]
97	Paul G. Spirakis	[16]
98	Subhash Suri	[24] [36] [39] [48]
99	Marek Teichmann	[79] [82] [92]
100	Godfried T. Toussaint	[36] [39]
101	Daniela Tulone	[94]
102	Gert Vegter	[55] [134]
103	Jeff Weeks	[89]
104	Emo Welzl	[54] [63] [67]
105	Sue Whitesides	[36] [39]
106	Derick Wood	[23] [38]
107	Jihun Yu	[129] [135]
108	Kwangseok Yu	[105]
109	Yunyue Zhu	[98]
110	Denis Zorin	[89]

Colors in the list of coauthors

Last update Sat May 26 02:31:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page