Scholar
Ziad Ismaili Alaoui
Google Scholar ID: ubrIbOoAAAAJ
Department of Computer Science, University of Liverpool
Citations & Impact
Citations
5
H-index
2
i10-index
0
Publications
7
Co-authors
2
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Publications: Space-Efficient Hierholzer: Eulerian Cycles in O(m) Time and O(n) Space (SOSA 2026), Succinct Preferential-Attachment Graphs (WG 2025), Hardness of Finding Kings and Strong Kings (FSTTCS 2025), Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms (LMCS), Linear-Time Graph Programs without Preconditions (GCM 2024), Linear-Time Graph Programs for Unbounded-Degree Graphs (ICGT 2024). Talks: Presented his research findings at several international conferences.
Research Experience
- Graduate Teaching Assistant at the University of Liverpool (since January 2025), assisting with tutorials for the module “Foundations of Computer Science”; Graduate Teaching Assistant at the University of York (February 2024 to May 2024), demonstrating for the module “Object Oriented Data Structures & Algorithms”.
Education
- University of Liverpool: PhD in Computer Science (since October 2024), University of York: MScR in Computer Science (September 2023 to September 2024), supervised by Detlef Plump; University of York: BSc in Computer Science (September 2020 to July 2023).
Background
- PhD student in Theoretical Computer Science, with research interests including graph transformation, graph rewriting, graph algorithms, succinct data structures, compression, tournaments, and query complexity (deterministic, randomized, and quantum).
