Efficient plane sweeping in parallel
SCG '86 Proceedings of the second annual symposium on Computational geometry
Continuous routing and batch routing on the hypercube
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Parallel symmetry-breaking in sparse graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Randomized parallel communications on an extension of the omega network
Journal of the ACM (JACM)
A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Hypercube message routing in the presence of faults
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
PRAM Processor Allocation: A Hidden Bottleneck in Sublogarithmic Algorithms
IEEE Transactions on Computers
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal on-line load balancing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A bridging model for parallel computation
Communications of the ACM
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
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast algorithms for bit-serial routing on a hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel construction of near optimal binary trees
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Time-Space Optimal Parallel Merging and Sorting
IEEE Transactions on Computers
Constructing arrangements optimally in parallel (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Chaos router: architecture and performance
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
A framework for adaptive routing in multicomputer networks
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
The chaos router: a practical application of randomization in network routing
ACM SIGARCH Computer Architecture News - 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 algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized algorithms and pseudorandom numbers
Journal of the ACM (JACM)
Minimal adaptive routing on the mesh with bounded queue size
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Computers
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Optimal parallel string algorithms: sorting, merging and computing the minimum
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
Potential function analysis of greedy hot-potato routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
Journal of the ACM (JACM)
IEEE Transactions on Parallel and Distributed Systems
All Nearest Smaller Values on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
On Bufferless Routing of Variable Length Messages in Leveled Networks
IEEE Transactions on Computers
On the benefit of supporting virtual channels in wormhole routers
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
How much can hardware help routing?
Journal of the ACM (JACM)
Edge Congestion of Shortest Path Systems for All-to-All Communication
IEEE Transactions on Parallel and Distributed Systems
An O( N ) oblivious routing algorithm for 2-D meshes of constant queue-size
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth 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
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Worst-case traffic for oblivious routing functions
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Some permutation routing algorithms for low-dimensional hypercubes
Theoretical Computer Science
Valved Routing: Efficient Flow Control for Adaptive Nonminimal Routing in Interconnection Networks
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Bounds on Maximum Delay in Networks with Deflection Routing
IEEE Transactions on Parallel and Distributed Systems
Hot-Potato Algorithms for Permutation Routing
IEEE Transactions on Parallel and Distributed Systems
Work-Time Optimal k-Merge Algorithms on the PRAM
IEEE Transactions on Parallel and Distributed Systems
Work-Time Optimal K-Merge Algorithms on the PRAM
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Oblivious Routing Algorithms on the Mesh of Buses
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Average-Case Communication-Optimal Parallel Parenthesis Matching
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
New Bounds for Oblivious Mesh Routing
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A polynomial-time tree decomposition to minimize congestion
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Throughput-centric routing algorithm design
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Partially effective randomization in simulations between arbitrary and common PRAMs
Journal of Parallel and Distributed Computing
Networks on which hot-potato routing does not livelock
Distributed Computing
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Bounds on evacuation time for deflection routing
Distributed Computing
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Communication-optimal parallel parenthesis matching
Parallel Computing
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Parallel merging with restriction
The Journal of Supercomputing
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
The complexity of parallel comparison merging
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
International Journal of Computers and Applications
A new bound for pure greedy hot potato routing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Merging data records on EREW PRAM
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Enriching introductory programming courses with non-intuitive probability experiments component
Proceedings of the 17th ACM annual conference on Innovation and technology in computer science education
Potential Function Analysis of Greedy Hot-Potato Routing
Theory of Computing Systems
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube
Theory of Computing Systems
| Hi-index | 0.03 |