A linear time solution to the single function coarsest partition problem
Open Access
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 40, 67-84
- https://doi.org/10.1016/0304-3975(85)90159-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The promotion and accumulation strategies in transformational programmingACM Transactions on Programming Languages and Systems, 1984
- Experience with the SETL OptimizerACM Transactions on Programming Languages and Systems, 1983
- Finite Differencing of Computable ExpressionsACM Transactions on Programming Languages and Systems, 1982
- Fast canonization of circular stringsJournal of Algorithms, 1981
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Lexicographically least circular substringsInformation Processing Letters, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Automatic data structure choice in a language of very high levelCommunications of the ACM, 1975
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955