"QP tries are smaller and faster than crit-bit trees."

Tony Finch (2016)

> Home

Details and statistics

DOI: —

access: closed

type: Informal or Other Publication

metadata version: 2024-12-11

- view
  - electronic edition @ tinytocs.org (archived)
  - lookup Internet Archive Scholar
- export record
  dblp key:
  - journals/tinytocs/Finch16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tinytocs/Finch16
Tony Finch:
QP tries are smaller and faster than crit-bit trees. Adv. Math. Commun. 4 (2016)

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.