Using Multiset Discrimination to Solve Language Processing Problems Without Hashing

@article{Cai1995UsingMD,
  title={Using Multiset Discrimination to Solve Language Processing Problems Without Hashing},
  author={J. Cai and R. Paige},
  journal={Theor. Comput. Sci.},
  year={1995},
  volume={145},
  pages={189-228}
}
It is generally assumed that hashing is essential to solve many language processing problems efficiently; e.g. symbol table formation and maintenance, grammar manipulation, basic block optimization, and global optimization. This paper questions this assumption, and initiates development of an efficient alternative compiler methodology without hashing or sorting. The methodology rests on efficient solutions to the basic problem of detecting duplicate values in a multiset, which we call multiset… Expand
55 Citations
Generic top-down discrimination for sorting and partitioning in linear time*
  • F. Henglein
  • Computer Science
  • Journal of Functional Programming
  • 2012
Clone detection using rolling hashing, suffix trees and dagification: A case study
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
Generic discrimination: sorting and paritioning unshared data in linear time
Reordering rows for better compression: Beyond the lexicographic order
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 44 REFERENCES
Look ma, no hashing, and no arrays neither
Pattern Matching in Trees
The program complexity of searching a table
  • Harry G. Mairson
  • Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
Universal Classes of Hash Functions
Macros that work
Real-time Simulation of a Set Machine on a Ram
...
1
2
3
4
5
...