Pat Morin

Pat Morin is a computer scientist and professor known for his work in algorithms, data structures, and computational geometry. He is a professor at Carleton University's School of Computer Science in Ottawa, Canada.

Morin's research focuses primarily on randomized algorithms, data structures for geometric problems, and kinetic data structures. He has made significant contributions to the study of skip lists and their variants, as well as algorithms for range searching and related problems in computational geometry. His work often addresses practical considerations in the design and implementation of efficient algorithms.

Morin is the author of the widely-used open textbook, "Open Data Structures: An Introduction," which provides a comprehensive overview of fundamental data structures and algorithms, emphasizing a practical, implementation-oriented approach. The book is available in multiple programming languages (e.g., Java, C++, Python) and is freely accessible online.

He has also published numerous research papers in leading computer science conferences and journals. His contributions have advanced the understanding and development of efficient algorithms for a variety of problems in computer science.