1 citations · 1 across the 5 of their papers we have counts for
5 papers
A coefficient related to splay-to-root traversal, correct to thousands of decimal places
Colm Ó Dúnlaing
This paper takes another look at the cost of traversing a binary tree using repeated splay-to-root. This was shown to cost (in rotations) by Tarjan and later, in different w…
An ACCL which is not a CRCL
Colm Ó Dúnlaing
It is fairly easy to show that every regular set is an almost-confluent congruential language (ACCL), and it is known that every regular set is a Church-Rosser congruential languag…
Compact families of Jordan curves and convex hulls in three dimensions
Colm Ó Dúnlaing
We prove that for certain families of semi-algebraic convex bodies in 3 dimensions, the convex hull of disjoint bodies has features, where is a constant depend…
CUDA implementation of Wagener's 2D convex hull PRAM algorithm
Colm O. Dunlaing
This paper describes a CUDA implementation of Wagener's PRAM convex hull algorithm in two dimensions. It is presented in Knuth's literate programming style.
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
Colm O. Dunlaing, Natalie Schluter
In 2002 Jurdzinski and Lorys settled a long-standing conjecture that palindromes are not a Church-Rosser language. Their proof required a sophisticated theory about computation gra…