The m-Version of Binary Search Trees: An Average Case Analysis. (19th December 2012)
- Record Type:
- Journal Article
- Title:
- The m-Version of Binary Search Trees: An Average Case Analysis. (19th December 2012)
- Main Title:
- The m-Version of Binary Search Trees: An Average Case Analysis
- Authors:
- Prodinger, Helmut
- Other Names:
- Dondi R. Academic Editor.
Godbole A. P. Academic Editor.
Richter S. Academic Editor. - Abstract:
- Abstract : Following a suggestion of Cichoń and Macyna, binary search trees are generalized by keeping m (classical) binary search trees and distributing incoming data at random to the individual trees. Costs for unsuccessful and successful search are analyzed, as well as the internal path length.
- Is Part Of:
- ISRN combinatorics. Volume 2013(2013)
- Journal:
- ISRN combinatorics
- Issue:
- Volume 2013(2013)
- Issue Display:
- Volume 2013, Issue 2013 (2013)
- Year:
- 2013
- Volume:
- 2013
- Issue:
- 2013
- Issue Sort Value:
- 2013-2013-2013-0000
- Page Start:
- Page End:
- Publication Date:
- 2012-12-19
- Subjects:
- Combinatorial analysis -- Periodicals
Combinatorial analysis
Electronic journals
Periodicals
511.6 - Journal URLs:
- https://www.hindawi.com/journals/isrn/contents/isrn.combinatorics/ ↗
http://bibpurl.oclc.org/web/52337 ↗ - DOI:
- 10.1155/2013/450627 ↗
- Languages:
- English
- ISSNs:
- 2090-8911
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 24063.xml