Advertisement

Efficient dynamic method-lookup for object oriented languages

Extended abstract
  • Paolo Ferragina
  • S. Muthukrishnan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)

Keywords

Query Point Query Time Optimal Space Object Oriented Language Hierarchy Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 2.
    J. L. Bentley. Algorithms for the Klee's rectangle problems. Dept. Computer Science, Carnegie-Mellon Univ., unpublished notes, 1977.Google Scholar
  3. 3.
    Y. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proc. IEEE, vol. 80, no. 9, 1992.Google Scholar
  4. 4.
    J. Coplien. Advanced C++ Programming Styles and Idioms. Addison-Wesley Publishing Company.Google Scholar
  5. 5.
    B. J. Cox and A. J. Novobilski. Object-Oriented Programming: An Evolutionary Approach. Addison-Wesley, Reading, MA, 1991.Google Scholar
  6. 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. 7.
    K. Driesen. Method lookup strategies in dynamically-typed object-oriented programming languages. Master's thesis, Vrije Universiteit Brussel, 1993.Google Scholar
  8. 8.
    H. Edelsbrunner. A new approach to rectangle intersections, Part I. Int. J. Computer Mathematics, vol. 13, 209–219, 1983.Google Scholar
  9. 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. 10.
    R. H. Gütting and D. Wood. The parentheses tree. Inform. Scie., vol. 27, 151–162, 1982.Google Scholar
  11. 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. 12.
    B. Meyer. Object-Oriented Software Construction. Prentice-Hall Inc., Englewood Cliffs, NJ, 1988.Google Scholar
  13. 13.
    M. Müller. Method dispatch in dynamically-typed object-oriented languages. Master's thesis, University of New Mexico Albuquerque, 1995.Google Scholar
  14. 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. 15.
    M. H. Overmars. Computational geometry on a grid: an overview, NATO ASI Series, vol. F40, 167–184, 1988.Google Scholar
  16. 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. 17.
    J. Vitek. Compact dispatch tables for dynamically-typed object-oriented languages. Research thesis, University of British Columbia, Vancouver, 1995.Google Scholar
  18. 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. 19.
    D. Ungar. The design and evaluation of a high performance Smalltalk system. ACM Distinguished Dissertation, The MIT Press, 1987.Google Scholar
  20. 20.
    D. Ungar, R. Blau, R. Foley, D. Samples, D. Patterson. Architecture of SOAR: Smalltalk on RISC. IEEE Proc. 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Paolo Ferragina
    • 1
  • S. Muthukrishnan
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly
  2. 2.Dept. of Computer ScienceUniv. of WarwickUK

Personalised recommendations