Manipulating multiple stacks with ordered-heap

DOI10.1016/0020-0255(93)90091-YMaRDI QIDQ1310924zbMATH OpenFDO

Authors Been-Chian Chien, Wei-Pang Yang, Rong-Jaye Chen

Publication date 13 January 1994

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

dynamic data structuremultiple stacksordered-heap

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Analysis of the multigroup method for manipulating multiple stacks
• The pairing heap: A new form of self-adjusting heap
• The worst case analysis of algorithm on multiple stacks manipulation
• Ordered priority queues
• Three Stacks

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Amortized Computational Complexity
• Self-Adjusting Heaps
• Self-adjusting binary search trees

Cited in

(5)

• scientific article; zbMATH DE number 7149819 (Why is no real title available?)
• Sorting twice through a stack
• Stack sorting with increasing and decreasing stacks
• Analysis of the multigroup method for manipulating multiple stacks
• The worst case analysis of algorithm on multiple stacks manipulation

This page was built for publication: Manipulating multiple stacks with ordered-heap

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310924)