Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
The expected advantage of asynchrony
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A methodology for implementing highly concurrent data structures
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic recurrence relations
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
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
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Asynchronous algorithms for shared memory parallel computers
Asynchronous algorithms for shared memory parallel computers
Work-optimal asynchronous algorithms for shared memory parallel computers
SIAM Journal on Computing
Designing Synchronous Algorithms for Asynchronous Processors
Designing Synchronous Algorithms for Asynchronous Processors
The complexity of parallel computations
The complexity of parallel computations
Parallel algorithms column 1: models of computation
ACM SIGACT News
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
| Hi-index | 0.00 |