New method in information processing for maintaining an efficient dynamic ordered set

DOI10.1007/s11432-009-0074-0zbMath1191.68215OpenAlexW2058294003MaRDI QIDQ848256

Guo-Jin Wang, Shi-Qing Xin

Publication date: 3 March 2010

Published in: Science in China. Series F (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-009-0074-0

zbMATH Keywords

information processingalgorithms and data structuresdynamic ordered setrich binary tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Uses Software

• Quicksort
• heapsort

Cites Work

• Notes on the complexity of sorting in abstract machines
• The complexity of searching a sorted array of strings
• Dynamic ordered sets with exponential search trees
• Cache-oblivious priority queue and graph algorithm applications
• Deterministic sorting in O ( n log log n ) time and linear space
• On RAM Priority Queues
• Integer priority queues with decrease key in constant time and the single source shortest paths problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New method in information processing for maintaining an efficient dynamic ordered set