Bernd Burgstaller

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jay Hwan Lee

> Home > Persons > Bernd Burgstaller

Publications

2025
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/cal/NamLYKJKB25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cal/NamLYKJKB25
Hyunwoo Nam, Jay Hwan Lee, Shinhyung Yang, Yeonsoo Kim, Jiun Jeong, Jeong-Geun Kim, Bernd Burgstaller:
Comprehensive Design Space Exploration for Graph Neural Network Aggregation on GPUs. IEEE Comput. Archit. Lett. 24(1): 45-48 (2025)
2023
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/ppopp/LeeKRSJPBS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppopp/LeeKRSJPBS23
Jay Hwan Lee, Yeonsoo Kim, Younghyun Ryu, Wasuwee Sodsong, Hyunjun Jeon, Jinsik Park, Bernd Burgstaller, Bernhard Scholz:
Julia Cloud Matrix Machine: Dynamic Matrix Language Acceleration on Multicore Clusters in the Cloud. PMAM@PPoPP 2023: 1-10
2022
[i9]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2205-07421
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2205-07421
Jay Hwan Lee, Yeonsoo Kim, Younghyun Ryu, Wasuwee Sodsong, Hyunjun Jeon, Jinsik Park, Bernd Burgstaller, Bernhard Scholz:
Cloud Matrix Machine for Julia and Implicit Parallelization for Matrix Languages. CoRR abs/2205.07421 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.