Showing results 10 to 15 of 15
< previous
Title | Author(s) | Issue Date | Views | |
---|---|---|---|---|
On the Complexity of Some Adaptive Polling Algorithms in General Networks Journal:International Journal of Foundations of Computer Science | 1999 | 97 | ||
On the space requirement of interval routing Journal:IEEE Transactions on Computers | 1999 | 173 | ||
An Optimal Lower Bound for Interval Routing in General Networks Proceeding/Conference:Proceedings of the 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO'97), Ascona, Switzerland | 1997 | 69 | ||
Some Results on the Space Requirement of Interval Routing Proceeding/Conference:Proceedings of 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6) | 1999 | 85 | ||
Two lower bounds for multi-label interval routing Proceeding/Conference:Proceedings of the Computing: The Australasian Theory Symposium (CATS '97) | 1997 | 71 | ||
An upper bound result for multi-label interval routing on planar graphs Proceeding/Conference:9th International Colloquium on Structural Information and Communication Complexity (SIROCCO '02) | 2002 | 68 |