Dynamic computational geometry on parallel computers. - Laurence Boxer; Russ Miller (C³P, 1988)

Dynamic Computational Geometry on Meshes and Hypercubes. - Laurence Boxer; Russell B. Miller (ICPP (1), 1988)

A Parallel Circle-Cover Minimization Algorithm. - Laurence Boxer; Russ Miller (Inf. Process. Lett., 1989)

Dynamic computational geometry on meshes and hypercubes. - Laurence Boxer; Russ Miller (J. Supercomput., 1989)

Corrigenda: Common Intersections of Polygons. - Laurence Boxer (Inf. Process. Lett., 1990)

Common Intersections of Polygons. - Laurence Boxer; Russ Miller (Inf. Process. Lett., 1990)

Finding congruent regions in parallel. - Laurence Boxer (Parallel Comput., 1992)

Computing deviations from convexity in polygons. - Laurence Boxer (Pattern Recognit. Lett., 1993)

Polygonal approximation by boundary reduction. - Laurence Boxer; Chun-Shi Chang 001; Russ Miller; Andrew Rau-Chaplin (Pattern Recognit. Lett., 1993)

Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices. - Laurence Boxer; Russ Miller (Pattern Recognit. Lett., 1993)

Digitally continuous functions. - Laurence Boxer (Pattern Recognit. Lett., 1994)

Point set pattern matching in 3-D. - Laurence Boxer (Pattern Recognit. Lett., 1996)

On Hausdorff-like metrics for fuzzy sets. - Laurence Boxer (Pattern Recognit. Lett., 1997)

Corrigenda to "On Hausdorff-like metrics for fuzzy sets" [Pattern Recognition Lettes Vol. 18, (1997) 115-118] - Laurence Boxer (Pattern Recognit. Lett., 1997)

Scaleable Parallel Algorithms for Lower Envelopes with Applications. - Laurence Boxer; Russ Miller; Andrew Rau-Chaplin (J. Parallel Distributed Comput., 1998)

Faster point set pattern matching in 3-D. - Laurence Boxer (Pattern Recognit. Lett., 1998)

A Classical Construction for the Digital Fundamental Group. - Laurence Boxer (J. Math. Imaging Vis., 1999)

Scalable Parallel Algorithms for Geometric Pattern Recognition. - Laurence Boxer; Russ Miller; Andrew Rau-Chaplin (J. Parallel Distributed Comput., 1999)

Efficient Computation of the Euclidean Distance Transform. - Laurence Boxer; Russ Miller (Comput. Vis. Image Underst., 2000)

A parallel algorithm for approximate regularity. - Laurence Boxer; Russ Miller (Inf. Process. Lett., 2001)

Corrigendum to "Efficient Computation of the Euclidean Distance Transform". - Laurence Boxer; Russ Miller (Comput. Vis. Image Underst., 2002)

Coarse grained gather and scatter operations with applications. - Laurence Boxer; Russ Miller (J. Parallel Distributed Comput., 2004)

A Pre-Processing Algorithm for String Pattern Matching. - Laurence Boxer (AMCS, 2005)

Properties of Digital Homotopy. - Laurence Boxer (J. Math. Imaging Vis., 2005)

Digital Products, Wedges, and Covering Spaces. - Laurence Boxer (J. Math. Imaging Vis., 2006)

Homotopy Properties of Sphere-Like Digital Images. - Laurence Boxer (J. Math. Imaging Vis., 2006)

Fundamental Groups of Unbounded Digital Images. - Laurence Boxer (J. Math. Imaging Vis., 2007)

The Classification of Digital Covering Spaces. - Laurence Boxer; Ismet Karaca (J. Math. Imaging Vis., 2008)

Efficient Coarse Grained Permutation Exchanges and Matrix Multiplication. - Laurence Boxer (Parallel Process. Lett., 2009)

Some Properties of Digital Covering Spaces. - Laurence Boxer; Ismet Karaca (J. Math. Imaging Vis., 2010)

Remarks on pointed digital homotopy. - Laurence Boxer; P. Christopher Staecker (CoRR, 2015)

Alternate version of continuity for digital multivalued functions. - Laurence Boxer; P. Christopher Staecker (CoRR, 2015)

Homotopy relations for digital images. - Laurence Boxer; P. Christopher Staecker (CoRR, 2015)

Connectivity Preserving Multivalued Functions in Digital Topology. - Laurence Boxer; P. Christopher Staecker (J. Math. Imaging Vis., 2016)

The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting. - Laurence Boxer (CoRR, 2017)

Beyond the Hausdorff Metric in Digital Topology. - Laurence Boxer (CoRR, 2021)

Coarse Grained Parallel Selection. - Laurence Boxer (Parallel Process. Lett., 2021)