Ambrose Kofi Laing

Email: aklaing at gmail dot com

I am no longer with Tufts University -- You may contact me at the email address above.

Quick Links: * Research * Teaching * Tools * Education


My research interests include algorithms relating to communication and routing problems in Parallel, Distributed and Mobile Computing environments. In the Dynamic Data Distribution problem we design algorithms for constructing communication substructures in a network required for balancing push and pull activity so that global communication is minimized. In the Compact Routing Problem we seek tradeoffs between memory and stretch for compact routing with topology-independent node names (both in directed and undirected graphs). In the Hypercube Permutation Routing problem we minimize the number of communication steps for parallel-routing an arbitrary permutation in a hypercube. The Deadlock-Free Routing problem requires that we minimize the number of buffers required per node to ensure deadlock-freedom in arbitrary networks. In the Structural Graceful Degradation problem we design interconnection structures that exhibit structural properties of fault-tolerance and graceful-degradation for pipeline networks. These problems are presented more formally in the papers below.

Research Papers:

Talks (Presentation PDFs ):

Past Graduate Advisees


Spring 2007 semester: In the past I have taught the following [with the following books (in current or previous editions)]:
At Tufts University:
At The Johns Hopkins University:



Last Updated: Thu Dec 18 08:46:32 EST 2008