Colm Ó'Dúnlaing

37 papers A* 4A 1B 2Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2021 J jnl
A coefficient related to splay-to-root traversal, correct to thousands of decimal places.
CoRR
Colm Ó'Dúnlaing
2015 J jnl
An almost-confluent congruential language which is not Church-Rosser congruential.
Theor. Comput. Sci.
Colm Ó'Dúnlaing
2014 J jnl
An ACCL which is not a CRCL.
CoRR
Colm Ó'Dúnlaing
2013 J jnl
Compact families of Jordan curves and convex hulls in three dimensions.
CoRR
Colm Ó'Dúnlaing
2012 J jnl
CUDA implementation of Wagener's 2D convex hull PRAM algorithm
CoRR
Colm Ó'Dúnlaing
2010 J jnl
A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems.
Theor. Comput. Sci.
Colm Ó'Dúnlaing, Natalie Schluter
2007 J jnl
Nodally 3-connected planar graphs and convex combination mappings
CoRR
Colm Ó'Dúnlaing
2007 J jnl
Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions.
Int. J. Comput. Geom. Appl.
Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap
2007 J jnl
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
CoRR
Colm Ó'Dúnlaing, Natalie Schluter
2006 — conf
A Simple Criterion for Nodal 3-connectivity in Planar Graphs.
MFCSIT
Colm Ó'Dúnlaing
2002 — conf
Inorder traversal of splay trees.
MFCSIT
Colm Ó'Dúnlaing
2000 J jnl
Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism.
Int. J. Comput. Geom. Appl.
Colm Ó'Dúnlaing, Colum Watt, David Wilkins
2000 — conf
The complexity of scheduling TV commercials.
MFCSIT
Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
1996 J jnl
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm.
Algorithmica
Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
1996 J jnl
Resolution Proofs viewed as Automata.
Bull. EATCS
Colm Ó'Dúnlaing
1993 J jnl
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.
Algorithmica
Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
1991 J jnl
It is undecidable whether a finite special string-rewriting system presents a group.
Discret. Math.
Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
1991 J jnl
On the Construction of Abstract Voronoi Diagrams.
Discret. Comput. Geom.
Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
1990 A* conf
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).
ICALP
Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
1990 A conf
On the Construction of Abstract Voronoi Diagrams.
STACS
Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
1989 J jnl
Cancellativity in Finitely Presented Semigroups.
J. Symb. Comput.
Paliath Narendran, Colm Ó'Dúnlaing
1989 B conf
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).
WADS
Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
1988 J jnl
A Tight Lower Bound for the Complexity of Path-Planning for a Disc.
Inf. Process. Lett.
Colm Ó'Dúnlaing
1988 J jnl
Parallel Computational Geometry.
Algorithmica
Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
1987 J jnl
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.
Algorithmica
Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
1987 J jnl
Motion Planning with Inertial Constraints.
Algorithmica
Colm Ó'Dúnlaing
1985 J jnl
A "Retraction" Method for Planning the Motion of a Disc.
J. Algorithms
Colm Ó'Dúnlaing, Chee-Keng Yap
1985 J jnl
Complexity of Certain Decision Problems about Congruential Languages.
J. Comput. Syst. Sci.
Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek
1985 A* conf
Parallel Computational Geometry (Extended Abstract)
FOCS
Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
1984 J jnl
Counting digraphs and hypergraphs.
Bull. EATCS
Colm Ó'Dúnlaing, Chee-Keng Yap
1983 J jnl
Infinite Regular Thue Systems.
Theor. Comput. Sci.
Colm Ó'Dúnlaing
1983 A* conf
Retraction: A New Approach to Motion-Planning (Extended Abstract)
STOC
Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
1983 J jnl
Undecidable questions related to Church-Rosser Thue systems.
Theor. Comput. Sci.
Colm Ó'Dúnlaing
1982 A* conf
Generic Transformation of Data Structures
FOCS
Colm Ó'Dúnlaing, Chee-Keng Yap
1981 — —
Finite and infinite regular thue systems.
Colm Ó'Dúnlaing
1981 B conf
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).
MFCS
Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall
1981 J jnl
Testing for the Church-Rosser Property.
Theor. Comput. Sci.
Ronald V. Book, Colm Ó'Dúnlaing