A photo of me standing in front of Crater Lake in Oregon at sunrise.

Kasra Jamshidi

I make software systems efficient, scalable, and usable. My specialty is developing practical methods for solving theoretically intractable problems at scale, like subgraph matching or constraint satisfaction.

I made Peregrine, a fast, programmable data mining engine for massive graphs which analyzes user queries to aggressively optimize execution.

I received my PhD from Simon Fraser University in 2025. You can read my thesis if you're interested in translating application semantics into concrete performance gains in large-scale graph systems. I also have some talks on YouTube.

Reach out if you have hard problems in need of efficient solutions.

Publications

Contigra: Graph Mining with Containment Constraints
EuroSys '24
Joanna Che, Kasra Jamshidi, Keval Vora
OsirisBFT: Say No to Task Replication for Scalable Byzantine Fault Tolerant Analytics
PPoPP '24
Kasra Jamshidi, Keval Vora
Accelerating Graph Mining Systems with Subgraph Morphing
EuroSys '23
Kasra Jamshidi, Guoqing Harry Xu, Keval Vora
Anti-Vertex For Neighborhood Constraints In Subgraph Queries
GRADES-NDA '22
Kasra Jamshidi, Mugilan Mariappan, Keval Vora
A Deeper Dive into Pattern-Aware Subgraph Exploration with Peregrine
SIGOPS OSR '21
Kasra Jamshidi, Keval Vora
Peregrine: A Pattern-Aware Graph Mining System
EuroSys '20
Kasra Jamshidi, Rakesh Mahadasa, Keval Vora