Aspnes, James

last modified on Mon, 05 Sep 2022

		Random Link ¯\_(ツ)_/¯
Mar 5, 2020	»	[ToDo] CPSC 469: Randomized Algorithms 1 min; updated Sep 5, 2022 Randomized Algorithms Probability Theory Random Variables Basic Probabilistic Inequalities Concentration Bounds Randomized Search Trees Hashing Martingales and Stopping Times Markov Chains Approximate Counting The Probabilistic Method De-randomization Quantum Computing Randomized Distributed Algorithms Sample Assignments from Fall 2019 Sample Assignments from Fall 2016 Sample Assignments from Spring 2014 Sample Assignments from Spring 2013 Sample Assignments from Spring 2011 Sample Assignments from Spring 2009 Probabilistic Recurrences CPSC 469: Randomized Algorithms. James Aspnes. www.cs.yale.edu . Mar 5, 2020.
Oct 7, 2020	»	[ToDo] CPSC 465: Theory of Distributed Systems 1 min; updated Sep 5, 2022 Introduction Message Passing Model Broadcast and Convergecast Distributed Breadth-First Search Leader Election Logical Clocks Synchronizers Coordinated Attack Synchronous Agreement Byzantine Agreement Impossibility of Asynchronous Agreement Paxos Failure Detectors Quorum Systems Shared Memory Model Distributed Shared Memory Mutual Exclusion The Wait-Free Hierarchy Atomic Snapshots Lower Bounds on Perturbable Objects Restricted-Use Objects Common2 Randomized Consensus and Test-and-Set Renaming Software Transactional Memory Obstruction-Freedom BG Simulation Topological Methods Approximate Agreement Other Communication Models Overview Self-stabilization Population Protocols and Chemical Reaction Networks Mobile Robots Beeping Appendix ...