"The parallel complexity of queue versus stack breadth-first search."

Raymond Greenlaw (1990)

> Home

Details and statistics

DOI: 10.1109/SPDP.1990.143654

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-24

- view
  authority control:
- export record
  dblp key:
  - conf/spdp/Greenlaw90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spdp/Greenlaw90
Raymond Greenlaw:
The parallel complexity of queue versus stack breadth-first search. SPDP 1990: 834-837

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.