David Stalfa
Northeastern University
d.stalfa [at] northeastern.edu
I teach computer science courses part time at Northeastern University in Seattle. I am a former PhD student of 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.
My CV can be found here.
Scheduling Splittable Jobs on Configurable Machines
Matthew Casey, Rajmohan Rajaraman, David Stalfa
APPROX 24
Scheduling under Non-Uniform Job and Machine Delays
Rajmohan Rajaraman, David Stalfa, Sheng Yang
ICALP 23
Improved Bounds for Scheduling Flows under Endpoint Capacity Constraints
Searidang Pa, Rajmohan Rajaraman, David Stalfa
APOCS 22
Scheduling Flows on a Switch to Optimize Response Times
Hamidreza Jahanjou, Rajmohan Rajaraman, David Stalfa
SPAA 21
Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay
Biswaroop Maiti, Rajmohan Rajaraman, David Stalfa, Zoya Svitkina, Aravindan Vijayaraghavan
FOCS 20
The Reach of Axis Aligned Squares in the Plane
Hugo A. Akitaya, Matthew Jones, David Stalfa, Csaba D. Toth
MFCS 18, Discrete Optim 20
Algorithms: CS5800 NEU, Fall 2024
Graduate course on the theory of algorithms.
Greedy algorithms, divide and conquer, dynamic programming, network flow, and randomized algorithms.
Algorithms and Data: CS3000 NEU, Summer 2024 (Session 2)
Undergraduate course on the theory of algorithms (asynchronous, online).
Greedy algorithms, divide and conquer, dynamic programming, and network flow.
Algorithms and Data: CS3000 NEU ,Summer 2024 (Session 1)
Undergraduate course on the theory of algorithms (asynchronous, online).
Greedy algorithms, divide and conquer, dynamic programming, and network flow.
Discrete Structures: CS5002 NEU, Fall 2023
Graduate course on the discrete mathematics.
Logic, sets, counting, probability, mathematical induction, and graph theory.
Algorithms and Data (Recitations): CS3000 NEU, Fall 21 and Fall 22
Discrete Structures (Recitations): CS1800 NEU, Fall 20
Theory of Computation (Computer Science)
Spring 16, Summer 16, Fall 17
Theory of Computation (Philosophy)
Spring 16, Fall 17
Data Structures
Summer 17
Discrete Math
Fall 16, Summer 16, Spring 17
Logic
Spring 14, Fall 14, Fall 15
Metaphysics
Fall 16
Justice, Equality & Liberty
Fall 15
From Sinners to Sociopaths
Spring 17