Decentralized Algorithms
Spring 2026 | Dr. Jared Coleman | Loyola Marymount University
Welcome to CMSI 4071: Decentralized Algorithms. This course explores online algorithms and decentralized systems, focusing on real-time decision-making, distributed coordination, and resilience in uncertain environments.
Quick Links
Course Overview
This course covers algorithmic strategies for operating under incomplete information, techniques to evaluate performance guarantees, and the design principles behind decentralized consensus protocols.
Key Topics
- Online Algorithms: Linear search, competitive analysis, upper and lower bounds
- Mobile Agents: Delivery, gathering, and coordination problems
- Distributed Systems: Leader election, Byzantine fault tolerance
- Consensus Protocols: Practical BFT, proof-of-work, state machine replication
Course Information
| Item | Details |
|---|---|
| Instructor | Dr. Jared Coleman |
| jared.coleman@lmu.edu | |
| Office | DOO-212 |
| Lecture | Mo/Wed 3:40–5:20 PM in PER-121 |
| Office Hours | TBD |
Assessments
- Reading Reviews (50%): Individual 2-3 page reviews for each assigned paper
- Final Project (30%): Group paper on a research topic
- Peer Reviews (10%): Feedback on classmates’ final papers
- Final Presentation (10%): Present your project findings
Getting Help
- Slack: Join lmucs.slack.com for questions and discussions
- Office Hours: Weekly sessions (times listed above)
- Email: jared.coleman@lmu.edu - expect response within 24 hours
Workload
This is a 4-unit course. Expect approximately 12 hours per week of work, including:
- 4 hours in lecture
- 8 hours outside of class (reading, writing reviews, project work)
For complete course policies, schedule, and requirements, see the Syllabus.