An Equivalence Theorem for Labeled Marked Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Brief announcement: full reversal routing as a linear dynamical system
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Full reversal routing as a linear dynamical system
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Scheduling links for heavy traffic on interfering routes in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Transience bounds for distributed algorithms
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |