Matching composition and efficient weight reduction in dynamic matching, with Aaron Bernstein, Jiale Chen, Aditi Dudeja, Aaron Sidford, and Ta-Wei Tu.
SODA 2025.
Zach Langley
I am currently a ZK engineer at Axiom.
I earned my PhD in theoretical computer science from Rutgers University in 2024, where I had the privilege of being advised by Aaron Bernstein.
Prior to that, I worked as a software engineer for six years, with roles at companies including Twitter and Color.
For additional information about my professional and academic background, please refer to my LinkedIn page. I am also available for contact via email at zblangley [at] gmail [dot] com.
Publications
Streaming and communication complexity of load-balancing via matching contractors, with Sepehr Assadi, Aaron Bernstein, Lap Chi Lau, and Robert Wang.
SODA 2025.All-norm load balancing in graph streams via the Multiplicative Weights Update method, with Sepehr Assadi and Aaron Bernstein.
ITCS 2023.A framework for dynamic matching in weighted graphs, with Aaron Bernstein and Aditi Dudeja.
STOC 2021.Improved bounds for distributed load balancing, with Sepehr Assadi and Aaron Bernstein.
DISC 2020. Best Paper Award.Minimum planar multi-sink cuts with connectivity priors, with Ivona Bezáková.
MFCS 2014.Contiguous minimum single-source-multi-sink cuts in weighted planar graphs, with Ivona Bezáková.
COCOON 2012.Industry Experience
Axiom, Founding ZK Proof Engineer. Jun 2024–Present.
Algorand, Smart Contracts Researcher. May 2021–August 2021, Jan 2022–Mar 2023.
Color Genomics, Software Engineer. Jul 2017–Jul 2019.
Expa, Developer-in-Residence. Feb 2017–Jun 2017.
Operator, Software Engineer. Apr 2015–Dec 2016.
Twitter, Software Engineer. Sep 2013–Apr 2015.
Google, Software Engineer — Intern. May 2013–Aug 2013.