Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Junil Ahn, Kiseon Kim. Lower Bound on Expected Complexity of Depth-First Tree Search with Multiple Radii. IEEE Communications Letters, 16(6):805-808, 2012. [doi]
No references recorded for this publication.
No citations of this publication recorded.