Nash N, Gregg D. New Algorithms for Maximum Independent Sets of Circle Graphs
Submitted (pdf)

Nash N, Gregg D. An Output Sensitive Algorithm for Computing a Maximum Independent Set of a Circle Graph
Information Processing Letters 110(16): 630-634 (July 2010) (pdf)

Nash N, Gregg D. Comparing integer data structures for 32- and 64-bit keys. ACM Journal of Experimental Algorithmics (selected papers from WEA 2008), Volume 15, 2.4 (March 2010). 44 pages.

Nash N, Lelait S, Gregg D. Efficiently Implementing Maximum Independent Set Algorithms on Circle Graphs. ACM Journal of Experimental Algorithmics, Volume 13, 1.9 (February 2009). 34 pages.

Biggar P, Nash N, Williams K, Gregg D. An Experimental Study of Sorting and Branch PredictionACM Journal of Experimental Algorithmics, Volume 12, 1.8 (June 2008). 38 pages.

Nash N, Gregg D. Comparing Integer Data Structures for 32- and 64-bit Keys. In 7th International Workshop on Experimental Algorithms. Cape Cod, MA. LNCS 5038 pp28–42. Springer, 2008.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s