Sebastian Wild

Dr. Sebastian Wild is a Lecturer at the University of Liverpool, specializing in algorithms and data structures. His research focuses on developing space-efficient and adaptive methods for computing over compressed data, optimizing performance based on input characteristics. He has led projects on sorting, selection, and dictionary operations, with an emphasis on exact constant-factor analysis and practical efficiency.

• Research Grants:
  • Computing over Compressed Graph-Structured Data (EPSRC, 2024-2027)
  • Decomposition techniques for graphs (Royal Society, 2023-2025)
  • Lazy Finger Search Trees (Royal Society, 2021-2022)

Recent publications highlight advancements in adaptive sorting, approximation algorithms for scheduling, and cache-oblivious data structures. Themes include implicit representations, compressed graph processing, and run-adaptive methods. His work bridges theoretical analysis with real-world applications in databases, compression, and algorithm engineering.

• Professional Roles:
  • REF Impact Lead (Department, 2023-present)
  • Outreach Co-ordinator (Department, 2020-present)
  • Recruitment Lead (School/Institute, 2022-2024)

He teaches modules like COMP335: Communicating Computer Science and supervises theses, integrating his research into pedagogy.