"Proving Tree Algorithms for Succinct Data Structures."

Reynald Affeldt et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ITP.2019.5

access: open

type: Conference or Workshop Paper

metadata version: 2019-09-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/itp/AffeldtGQT19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itp/AffeldtGQT19
Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, Kazunari Tanaka:
Proving Tree Algorithms for Succinct Data Structures. ITP 2019: 5:1-5:19

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.