Dr. Jared Coleman
Spring 2026
Basic Information
| Item | Details |
|---|---|
| Instructor | Jared Coleman |
| jared.coleman@lmu.edu | |
| Office | DOO-212 |
| Office Hours | TBD |
| Zoom | https://lmula.zoom.us/my/jaredcoleman |
| Lecture Time | Mo/Wed 3:40–5:20 PM |
| Lecture Location | PER-121 |
Course Description
This course explores online algorithms and decentralized systems, focusing on real-time decision-making, distributed coordination, and resilience in uncertain environments. Students will study algorithmic strategies for operating under incomplete information, learn techniques to evaluate performance guarantees, and examine the design principles behind decentralized consensus protocols. Key topics include online scheduling, Byzantine fault tolerance, leader election, proof-of-work, and state machine replication.
Learning Objectives
By the end of this course, students will have gained:
- An understanding of the fundamental concepts of online algorithms and decentralized systems.
- The ability to analyze and compare the performance of online and decentralized algorithms.
- The ability to propose new research directions and survey the existing literature on a given problem.
Lecture Attendance
- Mandatory: Lecture attendance is required; participation is part of the course grade.
- No need to notify for absences: I’ll assume you will make up the material.
- Participatory lectures: Come prepared to ask and answer questions!
Work Load Expectations
At LMU, each unit corresponds to 3 hours of weekly work.
⚠️ Since this is a 4-unit class, expect ~12 hours per week.
This includes lecture time, homework, studying, and preparation.
Expect ~8 hours/week outside of lecture.
Finding Help for the Course
LMU CMSI offers many resources to support your success:
- Slack Messaging: Download Slack (https://slack.com) and join the LMU CS workspace (https://lmucs.slack.com). If I don’t respond within 24 hours (excluding weekends), please send a reminder! I will never intentionally take more than 24 hours to respond.
- Office Hours: Attend weekly office hours (times listed above). If you have valid schedule conflicts, email me to arrange alternatives.
Tentative Schedule of Topics
(Subject to change; refer to Brightspace for updates.)
| Date | Lecture Topic | Reading |
|---|---|---|
| 01/13 | Course Introduction, Grouping, and Scheduling | This Syllabus; Keshav (2007) |
| 01/15 | Online vs. Offline Algorithms | Lecture 1; Karp (1992); Keshav (2007) |
| 01/20 | No Classes — MLK Day | NYTimes Article |
| 01/22 | Course Introduction | Lecture 1; Karp (1992) |
| 01/27 | Online vs. Offline Algorithms | Lecture 1; Karp (1992) |
| 01/29 | Linear Search, Upper Bounds | Lecture 2; Kranakis (2024) |
| 02/03 | Linear Search, Lower Bounds | Lecture 2; Kranakis (2024) |
| 02/05 | Linear Search, Moving Target | Lecture 2; Coleman et al. (2022); Kranakis (2024) |
| 02/10 | Linear Search, Moving Target | Same as above |
| 02/12 | Linear Search, Randomized | Lecture 2; Kao et al. (1996); Kranakis (2024) |
| 02/17 | Linear Search, Randomized | Same as above |
| 02/19 | Delivery | Lecture 3; Coleman et al. (2021) |
| 02/24 | Delivery | Same as above |
| 02/26 | Gathering | Lecture 3; Cieliebak et al. (2003) |
| 03/03 | Gathering | Same as above |
| 03/05 | Spring Break – No Classes | — |
| 03/10 | Spring Break – No Classes | — |
| 03/12 | Gathering | Lecture 3; Cieliebak et al. (2003) |
| 03/17 | Leader Election | Lecture 4; Lynch (1996) |
| 03/19 | Leader Election | Same as above |
| 03/24 | Byzantine Generals | Lecture 4; Lamport et al. (2019) |
| 03/26 | Byzantine Generals | Same as above |
| 03/31 | Practical BFT | Lecture 4; Castro & Liskov (1999) |
| 04/02 | Practical BFT | Same as above |
| 04/07 | Cesar Chavez Day — No Classes | El País Article |
| 04/09 | Consensus | Lecture 5; Lynch (1996) |
| 04/14 | Consensus | Same as above |
| 04/16 | Proof-of-Work | Lecture 5; Hashcash; Bitcoin |
| 04/21 | Proof-of-Work | Same as above |
| 04/23 | Easter Holiday — No Classes | History.com |
| 04/28 | State Machine Replication | Lecture 5; Tendermint paper |
| 04/30 | State Machine Replication | Same as above |
| 05/05 | Final Presentations | — |
| Final Exam Schedule | Final Presentations | https://registrar.lmu.edu/finalexamschedules/ |
Assignments and Grading
- Reading Reviews (50%): Two–three page individual reviews for each assigned paper/chapter. Due at the start of class on the last day they appear in the schedule.
- Final Project (30%): Group paper + presentation.
- Peer Reviews (10%): Provide feedback on classmates’ final papers.
- Final Presentation (10%): Present your project to the class.
Grading Scale
| Percentage | Grade |
|---|---|
| 93–100 | A |
| 90–93 | A- |
| 87–90 | B+ |
| 83–87 | B |
| 80–83 | B- |
| 77–80 | C+ |
| 73–77 | C |
| 70–73 | C- |
| 65–70 | D |
| 0–65 | F |
Grades round to the nearest whole number.
Late Work Policy
⚠️ All assignments are due exactly at the specified time. Late work = 0.
Extensions are granted only for exceptional situations. Start assignments early.
Academic Integrity
Students are encouraged to collaborate, but all submitted work must be original.
❗ All forms of plagiarism result in severe disciplinary action.
Unacceptable behavior includes:
- Copying significant text/code from any external source.
- Copying solutions from peers.
- Presenting others’ work as your own.
If unsure whether something is allowed: ask first.
University Policy on Academic Honesty
(Summarized)
LMU expects honesty and integrity in all academic work. Violations include copying, unauthorized collaboration, misrepresentation, and plagiarism. Consequences range from zero credit to expulsion.
Full policy: https://academics.lmu.edu/honesty/
Tentative Nature of the Syllabus
This syllabus may be updated. Students are responsible for checking announcements and Brightspace.
University Resources
Expectations for Classroom Behavior
Students should engage respectfully and follow LMU’s behavioral guidelines:
- Lion’s Code: https://studentaffairs.lmu.edu/about/osccr/studentcodespolicies/
- Classroom behavior guidelines: https://lmu.box.com/s/v2x89uspgbx3l23egcz7mjd6dbekcn60
- Community Standards process: https://studentaffairs.lmu.edu/about/studentaffairsdeansoffice/lionscode/communitystandardsprocess/
Respect for self and others is expected at all times.
Computer Science Department – Student Guide
Resources and support: https://sites.google.com/view/lmucs
Academic Degree Requirements and Policies
See: https://bulletin.lmu.edu/academic-degree-requirements-policies/
Disability Support Services (DSS)
The DSS Office supports students with documented disabilities.
Email: dsslmu@lmu.edu
Phone: (310) 338-4216
Website: http://www.lmu.edu/dss
Academic Resource Center
Writing support and tutoring across subjects.
More info: https://academics.lmu.edu/arc/
Emergency Preparedness
Public Safety: 310-338-2893 (x222 on campus)
Emergency info: http://www.lmu.edu/emergency
COVID updates: https://www.lmu.edu/together/
Community of Care
Case-management support for student well-being:
https://studentaffairs.lmu.edu/wellness/coc/learnmoreaboutus/