Using multiset discrimination to solve language processing problems without hashing
Open Access
- 1 July 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 145 (1-2) , 189-228
- https://doi.org/10.1016/0304-3975(94)00183-j
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Minimisation of acyclic deterministic automata in linear timeTheoretical Computer Science, 1992
- Constant propagation with conditional branchesACM Transactions on Programming Languages and Systems, 1991
- A linear time solution to the single function coarsest partition problemTheoretical Computer Science, 1985
- Pattern Matching in TreesJournal of the ACM, 1982
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- An algorithm for reduction of operator strengthCommunications of the ACM, 1977
- High level iterators and a method for automatically designing data structure representationComputer Languages, 1975
- Global common subexpression eliminationACM SIGPLAN Notices, 1970
- A Theorem on Boolean MatricesJournal of the ACM, 1962