An experimental study of sorting and branch prediction. - Paul Biggar; Nicholas Nash; Kevin Williams 001; David Gregg (ACM J. Exp. Algorithmics, 2008)

Efficiently implementing maximum independent set algorithms on circle graphs. - Nicholas Nash; Sylvain Lelait; David Gregg (ACM J. Exp. Algorithmics, 2008)

An output sensitive algorithm for computing a maximum independent set of a circle graph. - Nicholas Nash; David Gregg (Inf. Process. Lett., 2010)

Comparing integer data structures for 32- and 64-bit keys. - Nicholas Nash; David Gregg (ACM J. Exp. Algorithmics, 2010)

Practical and architectural aspects of sorting and searching - Nicholas Nash (2010)

Practical Algorithms for Finding Extremal Sets. - Martin Marinov; Nicholas Nash; David Gregg (ACM J. Exp. Algorithmics, 2016)