Colm Ó Dúnlaing - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2015

An almost-confluent congruential language which is not Church-Rosser congruentialColm Ó Dúnlaing. TCS, 589:141-146, 2015. [doi]

2009

A Simple Criterion for Nodal 3-connectivity in Planar GraphsColm Ó Dúnlaing. ENTCS, 225:245-253, 2009. [doi]

2007

Optimal Voronoi Diagram Construction with n Convex Sites in Three DimensionsPaul Harrington, Colm Ó Dúnlaing, Chee-Keng Yap. ijcga, 17(6):555-593, 2007. [doi]

2002

Inorder traversal of splay treesColm Ó Dúnlaing. ENTCS, 74:134-157, 2002. [doi]

2000

The complexity of scheduling TV commercialsKlemens Hägele, Colm Ó Dúnlaing, Søren Riis. ENTCS, 40:162-185, 2000. [doi]

Homeomorphism of 2-Complexes is Equivalent to Graph IsomorphismColm Ó Dúnlaing, Colum Watt, David Wilkins. ijcga, 10(5):453-476, 2000.

1996

A Nearly Optimal Deterministic Parallel Voroni Diagram AlgorithmRichard Cole, Michael T. Goodrich, Colm Ó Dúnlaing. algorithmica, 16(6):569-617, 1996.

Resolution Proofs viewed as AutomataColm Ó Dúnlaing. eatcs, 59, 1996.

1993

Constructing the Voronoi Diagram of a Set of Line Segments in ParallelMichael T. Goodrich, Colm Ó Dúnlaing, Chee-Keng Yap. algorithmica, 9(2):128-141, 1993.

1991

On the Construction of Abstract Voronoi DiagramsKurt Mehlhorn, Stefan Meiser, Colm Ó Dúnlaing. dcg, 6:211-224, 1991.

It is undecidable whether a finite special string-rewriting system presents a groupPaliath Narendran, Colm Ó Dúnlaing, Friedrich Otto. DM, 98(2):153-159, 1991. [doi]

1990

Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version)Richard Cole, Michael T. Goodrich, Colm Ó Dúnlaing. icalp 1990: 432-445

On the Construction of Abstract Voronoi DiagramsKurt Mehlhorn, Stefan Meiser, Colm Ó Dúnlaing. STACS 1990: 227-239

1989

Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version)Michael T. Goodrich, Colm Ó Dúnlaing, Chee-Keng Yap. wads 1989: 12-23

Cancellativity in Finitely Presented SemigroupsPaliath Narendran, Colm Ó Dúnlaing. JSC, 7(5):457-472, 1989.

1988

Parallel Computational GeometryAlok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó Dúnlaing, Chee-Keng Yap. algorithmica, 3:293-327, 1988.

A Tight Lower Bound for the Complexity of Path-Planning for a DiscColm Ó Dúnlaing. ipl, 28(4):165-170, 1988.

1987

Motion Planning with Inertial ConstraintsColm Ó Dúnlaing. algorithmica, 2:431-475, 1987.

Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the DiagramColm Ó Dúnlaing, Micha Sharir, Chee-Keng Yap. algorithmica, 2:27-59, 1987.

1985

Parallel Computational Geometry (Extended Abstract)Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó Dúnlaing, Chee-Keng Yap. focs 1985: 468-477

Complexity of Certain Decision Problems about Congruential LanguagesPaliath Narendran, Colm Ó Dúnlaing, Heinrich Rolletschek. jcss, 30(3):343-358, 1985.

A Retraction Method for Planning the Motion of a DiscColm Ó Dúnlaing, Chee-Keng Yap. jal, 6(1):104-111, 1985.

1984

Counting digraphs and hypergraphsColm Ó Dúnlaing, Chee-Keng Yap. eatcs, 24:85-87, 1984.

1983

Infinite Regular Thue SystemsColm Ó Dúnlaing. TCS, 25:171-192, 1983.

Retraction: A New Approach to Motion-Planning (Extended Abstract)Colm Ó Dúnlaing, Micha Sharir, Chee-Keng Yap. stoc 1983: 207-220

1982

Generic Transformation of Data StructuresColm Ó Dúnlaing, Chee-Keng Yap. focs 1982: 186-195

1981

Testing for the Church-Rosser PropertyRonald V. Book, Colm Ó Dúnlaing. TCS, 16:223-229, 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. mfcs 1981: 216-223

Finite and infinite regular thue systemsColm Ó Dúnlaing. PhD thesis, University Santa Barbara, 1981.

Sign in or sign up to see more results.

runs on WebDSL