default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurence Boxer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j29]Laurence Boxer
:
Coarse Grained Parallel Selection. Parallel Process. Lett. 31(1): 2150003:1-2150003:12 (2021)- [i5]Laurence Boxer:
Beyond the Hausdorff Metric in Digital Topology. CoRR abs/2108.03114 (2021)
2010 – 2019
- 2017
- [i4]Laurence Boxer:
The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting. CoRR abs/1712.00870 (2017) - 2016
- [j28]Laurence Boxer, P. Christopher Staecker:
Connectivity Preserving Multivalued Functions in Digital Topology. J. Math. Imaging Vis. 55(3): 370-377 (2016) - 2015
- [i3]Laurence Boxer, P. Christopher Staecker:
Remarks on pointed digital homotopy. CoRR abs/1503.03016 (2015) - [i2]Laurence Boxer, P. Christopher Staecker:
Alternate version of continuity for digital multivalued functions. CoRR abs/1504.02174 (2015) - [i1]Laurence Boxer, P. Christopher Staecker:
Homotopy relations for digital images. CoRR abs/1509.06576 (2015) - 2010
- [j27]Laurence Boxer, Ismet Karaca:
Some Properties of Digital Covering Spaces. J. Math. Imaging Vis. 37(1): 17-26 (2010)
2000 – 2009
- 2009
- [j26]Laurence Boxer:
Efficient Coarse Grained Permutation Exchanges and Matrix Multiplication. Parallel Process. Lett. 19(3): 477-484 (2009) - 2008
- [j25]Laurence Boxer, Ismet Karaca:
The Classification of Digital Covering Spaces. J. Math. Imaging Vis. 32(1): 23-29 (2008) - 2007
- [j24]Laurence Boxer:
Fundamental Groups of Unbounded Digital Images. J. Math. Imaging Vis. 27(2): 121-127 (2007) - 2006
- [j23]Laurence Boxer:
Homotopy Properties of Sphere-Like Digital Images. J. Math. Imaging Vis. 24(2): 167-175 (2006) - [j22]Laurence Boxer:
Digital Products, Wedges, and Covering Spaces. J. Math. Imaging Vis. 25(2): 159-171 (2006) - 2005
- [j21]Laurence Boxer:
Properties of Digital Homotopy. J. Math. Imaging Vis. 22(1): 19-26 (2005) - [c3]Laurence Boxer:
A Pre-Processing Algorithm for String Pattern Matching. AMCS 2005: 29-32 - 2004
- [j20]Laurence Boxer, Russ Miller:
Coarse grained gather and scatter operations with applications. J. Parallel Distributed Comput. 64(11): 1297-1310 (2004) - 2002
- [j19]Laurence Boxer, Russ Miller:
Corrigendum to "Efficient Computation of the Euclidean Distance Transform". Comput. Vis. Image Underst. 86(2): 137-140 (2002) - 2001
- [j18]Laurence Boxer, Russ Miller:
A parallel algorithm for approximate regularity. Inf. Process. Lett. 80(6): 311-316 (2001) - 2000
- [j17]Laurence Boxer, Russ Miller:
Efficient Computation of the Euclidean Distance Transform. Comput. Vis. Image Underst. 80(3): 379-383 (2000)
1990 – 1999
- 1999
- [j16]Laurence Boxer:
A Classical Construction for the Digital Fundamental Group. J. Math. Imaging Vis. 10(1): 51-62 (1999) - [j15]Laurence Boxer, Russ Miller, Andrew Rau-Chaplin:
Scalable Parallel Algorithms for Geometric Pattern Recognition. J. Parallel Distributed Comput. 58(3): 466-486 (1999) - 1998
- [j14]Laurence Boxer, Russ Miller, Andrew Rau-Chaplin:
Scaleable Parallel Algorithms for Lower Envelopes with Applications. J. Parallel Distributed Comput. 53(2): 91-118 (1998) - [j13]Laurence Boxer:
Faster point set pattern matching in 3-D. Pattern Recognit. Lett. 19(13): 1235-1240 (1998) - 1997
- [j12]Laurence Boxer:
On Hausdorff-like metrics for fuzzy sets. Pattern Recognit. Lett. 18(2): 115-118 (1997) - [j11]Laurence Boxer:
Corrigenda to "On Hausdorff-like metrics for fuzzy sets" [Pattern Recognition Lettes Vol. 18, (1997) 115-118]. Pattern Recognit. Lett. 18(5): 505-506 (1997) - 1996
- [j10]Laurence Boxer:
Point set pattern matching in 3-D. Pattern Recognit. Lett. 17(12): 1293-1297 (1996) - 1994
- [j9]Laurence Boxer:
Digitally continuous functions. Pattern Recognit. Lett. 15(8): 833-839 (1994) - 1993
- [j8]Laurence Boxer, Russ Miller:
Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices. Pattern Recognit. Lett. 14(1): 17-22 (1993) - [j7]Laurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin:
Polygonal approximation by boundary reduction. Pattern Recognit. Lett. 14(2): 111-119 (1993) - [j6]Laurence Boxer:
Computing deviations from convexity in polygons. Pattern Recognit. Lett. 14(3): 163-167 (1993) - 1992
- [j5]Laurence Boxer:
Finding congruent regions in parallel. Parallel Comput. 18(7): 807-810 (1992) - 1990
- [j4]Laurence Boxer, Russ Miller:
Common Intersections of Polygons. Inf. Process. Lett. 33(5): 249-254 (1990) - [j3]Laurence Boxer:
Corrigenda: Common Intersections of Polygons. Inf. Process. Lett. 35(1): 53 (1990)
1980 – 1989
- 1989
- [j2]Laurence Boxer, Russ Miller:
A Parallel Circle-Cover Minimization Algorithm. Inf. Process. Lett. 32(2): 57-60 (1989) - [j1]Laurence Boxer, Russ Miller:
Dynamic computational geometry on meshes and hypercubes. J. Supercomput. 3(3): 161-191 (1989) - 1988
- [c2]Laurence Boxer, Russ Miller:
Dynamic computational geometry on parallel computers. C³P 1988: 1212-1219 - [c1]Laurence Boxer, Russell B. Miller:
Dynamic Computational Geometry on Meshes and Hypercubes. ICPP (1) 1988: 323-330
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-04-25 05:50 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:
