Time and space efficient multi-method dispatching

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

Volumn 2368, Issue , 2002, Pages 20-29

  Alstrup, Stephen ^a   Brodal, Gerth Stølting ^b   Li Gørtz, Inge ^a   Rauhe, Theis ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

CRITICAL COMPONENT; DISPATCHING PROBLEM; EFFICIENT DATA STRUCTURES; EXECUTION PERFORMANCE; LINEAR SPACES; LOGARITHMIC TIME; MULTI METHODS; SPACE EFFICIENT;

PROBLEM ORIENTED LANGUAGES;

EID: 84943269097     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_3     Document Type: Conference Paper

References (18)

1. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems (extended abstract). In IEEE Symposium on Foundations of Computer Science (FOCS), pages 534–543, 1998.
2. D. G. Bobrow, L. G. DeMichiel, R. P. Gabriel, S. E. Keene, G. Kiczales, and D. A. Moon. Common LISP object system specification X3J13 document 88-002R. ACM SIGPLAN Notices, 23, 1988. Special Issue, September 1988.
3. Craig Chambers. Object-oriented multi-methods in Cecil. In Ole Lehrmann Madsen, editor, ECOOP’92, European Conference on Object-Oriented Programming, Utrecht, The Netherlands, volume 615 of Lecture Notes in Computer Science, pages 33–56. Springer-Verlag, New York, NY, 1992.
4. Inc. Apple Computer. Dylan interim reference manual, 1994.
5. P. F. Dietz. Fully persistent arrays. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Proceedings of the Workshop on Algorithms and Data Structures, volume 382 of Lecture Notes in Computer Science, pages 67–74, Berlin, August 1989. Springer- Verlag.
6. Paul F. Dietz and Rajeev Raman. Persistence, amortization and randomization. In Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 78–88, 1991.
7. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In 29th Annual Symposium on Foundations of Computer Science (FOCS), pages 524–531. IEEE Computer Society Press, 1988.
8. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. J. Computer Systems Sci., 38(1):86–124, 1989.
9. David Eppstein and S. Muthukrishnan. Internet packet filter manegement and rectangle geometry. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001.
10. P. Ferragina and S. Muthukrishnan. Efficient dynamic method-lookup for object oriented languages. In European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 107–120, 1996.
11. P. Ferragina, S. Muthukrishnan, and M. de Berg. Multi-method dispatching: A geometric approach with applications to string matching problems. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 483-491, New York, May 1–4 1999. ACM Press.
12. R. Fleischer. A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science, 7:137–149, 1996.
13. C. Levcopoulos and M. Overmars. A balanced search tree with O(1) worstcase update time. Acta Informatica, 26:269–277, 1988.
14. K. Mehlhorn and S. Näher. Bounded ordered dictionaries in O(log log n) time and O(n) space. Information Processing Letters, 35:183–189, 1990.
15. S. Muthukrishnan and Martin Müller. Time and space efficient method-lookup for object-oriented programs (extended abstract). In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 42–51, Atlanta, Georgia, January 28–30 1996.
16. R. Raman. Eliminating Amortization: On Data Structures with Guaranteed Response Time. PhD thesis, University of Rochester, Computer Science Department, October 1992. Technical Report TR439.
17. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29:669–679, 1986.
18. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80–82, 1978.