Colm Ó'Dúnlaing

Publication Activity (10 Years)

Years Active: 1981-2010
Publications (10 Years): 0

University of California, Santa Barbara, CA, USA (PHD)

Education History

University of California, Santa Barbara, CA, USA

PHD

Publications

Colm Ó'Dúnlaing, Natalie Schluter
A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems. Theor. Comput. Sci. 411 (3) (2010)
Colm Ó'Dúnlaing
A Simple Criterion for Nodal 3-connectivity in Planar Graphs. Electron. Notes Theor. Comput. Sci. 225 (2009)
Colm Ó'Dúnlaing, Natalie Schluter
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language CoRR (2007)
Paul Harrington, Colm Ó'Dúnlaing, Chee-Keng Yap
Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions. Int. J. Comput. Geom. Appl. 17 (6) (2007)
Colm Ó'Dúnlaing
Nodally 3-connected planar graphs and convex combination mappings CoRR (2007)
Colm Ó'Dúnlaing
Inorder traversal of splay trees. Electron. Notes Theor. Comput. Sci. 74 (2002)
Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
The complexity of scheduling TV commercials. Electron. Notes Theor. Comput. Sci. 40 (2000)
Colm Ó'Dúnlaing, Colum Watt, David Wilkins
Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism. Int. J. Comput. Geom. Appl. 10 (5) (2000)
Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica 16 (6) (1996)
Colm Ó'Dúnlaing
Resolution Proofs viewed as Automata. Bull. EATCS 59 (1996)
Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9 (2) (1993)
Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
It is undecidable whether a finite special string-rewriting system presents a group. Discret. Math. 98 (2) (1991)
Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
On the Construction of Abstract Voronoi Diagrams. Discret. Comput. Geom. 6 (1991)
Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
On the Construction of Abstract Voronoi Diagrams. STACS (1990)
Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP (1990)
Paliath Narendran, Colm Ó'Dúnlaing
Cancellativity in Finitely Presented Semigroups. J. Symb. Comput. 7 (5) (1989)
Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). WADS (1989)
Colm Ó'Dúnlaing
A Tight Lower Bound for the Complexity of Path-Planning for a Disc. Inf. Process. Lett. 28 (4) (1988)
Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
Parallel Computational Geometry. Algorithmica 3 (1988)
Colm Ó'Dúnlaing
Motion Planning with Inertial Constraints. Algorithmica 2 (1987)
Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica 2 (1987)
Colm Ó'Dúnlaing, Chee-Keng Yap
A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms 6 (1) (1985)
Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
Parallel Computational Geometry (Extended Abstract) FOCS (1985)
Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek
Complexity of Certain Decision Problems about Congruential Languages. J. Comput. Syst. Sci. 30 (3) (1985)
Colm Ó'Dúnlaing, Chee-Keng Yap
Counting digraphs and hypergraphs. Bull. EATCS 24 (1984)
Colm Ó'Dúnlaing
Infinite Regular Thue Systems. Theor. Comput. Sci. 25 (1983)
Colm Ó'Dúnlaing
Undecidable questions related to Church-Rosser Thue systems. Theor. Comput. Sci. 23 (1983)
Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
Retraction: A New Approach to Motion-Planning (Extended Abstract) STOC (1983)
Colm Ó'Dúnlaing, Chee-Keng Yap
Generic Transformation of Data Structures FOCS (1982)
Ronald V. Book, Colm Ó'Dúnlaing
Testing for the Church-Rosser Property. Theor. Comput. Sci. 16 (1981)
Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). MFCS (1981)

Colm Ó'Dúnlaing.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Colm Ó'Dúnlaing