Lower bounds for parallel computation on linked structures

Authors:
F. Fich;V. Ramachandran
Affiliations:
University of Toronto, Toronto, Ontario, Canada;University of Texas, Austin, Texas
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Upper and lower time bounds for parallel random access machines without simultaneous writes

SIAM Journal on Computing
Parallel RAMs with owned global memory and deterministic contex-free language recognition

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Complexity classes without machines: on complete languages for UP

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Parallel symmetry-breaking in sparse graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
CREW PRAMS and decision trees

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)

Hi-index	0.00