Lock-Free Binary Search Tree Based on Leaf Search

E-ISSN： 1942-3934|8|2|44-58

ISSN： 1942-3926

Source： International Journal of Open Source Software and Processes (IJOSSP), Vol.8, Iss.2, 2017-04, pp. : 44-58

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The height of a binary search tree: the limiting distribution perspective

By Knessl C. Szpankowski W.

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 649-703

Elsevier

Access to resources Recommend Favorite

High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

International Journal of Grid and High Performance Computing (IJGHPC), Vol. 8, Iss. 4, 2016-10 ,pp. : 55-77

IGI Global_journal

Access to resources Recommend Favorite

NBmalloc: Allocating Memory in a Lock-Free Manner

By Gidenstam Anders Papatriantafilou Marina Tsigas Philippas

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 304-338

Springer Publishing Company

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite

Tree search and quantum computation

By Tarrataca Luís

Quantum Information Processing, Vol. 10, Iss. 4, 2011-08 ,pp. : 475-500

Springer Publishing Company

Access to resources Recommend Favorite