Abstract
This report summarizes the paper “Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking.” It introduces the DC-ListRank algorithm, a deterministic parallel algorithm for list ranking in distributed computing. The algorithm achieves optimal time complexity and scalability by combining coin tossing with parallel computing. The report covers the background, problem statement, related work, algorithm description, correctness analysis, discussions on strengths and limitations, performance comparisons, and future research directions. The DC-ListRank algorithm represents a significant advancement in parallel list ranking, offering efficiency and practical applications in distributed computing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
