"Succinct and I/O Efficient Data Structures for Traversal in Trees."

Craig Dillabaugh, Meng He, Anil Maheshwari (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-92182-0_13

access: closed

type: Conference or Workshop Paper

metadata version: 2023-11-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/DillabaughHM08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/DillabaughHM08
Craig Dillabaugh, Meng He, Anil Maheshwari:
Succinct and I/O Efficient Data Structures for Traversal in Trees. ISAAC 2008: 112-123

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.