EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Binary Search Tree"
Narrow search

Narrow search

Year of publication
Subject
All
Binary Search Tree 1 CAS 1 Concurrent Data Structure 1 FIND process 1 Lock-Free 1 Recursive processes 1 depth first search process 1 random binary search tree 1
more ... less ...
Online availability
All
Undetermined 2
Type of publication
All
Article 2
Language
All
English 1 Undetermined 1
Author
All
Eickmeyer, Kord 1 Liang, Yanan 1 Rüschendorf, Ludger 1 Wei, Mengmeng 1 Yu, Xin 1 Zhang, Dongwen 1 Zhang, Yang 1
more ... less ...
Published in...
All
International Journal of Open Source Software and Processes (IJOSSP) 1 Statistics & Decisions 1
Source
All
Other ZBW resources 2
Showing 1 - 2 of 2
Cover Image
Lock-Free Binary Search Tree Based on Leaf Search
Zhang, Yang; Yu, Xin; Zhang, Dongwen; Wei, Mengmeng; … - In: International Journal of Open Source Software and … 8 (2017) 2, pp. 44-58
Binary search tree is one of the most important data structures in program design. This article proposes a novel lock …
Persistent link: https://www.econbiz.de/10012046978
Saved in:
Cover Image
A limit theorem for recursively defined processes in L p
Eickmeyer, Kord; Rüschendorf, Ludger - In: Statistics & Decisions 25 (2007) 3, pp. 217-235
Summary In this paper we derive a limit theorem for recursively defined processes. For several instances of recursive processes like for depth first search processes in random trees with logarithmic height or for fractal processes it turns out that convergence can not be expected in the space of...
Persistent link: https://www.econbiz.de/10014621340
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...