Amortization results for chromatic search trees, with an application to priority queues
type: Item
instance of: scholarly article
title: Amortization results for chromatic search trees, with an application to priority queues
zbMATH Open document ID: 0897.68034
author: Rolf Fagerberg
author: Kim S. Larsen
author: Joan Boyar
published in: Journal of Computer and System Sciences
publication date: 1998-08-04T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1140559
zbMATH Keywords: shared-memory asynchronous parallel architectures
describes a project that uses: heapsort
MaRDI profile type: Publication
full work available at URL: jcss.1997.1511
OpenAlex ID: W2055947636
cites work: Q4065051
cites work: Symmetric binary B-trees: Data structure and maintenance algorithms
cites work: Organization and maintenance of large ordered indexes
cites work: Scheduling multithreaded computations by work stealing
cites work: Efficient rebalancing of chromatic search trees
cites work: A new data structure for representing sorted lists
cites work: On-the-fly optimization of data structures
cites work: Concurrent manipulation of binary search trees
cites work: A New Method for Concurrency in B-Trees
cites work: AVL trees with relaxed balance
cites work: EFFICIENT REBALANCING OF B-TREES WITH RELAXED BALANCE
cites work: Efficient locking for concurrent operations on B-trees
cites work: Chromatic binary search trees: A structure for concurrent rebalancing
cites work: Relaxed avl trees, main-memory databases and concurrency
cites work: Concurrent access of priority queues
cites work: Concurrent operations on \(B^ *\)-trees with overtaking
cites work: B-trees in a system with multiple users
DOI: 10.1006/JCSS.1997.1511
description: scientific article; zbMATH DE number 1140559