Sorting in One and Two Rounds Using t-Comparators

Keyphrases

• Sorting Algorithm 100%
• Novel Technique 50%
• Optimal Algorithm 50%
• Round numbers 50%
• High Probability 50%
• Randomized Algorithms 50%
• Optimal number 50%
• Deterministic Algorithm 50%
• Las Vegas 50%
• Asymptotically Optimal 50%
• Binary Tree 50%
• Information-theoretic Bounds 50%
• Design Theory 50%
• Steiner System 50%
• Optimal Information 50%
• Unveiling 50%
• Distributed Setting 50%
• Algorithm Use 50%
• Possible Values 50%
• Communication Rounds 50%
• Round-optimal 50%

Mathematics

• Comparator 100%
• Probability 33%
• Optimal Number 16%
• Steiner System 16%
• Binary Tree 16%