default search action
L. Paul Chew
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [j16]Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala
, L. Paul Chew:
Optimistic parallelism requires abstractions. Commun. ACM 52(9): 89-97 (2009) - 2008
- [j15]Isana Veksler-Lublinsky
FASH: A web application for nucleotides sequence search. Source Code Biol. Medicine 3 (2008) - [c25]Milind Kulkarni, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala
Optimistic parallelism benefits from data partitioning. ASPLOS 2008: 233-243 - [c24]Milind Kulkarni, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala
Scheduling strategies for optimistic parallel execution of irregular programs. SPAA 2008: 217-228 - 2007
- [c23]Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala
Optimistic parallelism requires abstractions. PLDI 2007: 211-222 - 2006
- [c22]L. Paul Chew:
Exact computation of protein structure similarity. SCG 2006: 468-474 - [c21]Biswanath Panda, Mirek Riedewald, Stephen B. Pope, Johannes Gehrke, L. Paul Chew:
Indexing for Function Approximation. VLDB 2006: 523-534 - 2004
- [j14]L. Paul Chew, Klara Kedem:
Finding the Consensus Shape for a Protein Family. Algorithmica 38(1): 115-129 (2004) - [j13]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) - [j12]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
- [c20]L. Paul Chew, Nikos Chrisochoides, S. Gopalsamy, Gerd Heber, Anthony R. Ingraffea, Edward Luke, Joaquim B. Cavalcante Neto, Keshav Pingali, Alan M. Shih
Computational Science Simulations Based on Web Services. International Conference on Computational Science 2003: 299-308 - 2002
- [j11]L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem:
Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002) - [c19]L. Paul Chew, Klara Kedem:
Finding the consensus shape for a protein family. SCG 2002: 64-73 - [c18]Démian Nave, Nikos Chrisochoides, L. Paul Chew:
Guaranteed: quality parallel delaunay refinement for restricted polyhedral domains. SCG 2002: 135-144 - [c17]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 - 2000
- [c16]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
1990 – 1999
- 1999
- [j10]L. Paul Chew, Dorit Dor, Alon Efrat
Geometric Pattern Matching in d -Dimensional Space. Discret. Comput. Geom. 21(2): 257-274 (1999) - [j9]L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg:
Fast Detection of Common Geometric Substructure in Proteins. J. Comput. Biol. 6(3/4): 313-325 (1999) - [c15]L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg:
Fast detection of common geometric substructure in proteins. RECOMB 1999: 104-114 - [i1]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
- [j8]L. Paul Chew, Klara Kedem:
Getting around a lower bound for the minimum Hausdorff distance. Comput. Geom. 10(3): 197-202 (1998) - [j7]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
- [j6]L. Paul Chew, Steven Fortune:
Sorting Helps for Voronoi Diagrams. Algorithmica 18(2): 217-228 (1997) - [j5]L. Paul Chew:
Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points. Comput. Geom. 7: 73-80 (1997) - [j4]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) - [c14]L. Paul Chew:
Guaranteed-Quality Delaunay Meshing in 3D (Short Version). SCG 1997: 391-393 - 1996
- [c13]Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. ESA 1996: 514-528 - 1995
- [c12]L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem:
Geometric Pattern Matching in d-Dimensional Space. ESA 1995: 264-279 - [c11]Marshall W. Bern, L. Paul Chew, David Eppstein, Jim Ruppert:
Dihedral Bounds for Mesh Generation in High Dimensions. SODA 1995: 189-196 - [c10]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
- [j3]L. Paul Chew, Klara Kedem:
A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion. Comput. Geom. 3: 59-89 (1993) - [c9]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 - [c8]L. Paul Chew:
Near-quadratic Bounds for the ItL_1 Voronoi Diagram of Moving Points. CCCG 1993: 364-369 - [c7]L. Paul Chew:
Guaranteed-Quality Mesh Generation for Curved Surfaces. SCG 1993: 274-280 - 1992
- [c6]L. Paul Chew, Klara Kedem:
Improvements on Geometric Pattern Matching Problems. SWAT 1992: 318-325 - 1991
- [j2]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
- [c5]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
1980 – 1989
- 1989
- [j1]L. Paul Chew:
Constrained Delaunay Triangulations. Algorithmica 4(1): 97-108 (1989) - [c4]L. Paul Chew, Klara Kedem:
Placing the Largest Similar Copy of a Convex Polygon Among Polygonal Obstacles. SCG 1989: 167-173 - 1987
- [c3]L. Paul Chew:
Constrained Delaunay Triangulations. SCG 1987: 215-222 - 1985
- [c2]L. Paul Chew:
Planning the shortest path for a disc in O(n2log n) time. SCG 1985: 214-220 - [c1]L. Paul Chew, Robert L. (Scot) Drysdale III:
Voronoi diagrams based on convex distance functions. SCG 1985: 235-244 - 1981
- [b1]L. Paul Chew:
Normal forms in term rewriting systems. Purdue University, USA, 1981
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-18 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: