I am a fourth year PhD student in the Theory Group at University of California, Irvine, advised by Michael Goodrich. My research has focused on algorithms for graphs, graph drawing, and automated vehicles. I am currently on the visualizing team of JAAM, which aims to detect security vulnerabilities through static analysis and visualization of Java Byte Code.
Research Interest
Algorithms. Graph algorithms and Graph Drawing.
Contact
Email: jjbesavi at uci.edu
Office: DBH 4099
Conference Publications
- Juan Jose Besa, William E Devanny, David Eppstein, Michael T Goodrich, Timothy Johnson,
Optimally Sorting Evolving Data at ICALP 2018 - Juan Jose Besa, William E Devanny, David Eppstein, Michael T Goodrich, Timothy Johnson,
Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data at ALENEX 2017 - Juan Jose Besa, William E Devanny, David Eppstein, Michael T Goodrich
- Scheduling autonomous vehicle platoons through an unregulated intersection at ATMOS 2016
Journal Publications
- Juan Jose Besa, Yadran Eterovic,
A concurrent red–black tree in the Journal of Parallel and Distributed Computing
Links
orcid.org/0000-0002-5676-7011
DBLP: https://dblp.org/pid/185/5970
Jaam Github: https://github.com/Ucombinator/jaam
Personal
