Dynamic Partial Orders and Generalized Heaps
- 1 January 1990
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computationCommunications of the ACM, 1988
- Refined complexity analysis for heap operationsJournal of Computer and System Sciences, 1987
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- A variant of heapsort with almost optimal number of comparisonsInformation Processing Letters, 1987
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- Heaps on HeapsSIAM Journal on Computing, 1986
- An empirical comparison of priority-queue and event-set implementationsCommunications of the ACM, 1986
- Decomposable searching problemsInformation Processing Letters, 1979
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Algorithm 245: TreesortCommunications of the ACM, 1964