"Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower ..."

Grzegorz Kwasniewski et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3409964.3461796

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/spaa/KwasniewskiBGCS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spaa/KwasniewskiBGCS21
Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler:
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. SPAA 2021: 328-339

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.