Ambrose Kofi Laing

According to our database, Ambrose Kofi Laing authored at least 10 papers between 1997 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Optimal permutation routing for low-dimensional hypercubes.

Ambrose Kofi Laing, David W. Krumme

Networks, 2010

2008

Compact roundtrip routing with topology-independent node names.

Marta Arias, Lenore Cowen, Kofi A. Laing

J. Comput. Syst. Sci., 2008

2007

A Space Lower Bound for Name-Independent Compact Routing in Trees.

Kofi A. Laing, Rajmohan Rajaraman

J. Interconnect. Networks, 2007

Name-independent compact routing in trees.

Kofi A. Laing

Inf. Process. Lett., 2007

2006

Compact Routing with Name Independence.

Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka

SIAM J. Discret. Math., 2006

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

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

2004

Brief announcement: name-independent compact routing in trees.

Kofi A. Laing

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2000

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

1998

Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method.

Ambrose Kofi Laing, Robert Cypher

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997

Gracefully Degradable Pipeline Networks.

Robert Cypher, Ambrose Kofi Laing

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997