Efficient dynamic method-lookup for object oriented languages: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 107-120

  Ferragina, Paolo ^a   Muthukrishnan, S ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84958044411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_50     Document Type: Conference Paper

References (20)

1. A. Amir, M. Farach, R. M. Idury, H. La Poutré, and A. A. Schhffer. Improved dictionary matching. Information and Computation, 119:258-282, 1995.
2. J. L. Bentley. Algorithms for the Klee's rectangle problems. Dept. Computer Science, Carnegie-Mellon Univ., unpublished notes, 1977.
3. Y. Chiang and R. Tamassia. Dynaanic algorithms in computational geometry. Proc. IEEE, vol. 80, no. 9, 1992.
4. J. Coplien. Advanced C-k-I- Programming Styles and Idioms. Addison-Wesley Publishing Company.
5. B. J. Cox and A. J. Novobilski. Object-Oriented Programming: An Evolutionary Approach. Addison-Wesley, Reading, MA, 1991.
6. M. Dietzfelbinger, A. Kartin, K. Mehlhorn, F. Mayer anf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: upper and lower bounds. In Proc. IEEE Syrup. on Found. of Computer Science, 524-531, 1988.
7. K. Driesen. Method lookup strategies in dynamically-typed object-oriented programming languages. Master's thesis, Vrije Universiteit Brussel, 1993.
8. H. Edelsbrunner. A new approach to rectangle intersections, Part I. Int. J. Computer Mathematics, vol. 13, 209-219, 1983.
9. P. Ferragina and R. Grossi. A fully-dynamic data structure for external substring search. In ACM Syrup. on Theory of Computing, 693-702, 1995. Full version in Technical Report 18/96, Dipartimento di Sistemi e Informatica, Université di Firenze, Italy.
10. R. H. Gritting and D. Wood. The parentheses tree. Inform. Scie., vol. 27, 151-162, 1982.
11. K. Mehlhorn and A. Tsakalidis. Data Structures. In Handbook of Theoretical Computer Science. Ed. J. Van Leeuwen. Elsevier Science Publisher, 1990.
12. B. Meyer. Object-Oriented Software Construction. Prentice-Hall Inc., Englewood Cliffs, N J, 1988.
13. M. Mriller. Method dispatch in dynamically-typed object-oriented languages. Master's thesis, University of New Mexico Albuquerque, 1995.
14. S. Muthukrishnan and M. Mfiller. Time space tradeoffs for method look-up in objected oriented programs. Proc. 7th ACM Syrup. on Discrete Algorithms, 1996.
15. M. H. Overmars. Computational geometry on a grid: an overview, NATO ASI Series, vol. F40, 167-184, 1988.
16. P. van Erode Boas. Preserving order in a forest in less than logarithmic time and linear space. Info. Proc. Letters, 6(3):80-82, 1977.
17. J. Vitek. Compact dispatch tables for dynamically-typed object-oriented languages. Research thesis, University of British Columbia, Vancouver, 1995.
18. D. E. Willaxd. New trie data structures which support very fast search operations. Journal of Computer and System Science, 28:379-394, 1984.
19. D. Ungar. The design and evaluation of a high performance Smalltalk system. ACM Distinguished Dissertation, The MIT Press, 1987.
20. D. Ungar, R. Blau, R. Foley, D. Samples, D. Patterson. Architecture of SOAR: Smalltalk on RISC. IEEE Proc. 1984.