Evrim Ozel

I am currently an Applied Researcher at LinkedIn. I received a Ph.D. in Computer Science from the University of California, Irvine, as part of the Center for Algorithms and Theory of Computation, where I was advised by Prof. Michael Goodrich. My research at UCI focused 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.

Teaching

I was a teaching assistant for the following courses at UCI:

CS 161 - Design and Analysis of Algorithms
CS 162 - Formal Languages and Automata Theory
CS 163 - Graph Algorithms
CS 165 - Project in Algorithms and Data Structures
CS 260 - Fundamentals of the Design and Analysis of Algorithms
CS 260P - Fundamentals of Algorithms with Applications
ICS 46 - Data Structure Implementation and Analysis