2008 |
38 | EE | Milind Kulkarni,
Keshav Pingali,
Ganesh Ramanarayanan,
Bruce Walter,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism benefits from data partitioning.
ASPLOS 2008: 233-243 |
37 | EE | Milind Kulkarni,
Patrick Carribault,
Keshav Pingali,
Ganesh Ramanarayanan,
Bruce Walter,
Kavita Bala,
L. Paul Chew:
Scheduling strategies for optimistic parallel execution of irregular programs.
SPAA 2008: 217-228 |
2007 |
36 | EE | Milind Kulkarni,
Keshav Pingali,
Bruce Walter,
Ganesh Ramanarayanan,
Kavita Bala,
L. Paul Chew:
Optimistic parallelism requires abstractions.
PLDI 2007: 211-222 |
2006 |
35 | EE | L. Paul Chew:
Exact computation of protein structure similarity.
Symposium on Computational Geometry 2006: 468-474 |
34 | EE | Biswanath Panda,
Mirek Riedewald,
Stephen B. Pope,
Johannes Gehrke,
L. Paul Chew:
Indexing for Function Approximation.
VLDB 2006: 523-534 |
2004 |
33 | EE | Démian Nave,
Nikos Chrisochoides,
L. Paul Chew:
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains.
Comput. Geom. 28(2-3): 191-215 (2004) |
32 | EE | Amit Weisman,
L. Paul Chew,
Klara Kedem:
Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations.
Inf. Process. Lett. 92(5): 245-251 (2004) |
2003 |
31 | EE | L. Paul Chew,
Nikos Chrisochoides,
S. Gopalsamy,
Gerd Heber,
Anthony R. Ingraffea,
Edward Luke,
Joaquim B. Cavalcante Neto,
Keshav Pingali,
Alan M. Shih,
Bharat K. Soni,
Paul Stodghill,
David S. Thompson,
Stephen A. Vavasis,
Paul A. Wawrzynek:
Computational Science Simulations Based on Web Services.
International Conference on Computational Science 2003: 299-308 |
30 | EE | L. Paul Chew,
Klara Kedem:
Finding the Consensus Shape for a Protein Family.
Algorithmica 38(1): 115-129 (2003) |
2002 |
29 | EE | L. Paul Chew,
Stephen A. Vavasis,
S. Gopalsamy,
TzuYi Yu,
Bharat K. Soni:
A Concise Representation of Geometry Suitable for Mesh Generation.
IMR 2002: 275-283 |
28 | EE | Démian Nave,
Nikos Chrisochoides,
L. Paul Chew:
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains.
Symposium on Computational Geometry 2002: 135-144 |
27 | EE | L. Paul Chew,
Klara Kedem:
Finding the consensus shape for a protein family.
Symposium on Computational Geometry 2002: 64-73 |
26 | EE | L. Paul Chew,
Haggai David,
Matthew J. Katz,
Klara Kedem:
Walking around fat obstacles.
Inf. Process. Lett. 83(3): 135-140 (2002) |
2000 |
25 | EE | Bruce Carter,
Chuin-Shan Chen,
L. Paul Chew,
Nikos Chrisochoides,
Guang R. Gao,
Gerd Heber,
Anthony R. Ingraffea,
Roland Krause,
Chris Myers,
Démian Nave,
Keshav Pingali,
Paul Stodghill,
Stephen A. Vavasis,
Paul A. Wawrzynek:
Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives.
IPDPS Workshops 2000: 443-449 |
1999 |
24 | EE | L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Jon M. Kleinberg:
Fast detection of common geometric substructure in proteins.
RECOMB 1999: 104-114 |
23 | EE | 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) |
22 | EE | L. Paul Chew,
Dorit Dor,
Alon Efrat,
Klara Kedem:
Geometric Pattern Matching in d -Dimensional Space.
Discrete & Computational Geometry 21(2): 257-274 (1999) |
21 | | L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Jon M. Kleinberg:
Fast Detection of Common Geometric Substructure in Proteins.
Journal of Computational Biology 6(3/4): (1999) |
1998 |
20 | | L. Paul Chew,
Klara Kedem:
Getting around a lower bound for the minimum Hausdorff distance.
Comput. Geom. 10(3): 197-202 (1998) |
19 | | L. Paul Chew,
Klara Kedem,
Micha Sharir,
Boaz Tagansky,
Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
J. Algorithms 29(2): 238-255 (1998) |
1997 |
18 | EE | L. Paul Chew:
Guaranteed-Quality Delaunay Meshing in 3D (Short Version).
Symposium on Computational Geometry 1997: 391-393 |
17 | | L. Paul Chew,
Steven Fortune:
Sorting Helps for Voronoi Diagrams.
Algorithmica 18(2): 217-228 (1997) |
16 | | L. Paul Chew,
Michael T. Goodrich,
Daniel P. Huttenlocher,
Klara Kedem,
Jon M. Kleinberg,
Dina Kravets:
Geometric Pattern Matching Under Euclidean Motion.
Comput. Geom. 7: 113-124 (1997) |
15 | | L. Paul Chew:
Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points.
Comput. Geom. 7: 73-80 (1997) |
1996 |
14 | | Srinivasa Rao Arikati,
Danny Z. Chen,
L. Paul Chew,
Gautam Das,
Michiel H. M. Smid,
Christos D. Zaroliagis:
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
ESA 1996: 514-528 |
1995 |
13 | | L. Paul Chew,
Dorit Dor,
Alon Efrat,
Klara Kedem:
Geometric Pattern Matching in d-Dimensional Space.
ESA 1995: 264-279 |
12 | | Marshall W. Bern,
L. Paul Chew,
David Eppstein,
Jim Ruppert:
Dihedral Bounds for Mesh Generation in High Dimensions.
SODA 1995: 189-196 |
11 | | L. Paul Chew,
Klara Kedem,
Micha Sharir,
Boaz Tagansky,
Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
SODA 1995: 197-204 |
1993 |
10 | | L. Paul Chew,
Michael T. Goodrich,
Daniel P. Huttenlocher,
Klara Kedem,
Jon M. Kleinberg,
Dina Kravets:
Geometric Pattern Matching Under Euclidean Motion.
CCCG 1993: 151-156 |
9 | | L. Paul Chew:
Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points.
CCCG 1993: 364-369 |
8 | EE | L. Paul Chew:
Guaranteed-Quality Mesh Generation for Curved Surfaces.
Symposium on Computational Geometry 1993: 274-280 |
7 | | L. Paul Chew,
Klara Kedem:
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion.
Comput. Geom. 3: 59-89 (1993) |
1992 |
6 | | L. Paul Chew,
Klara Kedem:
Improvements on Geometric Pattern Matching Problems.
SWAT 1992: 318-325 |
1991 |
5 | EE | Esther M. Arkin,
L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell. 13(3): 209-216 (1991) |
1990 |
4 | | Esther M. Arkin,
L. Paul Chew,
Daniel P. Huttenlocher,
Klara Kedem,
Joseph S. B. Mitchell:
An Efficiently Computable Metric for Comparing Polygonal Shapes.
SODA 1990: 129-137 |
1989 |
3 | EE | L. Paul Chew,
Klara Kedem:
Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles.
Symposium on Computational Geometry 1989: 167-173 |
2 | | L. Paul Chew:
Constrained Delaunay Triangulations.
Algorithmica 4(1): 97-108 (1989) |
1987 |
1 | EE | L. Paul Chew:
Constrained Delaunay Triangulations.
Symposium on Computational Geometry 1987: 215-222 |