"Constant-Working-Space Algorithms: How Fast Can We Solve Problems without ..."

Tetsuo Asano (2008)

> Home

Details and statistics

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

access: open

type: Conference or Workshop Paper

metadata version: 2018-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/Asano08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/Asano08
Tetsuo Asano:
Constant-Working-Space Algorithms: How Fast Can We Solve Problems without Using Any Extra Array?. ISAAC 2008: 1

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.