Probabilistic recurrence relations revisited

DOI10.1016/S0304-3975(96)00261-7zbMath0901.68078OpenAlexW2119912580MaRDI QIDQ1391296

Devdatt P. Dubhashi, Shiva P. Chaudhuri

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00261-7

zbMATH Keywords

randomised algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Separation Between Deterministic and Randomized Query Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of parallel search
• Near-optimal, distributed edge colouring via the nibble method
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Probabilistic recurrence relations
• Fast randomized algorithms for distributed edge coloring
• Inequalities: theory of majorization and its applications

This page was built for publication: Probabilistic recurrence relations revisited