David Stalfa

Northeastern University
d.stalfa [at] northeastern.edu

I teach theoretical computer science courses part time at Northeastern University in Seattle. I received my PhD in 2023 from Northeastern University in Boston, working with Prof. Rajmohan Rajaraman. My research is primarily focused on approximation algorithms for problems in scheduling, specifically on settings with communication or bandwidth constraints. I previously earned an MA in Philosophy at Tufts University in Boston and a BA in English Literature at Hobart and William Smith Colleges in Geneva, NY.

My CV can be found here.

Papers

Scheduling Splittable Jobs on Configurable Machines
with Matthew Casey and Rajmohan Rajaraman
APPROX 24
Scheduling under Non-Uniform Job and Machine Delays
with Rajmohan Rajaraman and Sheng Yang
ICALP 23
Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints
with Searidang Pa and Rajmohan Rajaraman
APOCS 22
Scheduling Flows on a Switch to Optimize Response Times
with Hamidreza Jahanjou and Rajmohan Rajaraman
SPAA 21
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
with Biswaroop Maiti, Rajmohan Rajaraman, Zoya Svitkina and Aravindan Vijayaraghavan
FOCS 20
The Reach of Axis Aligned Squares in the Plane
with Hugo A. Akitaya, Matthew Jones and Csaba D. Toth
MFCS 18, Discrete Optim 20

Teaching
Instructor

Algorithms: CS 5800 NEU, Fall 2026
Graduate course on the theory of algorithms. The course focuses on algorithmic design paradigms including greedy heuristics, divide and conquer approaches, dynamic programming, network flow reductions, approximations and linear programming, as well as randomization. Most of my lecture materials are posted here.
Algorithms: CS 5800 NEU, Spring 2026
Algorithms: CS 5800 NEU, Fall 2025
Algorithms: CS 5800 NEU, Spring 2025
Algorithms: CS 5800 NEU, Fall 2024
Algorithms and Data: CS 3000 NEU, Summer 2024 (Session 2)
Undergraduate course on the theory of algorithms (asynchronous, online). The course covered algorithmic design techniques including greedy, divide and conquer, dynamic programming, and network flow.
Algorithms and Data: CS 3000 NEU ,Summer 2024 (Session 1)
Discrete Structures: CS 5002 NEU, Fall 2023
Graduate course on discrete mathematics which form the foundation of many fields within computer science. Topics included logic, sets, counting, probability, mathematical induction, and graphs.

Instructor of Record

Algorithms and Data: CS3000 NEU, Fall 2021 and Fall 2022
Discrete Structures: CS1800 NEU, Fall 2020

Teaching Assistant

Theory of Computation (Computer Science)
Spring 2016, Summer 2016, Fall 2017
Theory of Computation (Philosophy)
Spring 2016, Fall 2017
Data Structures
Summer 2017
Discrete Math
Fall 2016, Summer 2016, Spring 2017
Logic
Spring 2014, Fall 2014, Fall 2015
Metaphysics
Fall 2016
Justice, Equality & Liberty
Fall 2015
From Sinners to Sociopaths
Spring 2017

Other interests

Since 2015 Rob Hendry and I have been developing Merlin's Chain, a 2 player abstract strategy board game.

I also volunteer at a tool library for the Phinney Neighborhood Association, and will be running a bike repair stand for them starting Spring 2026.

Papers

TeachingInstructor

Instructor of Record

Teaching Assistant

Other interests

Teaching
Instructor