Divyansh Srivastava is a software engineer and PhD student at UC San Diego with 10 years of experience building performant systems across OS, cloud, and research settings. He has shipped production features at Microsoft (Azure Linux Systems Group and PowerToys Run) and driven research-grade prototypes in autoregressive image generation and uncertainty-aware pose estimation. His open-source contributions include optimizing graph algorithms in the widely-used Julia LightGraphs package—implementing parallel Dijkstra and betweenness centrality with extensive testing—and mentoring distributed graph work in Google Summer of Code. At American Express AI Labs he made a Bayesian online changepoint detection approach practical by reducing complexity from O(n^2) to O(n) for a class of kernels, demonstrating a knack for turning theory into scalable systems. Comfortable across full-stack, systems, and ML research, he combines rigorous academic training from IIT Bombay and UCSD with hands-on delivery in large engineering organizations. An underrated strength is his pattern of improving algorithmic complexity while keeping an eye on usability and product integration.
Contributions:80 reviews, 102 commits, 195 PRs in 7 months
Contributions summary:Divyansh primarily contributed to the PowerToys Run project, focusing on the Wox launcher module. Their work involved removing and re-adding UI components, such as a notify icon component. They also removed setting UI XAML files and references. Furthermore, the user implemented functionalities like displaying info bars for blocked image paths, which suggests involvement in both UI/UX design and possibly backend logic for handling image rendering. The user also worked on display and execution of app functionality.
An optimized graphs package for the Julia programming language
Role in this project:
Back-end Developer
Contributions:8 commits, 14 PRs, 96 comments in 4 months
Contributions summary:Divyansh significantly contributed to the `lightgraphs.jl` project, focusing on optimizing graph algorithms, particularly Dijkstra's shortest path algorithm and betweenness centrality calculations. Their work involved implementing parallel versions of these algorithms and modifying existing code to include parallel processing. Additionally, the user refactored the code for maximum adjacency visit and non-visitor based strongly connected components. The user also incorporated extensive testing to validate the correctness and performance of the implemented algorithms.
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.