Gracefully Degradable Pipeline Networks. - Robert Cypher; Ambrose Kofi Laing (IPPS, 1997)

Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method. - Ambrose Kofi Laing; Robert Cypher (SPAA, 1998)

On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks. - Ambrose Kofi Laing; Robert Cypher; Christian A. Duncan (Theory Comput. Syst., 2000)

Brief announcement: name-independent compact routing in trees. - Kofi A. Laing (PODC, 2004)

Playing push vs pull: models and algorithms for disseminating dynamic data in networks. - R. C. Chakinala; Abishek Kumarasubramanian; Kofi A. Laing; R. Manokaran; C. Pandu Rangan; Rajmohan Rajaraman (SPAA, 2006)

Compact Routing with Name Independence. - Marta Arias; Lenore Cowen; Kofi A. Laing; Rajmohan Rajaraman; Orjeta Taka (SIAM J. Discret. Math., 2006)

Name-independent compact routing in trees. - Kofi A. Laing (Inf. Process. Lett., 2007)

A Space Lower Bound for Name-Independent Compact Routing in Trees. - Kofi A. Laing; Rajmohan Rajaraman (J. Interconnect. Networks, 2007)

Compact roundtrip routing with topology-independent node names. - Marta Arias; Lenore Cowen; Kofi A. Laing (J. Comput. Syst. Sci., 2008)

Optimal permutation routing for low-dimensional hypercubes. - Ambrose Kofi Laing; David W. Krumme (Networks, 2010)