ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Graphs and Hypergraphs
Continuous routing and batch routing on the hypercube
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Parallel hashing—an efficient implementation of shared memory
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing disjoint paths on expander graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An optimal parallel dictionary
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A bridging model for parallel computation
Communications of the ACM
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
How to distribute a dictionary in a complete network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal VLSI Sorting with Reduced Number of Processors
IEEE Transactions on Computers
Fully-adaptive routing: packet switching performance and wormhole algorithms
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Randomized routing with shorter paths
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
An optical simulation of shared memory
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Performance of hypercube routing schemes with or without buffering
IEEE/ACM Transactions on Networking (TON)
Two Packet Routing Algorithms on a Mesh-Connected Computer
IEEE Transactions on Parallel and Distributed Systems
Deterministic on-line routing on area-universal networks
Journal of the ACM (JACM)
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomized Routing with Shorter Paths
IEEE Transactions on Parallel and Distributed Systems
A Theory of Wormhole Routing in Parallel Computers
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
The performance of simple routing algorithms that drop packets
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
How much can hardware help routing?
Journal of the ACM (JACM)
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Parallel hashing: an efficient implementation of shared memory
Journal of the ACM (JACM)
A general approach to dynamic packet routing with bounded buffers
Journal of the ACM (JACM)
Almost optimal permutation routing on hypercubes
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Partitioning Message Patterns for Bundled Omega Networks
IEEE Transactions on Parallel and Distributed Systems
A probabilistic relation between desirable and feasible, models of parallel computation
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Journal of Parallel and Distributed Computing
Survey on Oblivious Routing Strategies
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Memory organization schemes for large shared data
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Optimal cover time for a graph-based coupon collector process
Journal of Discrete Algorithms
| Hi-index | 0.03 |