Parallel RAMs with owned global memory and deterministic contex-free language recognition
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The APRAM: incorporating asynchrony into the PRAM model
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for generating random permutations on a shared memory machine
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Concurrent reading and writing
Communications of the ACM
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Efficient Parallel Algorithms Can Be Made Robust
Efficient Parallel Algorithms Can Be Made Robust
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Wait-free parallel algorithms for the union-find problem
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Impossibility results for asynchronous PRAM (extended abstract)
SPAA '91 Proceedings of the third 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
Parallel algorithms column 1: models of computation
ACM SIGACT News
A method for implementing lock-free shared-data structures
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Asynchronous Analysis of Parallel Dynamic Programming Algorithms
IEEE Transactions on Parallel and Distributed Systems
Asynchronous shared memory search structures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient execution of nondeterministic parallel programs on asynchronous systems
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Cilk multithreaded parallel programs on processors of different speeds
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Towards practical deteministic write-all algorithms
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
Parallel Algorithm Design with Coarse-Grained Synchronization
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Basic Algorithms for the Asynchronous Reconfigurable Mes
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On Scheduling Task-Graphs to LogP-Machines with Disturbances
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
Theoretical Computer Science
Efficient parallel algorithms can be made robust
Distributed Computing
Scheduling DAGs on asynchronous processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Hi-index | 0.00 |