Evrim Ozel
I am a Ph.D. candidate at the Center for Algorithms and Theory of Computation in the Department of Computer Science at the University of California, Irvine, advised by Prof. Michael Goodrich.
My research interests are in are in graph theory, algorithms, and data structures. Recently, I have been working on designing and analyzing efficient algorithms for performing routing and exact learning tasks on large-scale networks, as well as algorithms for sorting that are tolerant to noisy comparison errors and work in privacy-preserving and external memory settings.
Papers
- Highway Preferential Attachment Models for Geographic Routing, COCOA 2023. [Best Paper Award]
Ofek Gila, Michael T. Goodrich, Evrim Ozel.
- External-Memory Sorting with Comparison Errors, WADS 2023.
Michael T. Goodrich, Evrim Ozel.
- Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors, SEA 2023.
Ramtin Afshar, Michael Dillencourt, Michael T. Goodrich, Evrim Ozel.
- Modeling the Small-World Phenomenon with Road Networks, ACM SIGSPATIAL 2022. [Best Paper Runner-Up Award]
Michael T. Goodrich, Evrim Ozel.
- Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching, CCCG 2022.
Gill Barequet, Shion Fukuzawa, Michael T. Goodrich, David M. Mount, Martha C. Osegueda, Evrim Ozel.
- Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees, SEA 2022.
Ramtin Afshar, Michael T. Goodrich, Evrim Ozel.