L. Paul Chew

43 papers A* 6A 2B 2Misc 1Journal 17Unranked 14
YearRankTypeTitle / Venue / Authors
2009 J jnl
Optimistic parallelism requires abstractions.
Commun. ACM
Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
2008 J jnl
FASH: A web application for nucleotides sequence search.
Source Code Biol. Medicine
Isana Veksler-Lublinsky, Danny Barash, Chai Avisar, Einav Troim, L. Paul Chew, Klara Kedem
2008 A* conf
Optimistic parallelism benefits from data partitioning.
ASPLOS
Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
2008 B conf
Scheduling strategies for optimistic parallel execution of irregular programs.
SPAA
Milind Kulkarni, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
2007 A* conf
Optimistic parallelism requires abstractions.
PLDI
Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
2006 — conf
Exact computation of protein structure similarity.
SCG
L. Paul Chew
2006 A* conf
Indexing for Function Approximation.
VLDB
Biswanath Panda, Mirek Riedewald, Stephen B. Pope, Johannes Gehrke, L. Paul Chew
2004 J jnl
Finding the Consensus Shape for a Protein Family.
Algorithmica
L. Paul Chew, Klara Kedem
2004 J jnl
Guaranteed-quality parallel Delaunay refinement for restricted polyhedral domains.
Comput. Geom.
Démian Nave, Nikos Chrisochoides, L. Paul Chew
2004 J jnl
Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations.
Inf. Process. Lett.
Amit Weisman, L. Paul Chew, Klara Kedem
2003 Misc conf
Computational Science Simulations Based on Web Services.
International Conference on Computational Science
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
2002 — conf
A Concise Representation of Geometry Suitable for Mesh Generation.
IMR
L. Paul Chew, Stephen A. Vavasis, S. Gopalsamy, TzuYi Yu, Bharat K. Soni
2002 — conf
Finding the consensus shape for a protein family.
SCG
L. Paul Chew, Klara Kedem
2002 — conf
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains.
SCG
Démian Nave, Nikos Chrisochoides, L. Paul Chew
2002 J jnl
Walking around fat obstacles.
Inf. Process. Lett.
L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem
2000 — conf
Parallel FEM Simulation of Crack Propagation - Challenges, Status, and Perspectives.
IPDPS Workshops
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
1999 J jnl
Emerging Challenges in Computational Topology
CoRR
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
1999 J jnl
Fast Detection of Common Geometric Substructure in Proteins.
J. Comput. Biol.
L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg
1999 B conf
Fast detection of common geometric substructure in proteins.
RECOMB
L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg
1999 J jnl
Geometric Pattern Matching in d -Dimensional Space.
Discret. Comput. Geom.
L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
1998 J jnl
Getting around a lower bound for the minimum Hausdorff distance.
Comput. Geom.
L. Paul Chew, Klara Kedem
1998 J jnl
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
J. Algorithms
L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
1997 J jnl
Geometric Pattern Matching Under Euclidean Motion.
Comput. Geom.
L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
1997 — conf
Guaranteed-Quality Delaunay Meshing in 3D (Short Version).
SCG
L. Paul Chew
1997 J jnl
Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points.
Comput. Geom.
L. Paul Chew
1997 J jnl
Sorting Helps for Voronoi Diagrams.
Algorithmica
L. Paul Chew, Steven Fortune
1996 A conf
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane.
ESA
Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
1995 A* conf
Dihedral Bounds for Mesh Generation in High Dimensions.
SODA
Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert
1995 A conf
Geometric Pattern Matching in d-Dimensional Space.
ESA
L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
1995 A* conf
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
SODA
L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
1993 J jnl
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion.
Comput. Geom.
L. Paul Chew, Klara Kedem
1993 — conf
Geometric Pattern Matching Under Euclidean Motion.
CCCG
L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
1993 — conf
Guaranteed-Quality Mesh Generation for Curved Surfaces.
SCG
L. Paul Chew
1993 — conf
Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points.
CCCG
L. Paul Chew
1992 — conf
Improvements on Geometric Pattern Matching Problems.
SWAT
L. Paul Chew, Klara Kedem
1991 J jnl
An Efficiently Computable Metric for Comparing Polygonal Shapes.
IEEE Trans. Pattern Anal. Mach. Intell.
Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
1990 A* conf
An Efficiently Computable Metric for Comparing Polygonal Shapes.
SODA
Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell
1989 J jnl
Constrained Delaunay Triangulations.
Algorithmica
L. Paul Chew
1989 — conf
Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles.
SCG
L. Paul Chew, Klara Kedem
1987 — conf
Constrained Delaunay Triangulations.
SCG
L. Paul Chew
1985 — conf
Planning the shortest path for a disc in
SCG
L. Paul Chew
1985 — conf
Voronoi diagrams based on convex distance functions.
SCG
L. Paul Chew, Robert L. (Scot) Drysdale III
1981 — —
Normal forms in term rewriting systems
L. Paul Chew