"Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack."

Laurent Siklóssy (1972)

> Home

Details and statistics

DOI: 10.1016/0020-0190(72)90048-8

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Siklossy72
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Siklossy72
Laurent Siklóssy:
Fast and Read-Only Algorithms for Traversing Trees Without an Auxiliary Stack. Inf. Process. Lett. 1(4): 149-152 (1972)

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.