default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColm Ó'Dúnlaing
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i6]Colm Ó'Dúnlaing:
A coefficient related to splay-to-root traversal, correct to thousands of decimal places. CoRR abs/2108.05666 (2021)
2010 – 2019
- 2015
- [j20]Colm Ó'Dúnlaing:
An almost-confluent congruential language which is not Church-Rosser congruential. Theor. Comput. Sci. 589: 141-146 (2015) - 2014
- [i5]Colm Ó'Dúnlaing:
An ACCL which is not a CRCL. CoRR abs/1411.5853 (2014) - 2013
- [i4]Colm Ó'Dúnlaing:
Compact families of Jordan curves and convex hulls in three dimensions. CoRR abs/1311.6331 (2013) - 2012
- [i3]Colm Ó'Dúnlaing:
CUDA implementation of Wagener's 2D convex hull PRAM algorithm. CoRR abs/1203.5004 (2012) - 2010
- [j19]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): 677-690 (2010)
2000 – 2009
- 2007
- [j18]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): 555-593 (2007) - [i2]Colm Ó'Dúnlaing:
Nodally 3-connected planar graphs and convex combination mappings. CoRR abs/0708.0964 (2007) - [i1]Colm Ó'Dúnlaing, Natalie Schluter:
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language. CoRR abs/0710.4499 (2007) - 2006
- [c10]Colm Ó'Dúnlaing:
A Simple Criterion for Nodal 3-connectivity in Planar Graphs. MFCSIT 2006: 245-253 - 2002
- [c9]Colm Ó'Dúnlaing:
Inorder traversal of splay trees. MFCSIT 2002: 134-157 - 2000
- [j17]Colm Ó'Dúnlaing, Colum Watt, David Wilkins:
Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism. Int. J. Comput. Geom. Appl. 10(5): 453-476 (2000) - [c8]Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
:
The complexity of scheduling TV commercials. MFCSIT 2000: 162-185
1990 – 1999
- 1996
- [j16]Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. Algorithmica 16(6): 569-617 (1996) - [j15]Colm Ó'Dúnlaing:
Resolution Proofs viewed as Automata. Bull. EATCS 59 (1996) - 1993
- [j14]Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. Algorithmica 9(2): 128-141 (1993) - 1991
- [j13]Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams. Discret. Comput. Geom. 6: 211-224 (1991) - [j12]Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto:
It is undecidable whether a finite special string-rewriting system presents a group. Discret. Math. 98(2): 153-159 (1991) - 1990
- [c7]Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing:
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). ICALP 1990: 432-445 - [c6]Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams. STACS 1990: 227-239
1980 – 1989
- 1989
- [j11]Paliath Narendran, Colm Ó'Dúnlaing:
Cancellativity in Finitely Presented Semigroups. J. Symb. Comput. 7(5): 457-472 (1989) - [c5]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: 12-23 - 1988
- [j10]Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry. Algorithmica 3: 293-327 (1988) - [j9]Colm Ó'Dúnlaing:
A Tight Lower Bound for the Complexity of Path-Planning for a Disc. Inf. Process. Lett. 28(4): 165-170 (1988) - 1987
- [j8]Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap:
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica 2: 27-59 (1987) - [j7]Colm Ó'Dúnlaing:
Motion Planning with Inertial Constraints. Algorithmica 2: 431-475 (1987) - 1985
- [j6]Colm Ó'Dúnlaing, Chee-Keng Yap:
A "Retraction" Method for Planning the Motion of a Disc. J. Algorithms 6(1): 104-111 (1985) - [j5]Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek:
Complexity of Certain Decision Problems about Congruential Languages. J. Comput. Syst. Sci. 30(3): 343-358 (1985) - [c4]Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap:
Parallel Computational Geometry (Extended Abstract). FOCS 1985: 468-477 - 1984
- [j4]Colm Ó'Dúnlaing, Chee-Keng Yap:
Counting digraphs and hypergraphs. Bull. EATCS 24: 85-87 (1984) - 1983
- [j3]Colm Ó'Dúnlaing:
Undecidable questions related to Church-Rosser Thue systems. Theor. Comput. Sci. 23: 339-345 (1983) - [j2]Colm Ó'Dúnlaing:
Infinite Regular Thue Systems. Theor. Comput. Sci. 25: 171-192 (1983) - [c3]Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap:
Retraction: A New Approach to Motion-Planning (Extended Abstract). STOC 1983: 207-220 - 1982
- [c2]Colm Ó'Dúnlaing, Chee-Keng Yap:
Generic Transformation of Data Structures. FOCS 1982: 186-195 - 1981
- [b1]Colm Ó'Dúnlaing:
Finite and infinite regular thue systems. University of California, Santa Barbara, CA, USA, 1981, pp. 1-149 - [j1]Ronald V. Book, Colm Ó'Dúnlaing:
Testing for the Church-Rosser Property. Theor. Comput. Sci. 16: 223-229 (1981) - [c1]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: 216-223
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-29 22:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
