Skip to main content

Efficient dynamic method-lookup for object oriented languages

Extended abstract

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1136))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Amir, M. Farach, R. M. Idury, H. La Poutré, and A. A. Schäffer. Improved dictionary matching. Information and Computation, 119:258–282, 1995.

    Google Scholar 

  2. J. L. Bentley. Algorithms for the Klee's rectangle problems. Dept. Computer Science, Carnegie-Mellon Univ., unpublished notes, 1977.

    Google Scholar 

  3. Y. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proc. IEEE, vol. 80, no. 9, 1992.

    Google Scholar 

  4. J. Coplien. Advanced C++ Programming Styles and Idioms. Addison-Wesley Publishing Company.

    Google Scholar 

  5. B. J. Cox and A. J. Novobilski. Object-Oriented Programming: An Evolutionary Approach. Addison-Wesley, Reading, MA, 1991.

    Google Scholar 

  6. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Mayer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: upper and lower bounds. In Proc. IEEE Symp. on Found. of Computer Science, 524–531, 1988.

    Google Scholar 

  7. K. Driesen. Method lookup strategies in dynamically-typed object-oriented programming languages. Master's thesis, Vrije Universiteit Brussel, 1993.

    Google Scholar 

  8. H. Edelsbrunner. A new approach to rectangle intersections, Part I. Int. J. Computer Mathematics, vol. 13, 209–219, 1983.

    Google Scholar 

  9. P. Ferragina and R. Grossi. A fully-dynamic data structure for external substring search. In ACM Symp. on Theory of Computing, 693–702, 1995. Full version in Technical Report 18/96, Dipartimento di Sistemi e Informatica, Universitá di Firenze, Italy.

    Google Scholar 

  10. R. H. Gütting and D. Wood. The parentheses tree. Inform. Scie., vol. 27, 151–162, 1982.

    Google Scholar 

  11. K. Mehlhorn and A. Tsakalidis. Data Structures. In Handbook of Theoretical Computer Science. Ed. J. Van Leeuwen. Elsevier Science Publisher, 1990.

    Google Scholar 

  12. B. Meyer. Object-Oriented Software Construction. Prentice-Hall Inc., Englewood Cliffs, NJ, 1988.

    Google Scholar 

  13. M. Müller. Method dispatch in dynamically-typed object-oriented languages. Master's thesis, University of New Mexico Albuquerque, 1995.

    Google Scholar 

  14. S. Muthukrishnan and M. Müller. Time space tradeoffs for method look-up in objected oriented programs. Proc. 7th ACM Symp. on Discrete Algorithms, 1996.

    Google Scholar 

  15. M. H. Overmars. Computational geometry on a grid: an overview, NATO ASI Series, vol. F40, 167–184, 1988.

    Google Scholar 

  16. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Info. Proc. Letters, 6(3):80–82, 1977.

    Google Scholar 

  17. J. Vitek. Compact dispatch tables for dynamically-typed object-oriented languages. Research thesis, University of British Columbia, Vancouver, 1995.

    Google Scholar 

  18. D. E. Willard. New trie data structures which support very fast search operations. Journal of Computer and System Science, 28:379–394, 1984.

    Google Scholar 

  19. D. Ungar. The design and evaluation of a high performance Smalltalk system. ACM Distinguished Dissertation, The MIT Press, 1987.

    Google Scholar 

  20. D. Ungar, R. Blau, R. Foley, D. Samples, D. Patterson. Architecture of SOAR: Smalltalk on RISC. IEEE Proc. 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Josep Diaz Maria Serna

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferragina, P., Muthukrishnan, S. (1996). Efficient dynamic method-lookup for object oriented languages. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-61680-2_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61680-1

  • Online ISBN: 978-3-540-70667-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics