Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Laing, Ambrose Kofi - Department of Computer Science, Tufts University
Playing Push vs Pull: Models and Algorithms for Disseminating Dynamic Data in Networks
Playing Push vs Pull: Models and Algorithms for Disseminating Dynamic Data in Networks.
A Space Lower Bound for Name-Independent Compact Routing in Trees
Brief Announcement: A Space Lower Bound for Name-Independent Compact Routing in Trees
Brief Announcement: Name-Independent Compact Routing in Trees
Compact Routing with Name Independence joint work with
Name-Independent Compact Routing in Trees Kofi A. Laing a,,1
Optimal Permutation Routing for Low-dimensional Hypercubes Ambrose K. Laing and David W. Krumme
Brief Announcement: A Space Lower Bound for Name-Independent Compact Routing in Trees
Compact Roundtrip Routing with Topology-Independent Marta Arias
Brief Announcement: Name-Independent Compact Routing in Trees
Compact Roundtrip Routing with Topology-Independent Node Names
Compact Routing With Name Independence Marta Arias
A Space Lower Bound Name-Independent Compact Routing in Trees
Compact Routing With Name Independence Marta Arias
