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

- Compact Routing with Name-Independence, by Marta Arias, Lenore J. Cowen, Kofi A. Laing, Rajmohan Rajaraman, and Orjeta Taka. SIAM Journal on Discrete Mathematics, Volume 20 Issue 3, pages 705--726 (2006). Online at SIAM. Conference Paper in Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2003). Pages 184-192. San Diego, California. SPAA'03 Talk (PDF).
- Playing Push vs Pull: Models and Algorithms for Disseminating Dynamic Data in Networks, by R.C. Chakinala, A. Kumarasubramanian, K.A. Laing, R. Manokaran, C. Pandu Rangan and R. Rajaraman. Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2006), pages 244-253. Cambridge, Massachusetts. SPAA'06 Talk (PDF)
- A Space Lower Bound for Name-Independent Compact Routing in Trees, by Kofi A. Laing and Rajmohan Rajaraman. Journal of Interconnection Networks (JOIN). Volume 8, No 3, 2007, pages 229 -- 251. Conference Brief Announcement in Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), page 216. Las Vegas, Nevada. SPAA'05 Talk (PDF) DM'06 Talk (PDF)
- Name Independent Compact Routing in Trees, by Kofi A. Laing. Information Processing Letters. Volume 103 (2007) pages 57 to 60. Online IPL Version. Conference Brief Announcement in Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC 2004). Page 382. St. Johns, Newfoundland. PODC'04 Talk (PDF). Technical Report.
- Compact Roundtrip Routing with Topology-Independent Node Names, by Marta Arias, Lenore J. Cowen and Kofi A. Laing. Journal of Computing and System Sciences. Volume 74(5), Aug 2008, pages 775 -- 795. Conference Paper in Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2003). Pages 43-52. Boston, Massachusetts.
- Optimal Permutation Routing for Low-Dimensional Hypercubes, by Ambrose K. Laing and David W. Krumme. Technical Report
- On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks, by Ambrose Laing, Robert Cypher, and Christian Duncan, Theory of Computer Science, Volume 33, pages 393-426 (2000). Conference Paper by Ambrose Laing and Robert Cypher, Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'98), pages 55-66, Puerto-Vallarta, Mexico.
- Gracefully Degradable Pipeline Networks, by Robert Cypher and Ambrose Laing. Proceedings of the 11th International Parallel Processing Symposium (IPPS'97). Pages 55-64. Geneva, Switzerland.

- Ning Wu (co-advised with Prof. Couch): Wireless Multicast Energy Optimization Problems
- Weichen Wu: An experimental study of approximation algorithms for shortest weight-constrained paths problems in weighted graphs.
- Ryan Culbertson: A file synchronization program for multiple repositories.

- COMP150-PC: Parallel Computing [Leighton, Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes]
- COMP150-PC: Parallel Computing [Wilkinson and Allen, Parallel Programming (using 1st Edition)]
- COMP150-PC: Parallel Computing [Michael Quinn book on Parallel Programming with C and MPI]
- COMP150-DS: Distributed Systems [Tanenbaum and Steen, Distributed Systems: Principles and Paradigms]
- COMP150-DSM: Distributed and Mobile Systems [Coulouris, Dollimore and Kindberg on Distributed Systems]
- COMP 11: Introduction to Computer Science [J. Salvage, C++ Coach: Essentials for Introductory Programming]
- COMP 15: Data Structures [L. Nyhoff, C++: An Introduction to Data Structures]
- COMP 40: Sparc Architecture [R.P. Paul, SPARC Architecture, Assembly Language Programming, and C]
- COMP170: Introduction to the Theory of Computation [M. Sipser, Introduction to the Theory of Computation]

- Computer System Architecture [Hennessy and Patterson, Computer Architecture: A Quantitative Approach]

- QuizMixer is a tool for mixing up question orders and answer orders in multiple choice quizzes, for use with latex.
- figed is a tool for batch editing of .fig files. It performs simple search and replace functions based on object attributes, noninteractively.
- bflap is for batch grading of finite automata created with the JFLAP program.
- kflap is for batch grading of Turing Machines created with the JFLAP program.
- pushpulltree is an algorithmic experiment for the Tree-based Multicast Push Pull algorithms described in the Push Pull paper above.
- Hypercube Permutation Factoring Factors permutations as described in the paper "Optimal Permutation Routing in Low-Dimensional Hypercubes".

- Ph.D., May 1999.

Dissertation Title: Techniques for Communication in Faulty and Irregular Interconnection Networks

Advisor: Robert Cypher

Computer Science Department

The Johns Hopkins University - MSE., May 1994

Computer Science Department

The Johns Hopkins University - BSc. Computer Science and Mathematics, July 1991

University of Ghana, Legon

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