Deterministic coin tossing with applications to optimal parallel list ranking-Reference-Cited by-同舟云学术

Deterministic coin tossing with applications to optimal parallel list ranking

Author:

Cole Richard,Vishkin Uzi

Publisher

Elsevier BV

Subject

General Engineering

Reference14 articles.

1. The Design and Analysis of Computer Algorithms;Aho,1974

2. Optimal parallel algorithms for the connected component problems;Chin,1981

3. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms;Cole,1986

4. One, two, three… infinity: lower bound for parallel computation;Fich,1985

5. Parallel prefix computation;Fisher;J. Assoc. Comput. Mach.,1980

Cited by 246 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Local Hadwiger's Conjecture;Journal of Combinatorial Theory, Series B;2023-09

4. Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16