Three Partition Refinement Algorithms
- 1 December 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (6), 973-989
- https://doi.org/10.1137/0216062
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Doubly Lexical Orderings of MatricesSIAM Journal on Computing, 1987
- Upper bounds for sorting integers on random access machinesTheoretical Computer Science, 1983
- Partitioning a graph in O(¦A¦log2¦V¦)Theoretical Computer Science, 1982
- A new data structure for representing sorted listsActa Informatica, 1982
- Hysterical B-treesInformation Processing Letters, 1981
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Describing an algorithm by HopcroftActa Informatica, 1973
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATONPublished by Elsevier ,1971