The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Colm Ó'Dúnlaing: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Colm Ó'Dúnlaing, Chee-Keng Yap
    Generic Transformation of Data Structures [Citation Graph (2, 0)][DBLP]
    FOCS, 1982, pp:186-195 [Conf]
  2. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
    Parallel Computational Geometry (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1985, pp:468-477 [Conf]
  3. Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
    Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:432-445 [Conf]
  4. Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó'Dúnlaing, Celia Wrathall
    On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:216-223 [Conf]
  5. Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
    On the Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:227-239 [Conf]
  6. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Retraction: A New Approach to Motion-Planning (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:207-220 [Conf]
  7. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
    Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:12-23 [Conf]
  8. Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
    Parallel Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:293-327 [Journal]
  9. Richard Cole, Michael T. Goodrich, Colm Ó'Dúnlaing
    A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:6, pp:569-617 [Journal]
  10. Michael T. Goodrich, Colm Ó'Dúnlaing, Chee-Keng Yap
    Constructing the Voronoi Diagram of a Set of Line Segments in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:2, pp:128-141 [Journal]
  11. Colm Ó'Dúnlaing
    Motion Planning with Inertial Constraints. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:431-475 [Journal]
  12. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:27-59 [Journal]
  13. Kurt Mehlhorn, Stefan Meiser, Colm Ó'Dúnlaing
    On the Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:211-224 [Journal]
  14. Colm Ó'Dúnlaing
    Resolution Proofs viewed as Automata. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1996, v:59, n:, pp:- [Journal]
  15. Colm Ó'Dúnlaing, Chee-Keng Yap
    Counting digraphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:24, n:, pp:85-87 [Journal]
  16. Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis
    The complexity of scheduling TV commercials. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:40, n:, pp:- [Journal]
  17. Colm Ó'Dúnlaing
    Inorder traversal of splay trees. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:74, n:, pp:- [Journal]
  18. Colm Ó'Dúnlaing, Colum Watt, David Wilkins
    Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:453-476 [Journal]
  19. Colm Ó'Dúnlaing
    A Tight Lower Bound for the Complexity of Path-Planning for a Disc. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:4, pp:165-170 [Journal]
  20. Colm Ó'Dúnlaing, Chee-Keng Yap
    A "Retraction" Method for Planning the Motion of a Disc. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:104-111 [Journal]
  21. Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek
    Complexity of Certain Decision Problems about Congruential Languages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:3, pp:343-358 [Journal]
  22. Paliath Narendran, Colm Ó'Dúnlaing
    Cancellativity in Finitely Presented Semigroups. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:5, pp:457-472 [Journal]
  23. Ronald V. Book, Colm Ó'Dúnlaing
    Testing for the Church-Rosser Property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:223-229 [Journal]
  24. Colm Ó'Dúnlaing
    Infinite Regular Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:25, n:, pp:171-192 [Journal]
  25. Colm Ó'Dúnlaing
    Nodally 3-connected planar graphs and convex combination mappings [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  26. Colm O. Dunlaing, Natalie Schluter
    Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  27. Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto
    It is undecidable whether a finite special string-rewriting system presents a group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:2, pp:153-159 [Journal]

  28. A Simple Criterion for Nodal 3-connectivity in Planar Graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.323secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002