Colm Ó'Dúnlaing

According to our database, Colm Ó'Dúnlaing authored at least 36 papers between 1981 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

A coefficient related to splay-to-root traversal, correct to thousands of decimal places.

Colm Ó'Dúnlaing

CoRR, 2021

2015

An almost-confluent congruential language which is not Church-Rosser congruential.

Colm Ó'Dúnlaing

Theor. Comput. Sci., 2015

2014

An ACCL which is not a CRCL.

Colm Ó'Dúnlaing

CoRR, 2014

2013

Compact families of Jordan curves and convex hulls in three dimensions.

Colm Ó'Dúnlaing

CoRR, 2013

2012

CUDA implementation of Wagener's 2D convex hull PRAM algorithm

Colm Ó'Dúnlaing

CoRR, 2012

2010

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

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

Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language

Colm Ó'Dúnlaing, Natalie Schluter

CoRR, 2007

Nodally 3-connected planar graphs and convex combination mappings

Colm Ó'Dúnlaing

CoRR, 2007

2006

A Simple Criterion for Nodal 3-connectivity in Planar Graphs.

Colm Ó'Dúnlaing

Proceedings of the Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2006

2002

Inorder traversal of splay trees.

Colm Ó'Dúnlaing

Proceedings of the Second Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2002

2000

Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism.

Colm Ó'Dúnlaing, Colum Watt, David Wilkins

Int. J. Comput. Geom. Appl., 2000

The complexity of scheduling TV commercials.

Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis

Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology, 2000

1996

Resolution Proofs viewed as Automata.

Colm Ó'Dúnlaing

Bull. EATCS, 1996

A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm.

Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing

Algorithmica, 1996

1993

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap

Algorithmica, 1993

1991

It is undecidable whether a finite special string-rewriting system presents a group.

Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto

Discret. Math., 1991

On the Construction of Abstract Voronoi Diagrams.

Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing

Discret. Comput. Geom., 1991

1990

Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).

Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Cancellativity in Finitely Presented Semigroups.

Paliath Narendran, Colm Ó'Dúnlaing

J. Symb. Comput., 1989

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).

Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the Algorithms and Data Structures, 1989

1988

A Tight Lower Bound for the Complexity of Path-Planning for a Disc.

Colm Ó'Dúnlaing

Inf. Process. Lett., 1988

Parallel Computational Geometry.

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap

Algorithmica, 1988

1987

Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.

Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap

Algorithmica, 1987

Motion Planning with Inertial Constraints.

Colm Ó'Dúnlaing

Algorithmica, 1987

1985

Complexity of Certain Decision Problems about Congruential Languages.

Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek

J. Comput. Syst. Sci., 1985

A "Retraction" Method for Planning the Motion of a Disc.

Colm Ó'Dúnlaing, Chee-Keng Yap

J. Algorithms, 1985

Parallel Computational Geometry (Extended Abstract)

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Counting digraphs and hypergraphs.

Colm Ó'Dúnlaing, Chee-Keng Yap

Bull. EATCS, 1984

1983

Undecidable questions related to Church-Rosser Thue systems.

Colm Ó'Dúnlaing

Theor. Comput. Sci., 1983

Infinite Regular Thue Systems.

Colm Ó'Dúnlaing

Theor. Comput. Sci., 1983

Retraction: A New Approach to Motion-Planning (Extended Abstract)

Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982

Generic Transformation of Data Structures

Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

Testing for the Church-Rosser Property.

Ronald V. Book, Colm Ó'Dúnlaing

Theor. Comput. Sci., 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

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Finite and infinite regular thue systems.

Colm Ó'Dúnlaing

PhD thesis, 1981