Finite and infinite regular thue systems. - Colm Ó'Dúnlaing (1981)

On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). - Ronald V. Book; Matthias Jantzen; Burkhard Monien; Colm Ó'Dúnlaing; Celia Wrathall (MFCS, 1981)

Testing for the Church-Rosser Property. - Ronald V. Book; Colm Ó'Dúnlaing (Theor. Comput. Sci., 1981)

Generic Transformation of Data Structures - Colm Ó'Dúnlaing; Chee-Keng Yap (FOCS, 1982)

Retraction: A New Approach to Motion-Planning (Extended Abstract) - Colm Ó'Dúnlaing; Micha Sharir; Chee-Keng Yap (STOC, 1983)

Infinite Regular Thue Systems. - Colm Ó'Dúnlaing (Theor. Comput. Sci., 1983)

Undecidable questions related to Church-Rosser Thue systems. - Colm Ó'Dúnlaing (Theor. Comput. Sci., 1983)

Counting digraphs and hypergraphs. - Colm Ó'Dúnlaing; Chee-Keng Yap (Bull. EATCS, 1984)

Parallel Computational Geometry (Extended Abstract) - Alok Aggarwal; Bernard Chazelle; Leonidas J. Guibas; Colm Ó'Dúnlaing; Chee-Keng Yap (FOCS, 1985)

A "Retraction" Method for Planning the Motion of a Disc. - Colm Ó'Dúnlaing; Chee-Keng Yap (J. Algorithms, 1985)

Complexity of Certain Decision Problems about Congruential Languages. - Paliath Narendran; Colm Ó'Dúnlaing; Heinrich Rolletschek (J. Comput. Syst. Sci., 1985)

Motion Planning with Inertial Constraints. - Colm Ó'Dúnlaing (Algorithmica, 1987)

Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. - Colm Ó'Dúnlaing; Micha Sharir; Chee-Keng Yap (Algorithmica, 1987)

Parallel Computational Geometry. - Alok Aggarwal; Bernard Chazelle; Leonidas J. Guibas; Colm Ó'Dúnlaing; Chee-Keng Yap (Algorithmica, 1988)

A Tight Lower Bound for the Complexity of Path-Planning for a Disc. - Colm Ó'Dúnlaing (Inf. Process. Lett., 1988)

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). - Michael T. Goodrich; Colm Ó'Dúnlaing; Chee-Keng Yap (WADS, 1989)

Cancellativity in Finitely Presented Semigroups. - Paliath Narendran; Colm Ó'Dúnlaing (J. Symb. Comput., 1989)

Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). - Richard Cole 001; Michael T. Goodrich; Colm Ó'Dúnlaing (ICALP, 1990)

On the Construction of Abstract Voronoi Diagrams. - Kurt Mehlhorn; Stefan Meiser; Colm Ó'Dúnlaing (Discret. Comput. Geom., 1991)

It is undecidable whether a finite special string-rewriting system presents a group. - Paliath Narendran; Colm Ó'Dúnlaing; Friedrich Otto (Discret. Math., 1991)

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. - Michael T. Goodrich; Colm Ó'Dúnlaing; Chee-Keng Yap (Algorithmica, 1993)

A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. - Richard Cole 001; Michael T. Goodrich; Colm Ó'Dúnlaing (Algorithmica, 1996)

Resolution Proofs viewed as Automata. - Colm Ó'Dúnlaing (Bull. EATCS, 1996)

The complexity of scheduling TV commercials. - Klemens Hägele; Colm Ó'Dúnlaing; Søren Riis (MFCSIT, 2000)

Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism. - Colm Ó'Dúnlaing; Colum Watt; David Wilkins (Int. J. Comput. Geom. Appl., 2000)

Inorder traversal of splay trees. - Colm Ó'Dúnlaing (MFCSIT, 2002)

A Simple Criterion for Nodal 3-connectivity in Planar Graphs. - Colm Ó'Dúnlaing (MFCSIT, 2006)

Nodally 3-connected planar graphs and convex combination mappings - Colm Ó'Dúnlaing (CoRR, 2007)

Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language - Colm Ó'Dúnlaing; Natalie Schluter (CoRR, 2007)

Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. - Paul Harrington; Colm Ó'Dúnlaing; Chee-Keng Yap (Int. J. Comput. Geom. Appl., 2007)

A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems. - Colm Ó'Dúnlaing; Natalie Schluter (Theor. Comput. Sci., 2010)

CUDA implementation of Wagener's 2D convex hull PRAM algorithm - Colm Ó'Dúnlaing (CoRR, 2012)

Compact families of Jordan curves and convex hulls in three dimensions. - Colm Ó'Dúnlaing (CoRR, 2013)

An ACCL which is not a CRCL. - Colm Ó'Dúnlaing (CoRR, 2014)

An almost-confluent congruential language which is not Church-Rosser congruential. - Colm Ó'Dúnlaing (Theor. Comput. Sci., 2015)

A coefficient related to splay-to-root traversal, correct to thousands of decimal places. - Colm Ó'Dúnlaing (CoRR, 2021)