Nicholas Recker

About me

Scheduled to work for the NSA as an applied research mathematician.
Graduated from Purdue with PhD in Theoretical Computer Science
- Advised by Simina Branzei
Graduated from University of Michigan with bachelor's in CS and minor in math.
Enjoys heavy board games like Terraforming Mars and Agricola

Sharp Power Law of Local Search on Expanders
- Joint work with Simina Branzei and Davin Choo
- Accepted for publication in SODA24
- Proved lower bounds for local search on a variety of graphs, including a polylog-tight bound on constant degree expanders.
- https://arxiv.org/abs/2305.08269
Searching, Sorting, and Cake Cutting in Rounds
- Joint work with Simina Branzei and Dimitris Paparas
- (Under submission)
- https://arxiv.org/abs/2012.00738
Lower Bounds for Local Search via Spectral Gaps
- Joint work with Simina Branzei
- Manuscript available upon request

My resume can be found at this link.

Highlights:

While interning at Atlas Space Operations, investigated protocol options for data backhaul, including TCP, UDP, UDT, and SRT.
Wrote plugin while interning at Visteon to automatically detect text box overflows in vehicle cluster graphical user interfaces by recursively traversing node trees.

While most of my work has been confidential and/or theoretical in nature, I do have some examples of my code that I can share