Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
High performance communications in processor networks
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Introduction to algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The chaos router: a practical application of randomization in network routing
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Adaptive, minimal routing in hypercubes
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Greedy packet scheduling on shortest paths (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Efficient deadlock-free routing
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Theory and algorithms for plan merging
Artificial Intelligence
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
Storage-Efficient, Deadlock-Free Packet Routing Algorithms for Torus Networks
IEEE Transactions on Computers
Requirements for Deadlock-Free, Adaptive PacketRouting
SIAM Journal on Computing
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences
SIAM Journal on Computing
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for the shortest common supersequence
Nordic Journal of Computing
Cubesort: An Optimal Sorting Algorithm for Feasible Parallel Computers
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Minimal, deadlock-free routing in hypercubic and arbitrary networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
| Hi-index | 0.00 |