`Hyperresolution theorem-provers.' Unpublished M.Sc. dissertation, Department of Computer Science, Trinity College, Dublin, 1981.
abstract

`Testing for the Church-Rosser property,' (with Ronald. V. Book). Theoretical Computer Science 16 (1981), 223--229.
abstract

`Thue congruences and the Church-Rosser property,' (with Ronald V. Book). Semigroup Forum 22 (1981) 367--379.
abstract

`Finite and infinite regular Thue systems.' Ph.D. dissertation, University of California at Santa Barbara (under the supervision of Ronald V. Book) (1981).
abstract

`Generic transformations of data structures,' (with Chee-Keng Yap). Proc. 23rd IEEE FOCS (1982) 186--195.
abstract

`Notes on ground resolution.' Expository manuscript (1982).
abstract

`Infinite regular Thue systems.' Theoretical Computer Science 25 (1983) 171--192.
abstract

`Undecidable questions related to Church-Rosser Thue systems.' Theoretical Computer Science 23 (1983) 339--345.
abstract

`Retraction: a new approach to motion-planning,' (with Micha Sharir and Chee-Keng Yap). Proc 15th ACM STOC (1983) 207--220. An extended version has appeared in Planning, Geometry, and Complexity of Robot Motion, edited by Scwhartz, Sharir, and Hopcroft, Ablex Publishing Corporation, 1987.
abstract

`Counting digraphs and hypergraphs,' (with Chee-Keng Yap). Bulletin EATCS (1984).
abstract

`A `retraction' method for planning the motion of a disc,' (with Chee-Keng Yap). Journal of Algorithms 6 (1985) 104--111. Also published in Planning, Geometry, and Complexity of Robot Motion, edited by Scwhartz, Sharir, and Hopcroft, Ablex Publishing Corporation, 1987.
abstract

`Complexity of certain decision problems about congruential languages,' (with Paliath Narendran and Heinrich Rolletschek). Journal of Computer and System Sciences 30: 3 (1985) 343--357.
abstract

`Parallel computational geometry,' (with Alok Aggarwal, Bernard Chazelle, Leo Guibas, and Chee-Keng Yap). Proc. 26th IEEE Symp. on Theory of Computing (1985) 468--477.
abstract

`Note on the AKS sorting network' (with Richard Cole). Technical Report No. 243, Computer Science Department, New York University (1986).
abstract

`Generalized Voronoi diagrams for moving a ladder I: topological analysis,' (with Micha Sharir and Chee-Keng Yap). Communications in Pure and Applied Mathematics (1986) 423-483.
abstract

`Generalized Voronoi diagrams for a ladder II: efficient construction of the diagram,' (with Micha Sharir and Chee-Keng Yap). Algorithmica 2 (1987) 27-59.
abstract

`Analysis of the motion-planning problem for a simple two-link planar arm' (with Boris Aronov). Technical Report No. 314, Computer Science Department, New York University (1987). (Presented at the 1987 SIAM Conference on Applied Geometry, Albany, New York).
abstract

`Motion-planning with inertial constraints.' Algorithmica 2:4 (1987) 431--475 (special issue on Robotics).
abstract

`Parallel Computational Geometry,' (with Alok Aggarwal, Bernard Chazelle, Leo Guibas, and Chee-Keng Yap). Algorithmica 3 (1988) 293--327 (special issue on Parallel Processing). This is a slightly condensed version of: Technical report No. 307, Computer Science Department, New York University (1987).
abstract

`A tight lower bound for the complexity of path-planning for a disc.' Information Processing Letters 28 (1988) 165--170.
abstract

`Cancellativity in finitely presented semigroups,' (with Paliath Narendran). Journal of Symbolic Computation 7 (1989) 457--472. (An extended abstract was published in the proceedings of a 1985 workshop on combinatorial algorithms in algebra sponsored by Universität Kaiserslautern.)
abstract

`Computing the Voronoi diagram of a set of line-segments in parallel,' (with Michael T. Goodrich and Chee-Keng Yap). Springer Lecture Notes 382: WADS '89 (1989), 12--23.
abstract

`On the construction of abstract Voronoi diagrams,' (with Kurt Mehlhorn and Stefan Meiser). Proc. 7th STACS (Rouen 1990) Springer LNCS 415, 227--239.
abstract

`Enumeration of tree properties by naïve methods,' (with Lars Ericson). Algorithms review 1:3, September 1990, 119--124. Republished as TCDMATH-01-07.
abstract

`Fortune's Voronoi sweepline algorithm for convex sites' IMACS '91 (Dublin 1991) 133--134
abstract

`On the Construction of Abstract Voronoi diagrams,' (with Rolf Klein, Kurt Mehlhorn, and Stefan Meiser).
Discrete and Computational Geometry 6 (1991) 211--224.
abstract

`Merging free trees in parallel for efficient Voronoi diagram construction' (with Richard Cole and Michael T. Goodrich) Proc 17th ICALP , Warwick, July 1990 (Springer LNCS 443) 432--445.
abstract

`It is undecidable whether a finite special string-rewriting system presents a group,' (with Paliath Narendran and Friedrich Otto). Discrete Mathematics 98 (1991) 153--159.
abstract

`Some parallel geometric algorithms.' In Lectures on Parallel Computation, ed. Alan Gibbons and Paul Spirakis, Cambridge University Press (1993), 77--108.
abstract

`A simple linear-time planar layout algorithm with a LEDA implementation.' Report ALCOM-II-429 (1994), also TCDMATH 98--06 (1998).
abstract
postscript

Miscellaneous topological algorithms (with Colum Watt, David Wilkins, and Chee-Keng Yap). Report ALCOM-II-430 (1995), and TCDMATH 97-01 (1997).
abstract
Preview

`Resolution proofs viewed as automata.' Report ALCOM-II-022 (1993); later appeared, slightly abridged, in Bulletin of the EATCS 59 (June 1996), 153--156.
abstract

`A nearly optimal deterministic parallel Voronoi diagram algorithm,' (with Richard Cole and Michael T. Goodrich). Report ALCOM-II-023 (1993); published in Algorithmica 16 (1996), 569--617
abstract

`Completeness of some axioms of Lukasiewicz's: an exercise in problem-solving.' Report TCDMATH 97-05 (1997).
abstract
postscript

A short course in Eiffel. Report TCDMATH 97-06 (1997).
abstract
postscript

Homeomorphism of 2-complexes is equivalent to graph isomorphism (with Colum Watt and David Wilkins). Report TCDMATH 98-04 (1998). Published in International Journal of Computational Geometry and Applications10:5(2000), 453--476.
abstract
postscript

TCDMATH 99-04.
Mathematics in primary schools, by Colm Ó Dúnlaing. Published in the Irish Mathematics Teachers Association Newlsetter 98(2000), 13--24.
abstract postscript pdf

TCDMATH 00-09.
The complexity of scheduling TV commercials, by Klemens Hägele, Colm Ó Dúnlaing, and Søren Riis. Extended version of a paper delivered at the MFCSIT2000, Cork, 2000. Published in Electronic notes in theoretical computer science 40 (2001).
abstract postscript pdf

TCDMATH 02-07.
Inorder traversal of splay trees, by Colm Ó Dúnlaing
Extended version of paper delivered at the MFCSIT2002, Galway, 2000. Revised version published in Electronic notes in theoretical computer science (Volume 74
abstract postscript pdf

TCDMATH 03-09.
Local differentiability and monotonicity properties of Voronoi diagrams for disjoint convex sites in three dimensions, by Colm Ó Dúnlaing.
abstract postscript pdf

TCDMATH 04-21.
Optimal Voronoi diagram construction with n convex sites in three dimensions, by Paul Harrington, Colm Ó Dúnlaing, and Chee K. Yap.
abstract postscript pdf

TCDMATH 05-10.
Nodally 3-connected planar graphs and barycentric embeddings, by Colm Ó Dúnlaing.
abstract postscript pdf