Yakov Nekrich

Yakov Nekrich is an Associate Professor of Computer Science at Michigan Technological University with expertise in algorithms and data structures. His research spans geometric data structures, string algorithms, and compressed data representations, bridging theoretical and applied computer science.

His research interests include:

• Algorithm Design: Focus on efficient solutions for computational geometry and string processing.
• Data Structures: Optimization for dynamic and multidimensional data, including external memory implementations.
• Compressed Data Structures: Balancing space efficiency with fast query performance for massive datasets.

Recent publications highlight advancements in:

• 4D dominance range reporting (SODA 2023, SoCG 2020)
• Colored range searching (SoCG 2020, SODA 2020)
• Dynamic planar point location (STOC 2021, SIAM J. Comp. 2018)
• Compressed index construction (SODA 2017)

These works emphasize geometric algorithms, database optimization, and algorithmic complexity.

Teaching at Michigan Tech since 2019, he has delivered courses in Advanced Algorithms and Introduction to Algorithms. Previously, he taught Algorithms (CS341) at University of Waterloo (2014) and Data Structures and Data Management (CS240) (2015-2016).

As an active conference organizer, he has served on program committees for SPIRE (2013-2020), PODS (2015), LATIN (2016), and DCC (2020-2023), among others.