Algorithms

• The Quiet Calculus of Probabilistic Commutativity · 2025-09-27

  A practical calculus for quantifying when non-commutative operations in distributed systems can be safely executed without heavyweight coordination.

• Algorithm Design
• Algorithms
• Algorithms (4th ed.)
• Introduction to Algorithms (3rd ed.)
• Introduction to Parallel Computing (2nd ed.)
• The Art of Computer Programming, Vols. 1–4A