Blair Sullivan
Professor at Kahlert School of Computing, University of Utah
Salt Lake City, Utah, United States
Summary
👤
Senior🎓
Top SchoolBlair Sullivan is a professor of computer science at the University of Utah with 14 years of professional experience and a Ph.D. from Princeton, specializing in scalable graph algorithms, network science, structural graph theory, and parameterized complexity. She blends deep theoretical foundations with algorithm engineering to tackle large-scale network problems and translate research into practical, performant solutions. Based in Salt Lake City, Blair is known for bridging rigorous complexity analysis with applied graph-system design, often focusing on scalability and real-world data. Her dual background in theory and engineering enables contributions that improve both algorithmic guarantees and implementation efficiency—an approach that surfaces in collaborations across academia and systems projects.
14 years of coding experience
B.S., B.S. at Georgia Institute of TechnologyPh.D., Ph.D. at Princeton University
Github Skills (37)
decomposition9
complexity9
bioinformatics7
graph7
querying7
metagenomics7
optimization7
dynamic-programming6
assembly6
meta-analysis5
near5
permutation4
meta4
mib4
indexing4
Programming languages (7)
Github contributions (5)
TheoryInPractice/BEAVr
May 2016 - Sep 2018
Contributions:2 releases, 1 PR, 5 pushes in 2 years 4 months
javascriptexpansionalgorithm-visualizervisualizer
TheoryInPractice/CONCUSS
Sep 2015 - Apr 2017
Combatting Network Complexity Using Structural Sparsity
Contributions:2 releases, 24 commits, 15 PRs in 1 year 8 months
complexitysparsitystructural
Find and Hire Top DevelopersWe’ve analyzed the programming source code of over 60 million software developers on GitHub and scored them by 50,000 skills. Sign-up on Prog,AI to search for software developers.