default search action

combined dblp search
author search
venue search
publication search

ask others

"Lower Bound on Expected Complexity of Depth-First Tree Search with ..."

Junil Ahn, Kiseon Kim (2012)

> Home

Details and statistics

DOI: 10.1109/LCOMM.2012.050912.120676

access: closed

type: Journal Article

metadata version: 2020-08-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/icl/AhnK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/icl/AhnK12
Junil Ahn, Kiseon Kim:
Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii. IEEE Commun. Lett. 16(6): 805-808 (2012)

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.