Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/301250.301378acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

Multi-method dispatching: a geometric approach with applications to string matching problems

Published: 01 May 1999 Publication History
  • Get Citation Alerts
  • First page of PDF

    References

    [1]
    R. Agrawal, L. Demichiel and B. Lindsay. Static type checking of multi-methods. Proc. A CM Syrup. on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), ACM Press. Addison Wesley, 1991.
    [2]
    A.V. Aho and M. J. Corasick. Efiq. cient string matching: an aid to bibliographic searching. Communications of the A CM, 18:333-340, 1975.
    [3]
    E. Amiel and E. Dujardin. Supporting explicit disambiguation of multi-methods. Proc. ECOOP, 1996.
    [4]
    E. Amiel, E. Dujardin and E. Simon. Fast algorithms for compressed muiti-method dispatch tables generation. Technical Report # 2977, INRIA, Sept. 1996.
    [5]
    A. Amir and M. Faxach. Two-dimensional dictionaxy matching. Inform. Proc. Lett., 44(5), 233- 239, December 1992.
    [6]
    A. Amir, M. Farach, R.M. Idury, J.A. La Poutr6, and A.A Sch'fiffer. Improved dynamic dictionary m~ching. Information and Computation, 119:258-282~ 1995.
    [7]
    Apple Computer. Dylan Interim Reference Manual, June, 1994.
    [8]
    P~. A. Baeza-Yates and G. Navarro. A faster algorithm for approximate string matching. Proc. of Combinatorial Pattern Matching Conference, LNCS 1075, 1-23, 1996.
    [9]
    R.A. Baeza-Y~tes and G. Navaxro. Multiple approximate string matching. Proc. Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, 1997.
    [10]
    T.P. Baker. A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Uomp., 7:533-541, I978.
    [11]
    M. de Berg, M. van Kreveld, M. Overmaxs, and O. Schwarzkopf. Computational Goemtry: Theory and Applications. Springer-Verlag, Heidelberg, 1997.
    [12]
    D. Bobrow, L. DeMichiel, P. Gabriel, S. Kenne, G. Kiczales, and D. Moon. Common Lisp object system specification. ACM SIGPLAN Notices, 23, 1988.
    [13]
    D. Bobrow, K. Kahn, G. Kiczales, L. Masinter, M. Stefik~ and F. Zdybel. CommonLoops: Merging Lisp and object-oriented programming. Proc. A CM Syrup. on Object-Oriented Programming Systems, Languages, and Applications (OOP- SLA), ACM Press, I986.
    [14]
    G. S. Brodal and L. G~sieniec. Approximate dictionary queries. Proc. Combinatorial Pattern Matching Conference, LNCS 1075, 65-74, 1996.
    [15]
    J. Boylas~d and G. Castagna. Paxasitic Methods: An implementation of multi-methods for Java. Proc. OOPSLA 96, 66~76, I996.
    [16]
    K. Bruce, L. Cardelli, G. Castagna, The Hopkins Objects Group~ G. Leavens a~d B. Pierce. On binary methods. Theory and Practice of Object Systems, 1(3):221-242, 1995
    [17]
    G. Castagna and G. Leavens. Foundations of object-oriented languages. A CM SIGPLAN Notices, 30(2):5-11, Feb., 1995.
    [18]
    C. Chambers. Object-oriented multi-methods in Cecil. Proc. ECOOP, 33-56, 1992.
    [19]
    C. Chambers. Synergies between object-oriented programming language design and implementation research. Invited talk at ISOTA$ conference, Japan, March 1996.
    [20]
    C. Chambers and G. Leavens. Typechecking and modules for multimethods. ACM TOPLAS, 17(6), 1995.
    [21]
    B. Chazelle. Filtering search: a new approach to query-answering. SIAM Journal Uomputing 15, 703-724, 1986.
    [22]
    G. Castagna. Object-priented programming:a unified foundation. Birkhauser, Boston, 1997.
    [23]
    B. Chazelle and L. J. Guibas. Fractional Cascading I: A data structuring technique. Algorithmica, 133-162, 1986.
    [24]
    W. Chen, V. Turau and W. Klas. Effcient dynamic look-up strategy for multi-methods. Proc. ECOOP, 408-431, 1994.
    [25]
    K. Driesen. Method lookup strategies in dynamically-typed object-oriented programming languages. Master's thesis, Vrije Universiteit Brussel, 1993.
    [26]
    E. Dujardin. Effcient dispatch of multimethods in constant time using dispatch trees. Technical Report # 2892, INRIA, May 1996.
    [27]
    M. Ernst, C. Kaplan and C. Chambers. Predicate Dispatching: A Unified Theory of Dispatch. Proc. ECOOP 98, 1998.
    [28]
    H. Edelsbrunner and H. Maurer. On the intersection of orthogonal objects. Information Processing Letters 13, 177-181, 1981.
    [29]
    P. Ferragina and S. Muthukrishnan. Efficient dynamic method-iookup for OOLs. Proc. European Symposium on Algorithms, LNCS 1136, 107- 120,1996.
    [30]
    H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. Proc. A CM Syrup. on Theory of Computing, 135-143, 1984.
    [31]
    R. Giancarlo. The suffix tree of a square matrix with applications. Proc. A CM-SIAM Syrup. on Discrete Algorithms, 402-411, 1993.
    [32]
    G.H. Gonnet and ft. Baeza-Yates. Handbook of Algorithms and Data Structures, Addison-Wesley, 2nd edition, 1991.
    [33]
    R.M. Idury and A. A. Sch'SaCfer. Multiple matching of rectangular patterns. A CM Symposium on Theory of Computing, 81-89, 1993. Also, Information and Computation 117, 78-90, 1995.
    [34]
    G. Leavens and T. Millstein. Multiple dispatch as dispatch on tuples. Proc. OOPSLA 98~ 1998.
    [35]
    U. Manber and S. Wu. AI~orithrn for approximate membership checking with ~pplication to password security. Inform. Proc. Lett., 50(4):191~197, M~y 1994.
    [36]
    E.M. McCreight. Priority Search Trees. SteAM Journal of Computing, 14(2):257-276, 1985.
    [37]
    K. Mehlhorn. Data Structures and Algorithms 3: Multidimensional $earchin9 and Computational Geometry. Springer-Verlag, 1984.
    [38]
    W. Mu~ridge, J. Hamer and J. Hosking. Multime~hods in a statically-typed programming languages. Proc. ECOOP, 1991.
    [39]
    M. Mfiller. Method dispatch in dynamicallytyped object-oriented languages. M~ster's thesis, University of New Mexico Albuquerque, 1995.
    [40]
    R. Muth and U. Manber. Approximate multiple strings search. Proc. Combinatorial Pattern Matching Conference, LNCS 1075, 75-86, 1996.
    [41]
    $. Muthukrishnan and M. M/filer. Time space tradeoffs for method look-up in objected oriented programs. Proc. A CM Syrup. on Discrete Algorithms, 42-5I, 1996.
    [42]
    G. Myers. A sublinear algorithm for approximate key word searching. Algorithmica, 12(4/5):345- 374, 1994.
    [43]
    G. Navarro. Multiple approximate string matching by counting. Proc. South American Workshop on String Processing, 95-111, 1997.
    [44]
    M.H. Overmars. Efficient data structures for range searching on a grid. Journal of Algorithms 9, 254-275, 1988.
    [45]
    P.A. Pevzner and M. S. Waterman. MultAple filtration and approximate pattern matching,. Algorithmica, 13(112):135-154, January 1995.
    [46]
    V.K. Vashnaivi. Computing point enclosures. IEEE Trans. Comp., 22-29, 1982.
    [47]
    J. Vitek. Compact dispatch tables for dynamically-typed object-oriented languages. Research thesis, University of British Columbia, Vancouver, 1995.
    [48]
    A.C. Yao and F. F. Yao. Dictionary look~up with small errors. Proc. Combinatorial Pattern Matching Conference~ LNCS 937, 387-394, 1995. Also, JounaI of Algorithms, 25(1), 1997, 194-202.
    [49]
    D.E. WJ}lard: Log-Logarithmic worst-case range queries are possible in space O(N). Information Processing Letters, 17(2): 81-84, 1983.

    Cited By

    View all

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing
    May 1999
    790 pages
    ISBN:1581130678
    DOI:10.1145/301250
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 May 1999

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    STOC99
    Sponsor:
    STOC99: ACM Symposium on Theory of Computing
    May 1 - 4, 1999
    Georgia, Atlanta, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)45
    • Downloads (Last 6 weeks)7
    Reflects downloads up to 09 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media