Kofi A. Laing
List of publications from the
| 2008 |
|---|
| 12 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing:
Compact roundtrip routing with topology-independent node names.
J. Comput. Syst. Sci. 74(5): 775-795 (2008) |
| 2007 |
|---|
| 11 | EE | Kofi A. Laing:
Name-independent compact routing in trees.
Inf. Process. Lett. 103(2): 57-60 (2007) |
| 10 | EE | Kofi A. Laing,
Rajmohan Rajaraman:
A Space Lower Bound for Name-Independent Compact Routing in Trees.
Journal of Interconnection Networks 8(3): 229-251 (2007) |
| 2006 |
|---|
| 9 | EE | R. C. Chakinala,
Abishek Kumarasubramanian,
Kofi A. Laing,
R. Manokaran,
C. Pandu Rangan,
Rajmohan Rajaraman:
Playing push vs pull: models and algorithms for disseminating dynamic data in networks.
SPAA 2006: 244-253 |
| 8 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing,
Rajmohan Rajaraman,
Orjeta Taka:
Compact Routing with Name Independence.
SIAM J. Discrete Math. 20(3): 705-726 (2006) |
| 2005 |
|---|
| 7 | EE | Kofi A. Laing,
Rajmohan Rajaraman:
A space lower bound for name-independent compact routing in trees.
SPAA 2005: 216 |
| 2004 |
|---|
| 6 | EE | Kofi A. Laing:
Brief announcement: name-independent compact routing in trees.
PODC 2004: 382 |
| 2003 |
|---|
| 5 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing:
Compact roundtrip routing with topology-independent node names.
PODC 2003: 43-52 |
| 4 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing,
Rajmohan Rajaraman,
Orjeta Taka:
Compact routing with name independence.
SPAA 2003: 184-192 |
| 2000 |
|---|
| 3 | EE | Ambrose Kofi Laing,
Robert Cypher,
Christian A. Duncan:
On the Flattest Common Supersequence Method for Deadlock-Free Routing in Arbitrary Networks.
Theory Comput. Syst. 33(5/6): 393-426 (2000) |
| 1998 |
|---|
| 2 | EE | Ambrose Kofi Laing,
Robert Cypher:
Deadlock-Free Routing in Arbitrary Networks via the Flattest Common Supersequence Method.
SPAA 1998: 55-66 |
| 1997 |
|---|
| 1 | EE | Robert Cypher,
Ambrose Kofi Laing:
Gracefully Degradable Pipeline Networks.
IPPS 1997: 55-64 |
