Paolo Ferragina
S. Muthukrishnan
- A91.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. Google Scholar
Digital Library
- AC75.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. Google ScholarDigital Library
- AD96.E. Amiel and E. Dujardin. Supporting explicit disambiguation of multi-methods. Proc. ECOOP, 1996. Google ScholarDigital Library
- ADS96.E. Amiel, E. Dujardin and E. Simon. Fast algorithms for compressed muiti-method dispatch tables generation. Technical Report # 2977, INRIA, Sept. 1996.Google Scholar
- AF92.A. Amir and M. Faxach. Two-dimensional dictionaxy matching. Inform. Proc. Lett., 44(5), 233- 239, December 1992. Google ScholarDigital Library
- AFILS92.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. Google ScholarDigital Library
- Ap94.Apple Computer. Dylan Interim Reference Manual, June, 1994.Google Scholar
- BN96.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. Google ScholarDigital Library
- BN97a.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. Google ScholarDigital Library
- B78.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.Google ScholarCross Ref
- BK+97.M. de Berg, M. van Kreveld, M. Overmaxs, and O. Schwarzkopf. Computational Goemtry: Theory and Applications. Springer-Verlag, Heidelberg, 1997. Google ScholarDigital Library
- BD+88.D. Bobrow, L. DeMichiel, P. Gabriel, S. Kenne, G. Kiczales, and D. Moon. Common Lisp object system specification. ACM SIGPLAN Notices, 23, 1988. Google ScholarDigital Library
- BK+86.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. Google ScholarDigital Library
- BG96.G. S. Brodal and L. G~sieniec. Approximate dictionary queries. Proc. Combinatorial Pattern Matching Conference, LNCS 1075, 65-74, 1996. Google ScholarDigital Library
- BC96.J. Boylas~d and G. Castagna. Paxasitic Methods: An implementation of multi-methods for Java. Proc. OOPSLA 96, 66~76, I996. Google ScholarDigital Library
- BC+95.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 Google ScholarDigital Library
- CL95.G. Castagna and G. Leavens. Foundations of object-oriented languages. A CM SIGPLAN Notices, 30(2):5-11, Feb., 1995. Google ScholarDigital Library
- Ch92.C. Chambers. Object-oriented multi-methods in Cecil. Proc. ECOOP, 33-56, 1992. Google ScholarDigital Library
- Ch96.C. Chambers. Synergies between object-oriented programming language design and implementation research. Invited talk at ISOTA$ conference, Japan, March 1996. Google ScholarDigital Library
- ChL95.C. Chambers and G. Leavens. Typechecking and modules for multimethods. ACM TOPLAS, 17(6), 1995. Google ScholarDigital Library
- C86.B. Chazelle. Filtering search: a new approach to query-answering. SIAM Journal Uomputing 15, 703-724, 1986. Google ScholarDigital Library
- C97.G. Castagna. Object-priented programming:a unified foundation. Birkhauser, Boston, 1997. Google ScholarDigital Library
- CG86.B. Chazelle and L. J. Guibas. Fractional Cascading I: A data structuring technique. Algorithmica, 133-162, 1986.Google ScholarCross Ref
- CTK94.W. Chen, V. Turau and W. Klas. Effcient dynamic look-up strategy for multi-methods. Proc. ECOOP, 408-431, 1994. Google ScholarDigital Library
- D93.K. Driesen. Method lookup strategies in dynamically-typed object-oriented programming languages. Master's thesis, Vrije Universiteit Brussel, 1993.Google Scholar
- D96.E. Dujardin. Effcient dispatch of multimethods in constant time using dispatch trees. Technical Report # 2892, INRIA, May 1996.Google Scholar
- EKC98.M. Ernst, C. Kaplan and C. Chambers. Predicate Dispatching: A Unified Theory of Dispatch. Proc. ECOOP 98, 1998. Google ScholarDigital Library
- EM81.H. Edelsbrunner and H. Maurer. On the intersection of orthogonal objects. Information Processing Letters 13, 177-181, 1981.Google ScholarCross Ref
- FM96.P. Ferragina and S. Muthukrishnan. Efficient dynamic method-iookup for OOLs. Proc. European Symposium on Algorithms, LNCS 1136, 107- 120,1996. Google ScholarDigital Library
- GBT84.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. Google ScholarDigital Library
- G93.R. Giancarlo. The suffix tree of a square matrix with applications. Proc. A CM-SIAM Syrup. on Discrete Algorithms, 402-411, 1993. Google ScholarDigital Library
- GB91.G.H. Gonnet and ft. Baeza-Yates. Handbook of Algorithms and Data Structures, Addison-Wesley, 2nd edition, 1991. Google ScholarDigital Library
- IS93.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. Google ScholarDigital Library
- LM98.G. Leavens and T. Millstein. Multiple dispatch as dispatch on tuples. Proc. OOPSLA 98~ 1998. Google ScholarDigital Library
- MW94.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. Google ScholarDigital Library
- Mc85.E.M. McCreight. Priority Search Trees. SteAM Journal of Computing, 14(2):257-276, 1985.Google Scholar
- Mehl84.K. Mehlhorn. Data Structures and Algorithms 3: Multidimensional $earchin9 and Computational Geometry. Springer-Verlag, 1984. Google ScholarDigital Library
- MHH91.W. Mu~ridge, J. Hamer and J. Hosking. Multime~hods in a statically-typed programming languages. Proc. ECOOP, 1991. Google ScholarDigital Library
- M95.M. Mfiller. Method dispatch in dynamicallytyped object-oriented languages. M~ster's thesis, University of New Mexico Albuquerque, 1995.Google Scholar
- MM96a.R. Muth and U. Manber. Approximate multiple strings search. Proc. Combinatorial Pattern Matching Conference, LNCS 1075, 75-86, 1996. Google ScholarDigital Library
- MM96b.$. 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. Google ScholarDigital Library
- Mye94.G. Myers. A sublinear algorithm for approximate key word searching. Algorithmica, 12(4/5):345- 374, 1994.Google ScholarCross Ref
- N97.G. Navarro. Multiple approximate string matching by counting. Proc. South American Workshop on String Processing, 95-111, 1997.Google Scholar
- O88b.M.H. Overmars. Efficient data structures for range searching on a grid. Journal of Algorithms 9, 254-275, 1988. Google ScholarDigital Library
- PW95.P.A. Pevzner and M. S. Waterman. MultAple filtration and approximate pattern matching,. Algorithmica, 13(112):135-154, January 1995.Google ScholarCross Ref
- V82.V.K. Vashnaivi. Computing point enclosures. IEEE Trans. Comp., 22-29, 1982.Google ScholarDigital Library
- V95.J. Vitek. Compact dispatch tables for dynamically-typed object-oriented languages. Research thesis, University of British Columbia, Vancouver, 1995. Google ScholarDigital Library
- YY95.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. Google ScholarDigital Library
- W83.D.E. WJ}lard: Log-Logarithmic worst-case range queries are possible in space O(N). Information Processing Letters, 17(2): 81-84, 1983.Google ScholarCross Ref
Index Terms
- Multi-method dispatching: a geometric approach with applications to string matching problems
Recommendations
Review on Multi-objective Joint Economic Dispatching of Microgrid in Power System
AbstractAs the global energy crisis and environmental pollution problems are becoming more and more serious, the microgrid (MG), as an effective supplementary means of large power grid, has gradually become the focus of attention. With the gradual ...
Fast algorithm for creating space efficient dispatching tables with application to multi-dispatching
The dispatching problem can be solved very efficiently in the single-inheritance~(SI) setting. In this paper we show how to extend one such solution to the multiple-inheritance~(MI) setting. This generalization comes with an increase to the space ...
Peak-Aware Online Economic Dispatching for Microgrids
e-Energy '15: Proceedings of the 2015 ACM Sixth International Conference on Future Energy SystemsBy employing local renewable energy sources and power generation units while connected to the central grid, microgrid can usher in great benefits in terms of cost efficiency, power reliability, and environmental awareness. Economic dispatching is a ...
Comments