"Automatic derivation of I/O complexity bounds for affine programs. (Calcul ..."

Auguste Olivry (2022)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-12-14

- view
  - electronic edition @ archives-ouvertes.fr
- export record
  dblp key:
  - phd/hal/Olivry22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/hal/Olivry22
Auguste Olivry:
Automatic derivation of I/O complexity bounds for affine programs. (Calcul automatique de bornes sur la complexité I/O de programmes affines). Grenoble Alpes University, France, 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.