Fast algorithms for finding nearest common ancestors
SIAM Journal on Computing
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
The generalized packet routing problem
Theoretical Computer Science
The token distribution problem
SIAM Journal on Computing
A 2n-2 step algorithm for routing in an nxn array with constant size queues
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Bounded ordered dictionaries in O(loglogN) time and O(n) space
Information Processing Letters
A unified approach to off-line permutation routing on parallel networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Matching the bisection bound for routing and sorting on the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast deflection routing for packets and worms
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Routing Permutations on Graphs Via Matchings
SIAM Journal on Discrete Mathematics
Information Processing Letters
IEEE Transactions on Computers
On-line routing of real-time messages
Journal of Parallel and Distributed Computing
Constant time per edge is optimal on rooted tree networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Optimal bounds for matching routing on trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Hot-potato routing on processor arrays
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Routing on Trees via Matchings
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Dynamic Tree Routing under the ``Matching with Consumption'' Model
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Many-to-One Packed Routing via Matchings
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Greedy Hot-Potato Routing on the Mesh
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Õ(congestion + dilation) hot-potato routing on leveled networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
CIPS: coordinated intrusion prevention system
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Efficient bufferless routing on leveled networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |