Office: Room G111, 18 Lilybank Gardens, Glasgow G12 8RZ
Teams: Lewis Dyer (PGR) [note that messages sent to my staff Teams account are likely to go unread]
Research title: Approximate Counting in Graph Databases
I am interested in subgraph counting algorithms, and their applications within graph databases. In particular, I am interested in algorithms involving approximate counting, with provable probabilistic bounds on the accuracy and precision of any output given. I am currently investigating the feasibility of implementing these algorithms within graph database systems, especially with large networks.
I am currently tutoring Algorithmic Foundations 2, a first course in discrete mathematics for computing science students.
Previously, I have been a tutor and/or a demonstrator for courses in algorithms and data structures, introductory courses in computer systems and networked and operating systems, and summer schools for incoming first year students in mathematics and computing science.