Colm Ó'Dúnlaing

Trinity College Dublin — Ireland

Computer Science · Physical Sciences

14h-index1.4kcitations34works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Computational Geometry and Mesh Generation(14), Data Management and Algorithms(12), semigroups and automata theory(12), Logic, programming, and type systems(9), Computability, Logic, AI Algorithms(9)

Publications34 total

A shorter proof that palindromes are not a Church–Rosser language, with extensions to almost-confluent and preperfect Thue systems
Theoretical Computer Science·2009· 2 cited
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
arXiv (Cornell University)·2007Open Access
Nodally 3-connected planar graphs and convex combination mappings
arXiv (Cornell University)·2007· 2 citedOpen Access
Merging free trees in parallel for efficient Voronoi diagram construction
1996
Resolution Proofs viewed as Automata.
Bulletin of the European Association for Theoretical Computer Science·1996
It is undecidable whether a finite special string-rewriting system presents a group
Discrete Mathematics·1991· 10 cited
On the construction of abstract voronoi diagrams
Discrete & Computational Geometry·1991· 72 citedOpen Access
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version)
International Colloquium on Automata, Languages and Programming·1990· 1 cited
On the construction of abstract voronoi diagrams
Lecture notes in computer science·1990· 9 cited
Cancellativity in finitely presented semigroups
Journal of Symbolic Computation·1989· 9 cited
Constructing the Voronoi diagram of a set of line segments in parallel
Lecture notes in computer science·1989· 10 cited
On the construction of abstract Voronoi diagrams
1989· 13 citedOpen Access
Parallel computational geometry
Algorithmica·1988· 216 cited
A tight lower bound for the complexity of path-planning for a disc
Information Processing Letters·1988· 6 cited
Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram
Algorithmica·1987· 52 cited
Motion planning with inertial constraints
Algorithmica·1987· 92 cited
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
Communications on Pure and Applied Mathematics·1986· 55 cited
Notes on the AKS sorting network, as improved by Paterson
1986
Complexity of certain decision problems about congruential languages
Journal of Computer and System Sciences·1985· 21 cited
A “retraction” method for planning the motion of a disc
Journal of Algorithms·1985· 408 cited
page 1 of 2Next →

Frequent Co-authors

Chee Yap(10), Micha Sharir(4), Alok Aggarwal(3), Bernard Chazelle(3), Kurt Mehlhorn(3), Paliath Narendran(3), Michael T. Goodrich(3), Chee-Keng Yap(3), Richard Cole(3), Leonidas Guibas(2), St. Meiser(2), Natalie Schluter(2), Leo J. Guibas(1), Ronald V. Book(1), Heinrich Rolletschek(1), Robert T. Book(1), Matthias Jantzen(1), Burkhard Monien(1), Celia Wrathall(1), Stefan Meiser(1)