Dummy
Welcome to my home page. I am an Associate Professor of Computer Science at Michigan Tech working on Algorithms and Data Structures. I am particularly interested in geometric data structures, algorithms on strings, and compressed data structures. Most of my research is on Algorithms Theory, but I am also interested in implementations. See my DBLP page and Google Scholar for a full list of my publications or scroll down for a subjective list of my recent personal favorites. A brief description of some current research topics can be found here.
I am looking for motivated students interested in Algorithms and Data Structures.
Dummy
Dummy
Recent Program Committees
SPIRE 2013, SPIRE 2014, PODS 2015, LATIN 2016, ICDE 2016, CPM 2016, ICDT 2017, CPM 2018, ICDT 2019, CPM 2019, DCC 2020,
SPIRE 2020, DCC 2021, WADS 2021, DCC 2022, SoCG 2022, DCC 2023, WADS 2023
Selected Recent Publications
- 4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time
with S. Rahul34th ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) [PDF] - Optimal-Time Dynamic Planar Point Location in Connected Subdivisions
53rd ACM Symposium on Theory of Computing (STOC 2021) [PDF] - New Data Structures for Orthogonal Range Reporting and Range Minima Queries
32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) [PDF] - Four-Dimensional Dominance Range Reporting in Linear Space
36th International Symposium on Computational Geometry (SoCG 2020) [PDF] - Further Results on Colored Range Searching
with T. M. Chan and Q. He
36th International Symposium on Computational Geometry(SoCG 2020) [PDF] - Better Data Structures for Colored Orthogonal Range Reporting
with T. M. Chan
31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020) [PDF] - Dynamic Point Location in External Memory
with J. I. Munro
35th International Symposium on Computational Geometry (SoCG 2019) [PDF] - Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
with T. M. Chan, S. Rahul, and K. Tsakalidis
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) [PDF] - Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
with J. I. Munro and G. Navarro
27th ACM-SIAM Symposium on Discrete Algorithms (SODA 2017) [PDF] - Towards an Optimal Method for Dynamic Planar Point Location
with T. M. Chan
56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015) [PDF]
Invited to SIAM Journal on Computing (FOCS special issue) - Compressed Data Structures for Dynamic Sequencess
with J. I. Munro
23rd European Symposium on Algorithms (ESA 2015) [PDF] - Dynamic Data Structures for Document Collections and Graphs
with J. I. Munro and J. S. Vitter
34th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2015) [PDF] - Efficient Range Searching for Categorical and Plain Data
ACM Transactions on Database Systems (TODS) 39 (2014), PODS 2012 special issue [PDF] - Optimal Color Range Reporting in One Dimension
with J. S. Vitter
21st European Symposium on Algorithms (ESA 2013) [PDF] - Full-fledged Real-Time Indexing for Constant Size Alphabets
with G. Kucherov
40th International Colloquium on Automata, Languages, and Programming (ICALP 2013) [PDF] - Optimal Dynamic Sequence Representations
with G. Navarro
24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013) [PDF] - Top-$k$ Document Retrieval in Optimal Time and Linear Space
with G. Navarro
23rd ACM-SIAM Symposium on Discrete Algorithms (SODA 2012) [PDF]
Recent Teaching
- Advanced Algorithms, Fall 2021, Fall 2022, Michigan Technological University
- Introduction to Algorithms, Spring 2020, Spring 2021, Spring 2022, Michigan Technological University
- Algorithms (CS341), Fall 2014, University of Waterloo
- Data Structures and Data Management (CS240), Spring 2015 & Winter 2016, University of Waterloo
Dummy
Contact
Yakov Nekrich
Office: Rekhi 311
Email: yakov(at)mtu(dot) edu
Phone: 906-487-2271
Office: Rekhi 311
Email: yakov(at)mtu(dot) edu
Phone: 906-487-2271