Skip to content
Back home
  • Home
  • Research
    • Graph Analytics
      • Accelerating Subgraph Isomorphism Search Using Graphlets
      • ParaGrapher
      • MS-BioGraphs
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise and Approximate Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
      • FERNS
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
    • FERNS
  • Publications
    • Articles
    • Dissertations
    • Source Code
    • Datasets
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact
  • Search
Back home
  • Search
  • Home
  • Research
    • Graph Analytics
      • Accelerating Subgraph Isomorphism Search Using Graphlets
      • ParaGrapher
      • MS-BioGraphs
      • Approximate Max Weighted Clique
      • Graptor
      • LaganLighter
      • GraphGrind
    • Transprecise and Approximate Computing
      • DiPET
      • SoftNum
      • SWEET
      • RAPID
      • FERNS
    • Machine Learning
      • Language Modeling
      • PaCoBi
    • Technical Posts
  • Projects
    • Kelvin Living Lab
    • SWEET
    • ASCCED
    • DiPET
    • RAPID
    • RELAX
    • SoftNum
    • PaCoBi
    • FERNS
  • Publications
    • Articles
    • Dissertations
    • Source Code
    • Datasets
  • Talks
  • About
    • People
      • Hans Vandierendonck
      • Group
    • Jobs
    • Contact
Home » Talks

Talks

DateSubjectSpeaker
May, 2026Towards Agentic AI at the Edge: Challenges and OpportunitiesShiqiang Wang
March, 2026Bringing LLM Inference to Wafer Scale SystemsLuo Mai
August,
2025
A Constraint Programming Solver You Can Trust (But Don’t Have To)Ciaran McCreesh
May, 2025Fine-Grained and Phase-Aware Frequency Scaling for Energy-efficient Computing on Heterogeneous Multi-GPU SystemsLorenzo Carpentieri
February, 2024Efficient Computation through Tuned ApproximationDavid Keyes
June, 2021Enabling high-performance large-scale irregular computationsMaciej Besta
June, 2021Adaptiveness and Lock-free Synchronization in Parallel Stochastic Gradient DescentKarl Bäckström
May, 2021Efficient Parallel Graph Processing on GPU using Approximate ComputingSomesh Singh
April, 2021Parallel Graph Learning and Computational Biology Through Sparse MatricesAydın Buluç
Feb., 2021Metaprogramming in Jupyter NotebooksJeremy Singer
Feb., 2021Addressing Practical HPC Problems: Fault Tolerance, Performance Portability, Parallelism CompilationGiorgis Georgakoudis
Jan., 2021Parallel Algorithms for Density-Based and Structural ClusteringJulian Shun
Dec., 2020High-performance graph processing overviewHans Vandierendonck
May, 2018Graph processing at the CSIT SummitHans Vandierendonck
July, 2018Graph processing lecture at MaRIONet Summer SchoolHans Vandierendonck
July, 2017GraphGrind: Taming Irregular Memory Accesses in Graph Analytics WorkloadsHans Vandierendonck
Links
  • Jobs
  • People
  • Contact
  • Articles

Meet us —
Prof. Hans Vandierendonck
Computer Science Building
Queen's University Belfast
16A Malone Road
Belfast BT9 5BN
Northern Ireland, UK
Tel: +44 (0)28 9097 4654

© 2026 DIPSA: Data-Intensive Parallel Systems and Algorithms – All rights reserved

Powered by WP – Designed with the Customizr Theme