Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
- 4 November 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 37 (11), 142-160
- https://doi.org/10.1145/583854.582434
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Efficient message dispatch in object-oriented systemsACM SIGPLAN Notices, 2000
- Fast algorithms for compressed multimethod dispatch table generationACM Transactions on Programming Languages and Systems, 1998
- Compact dispatch tables for dynamically typed object oriented languagesLecture Notes in Computer Science, 1996
- Efficient dynamic method-lookup for object oriented languagesLecture Notes in Computer Science, 1996
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- Type-extension type test can be performed in constant timeACM Transactions on Programming Languages and Systems, 1991
- Efficient implementation of lattice operationsACM Transactions on Programming Languages and Systems, 1989
- New trie data structures which support very fast search operationsJournal of Computer and System Sciences, 1984
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976