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

DOI10.1145/301250.301378MaRDI QIDQ2819581zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina, S. Muthukrishnan, Mark de Berg

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301250.301378

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 2089205
• scientific article; zbMATH DE number 914134
• scientific article; zbMATH DE number 3887061
• Incremental algorithms for dispatching in dynamically typed languages
• Design and evaluation of C++ open multi-methods

Cited in

(9)

• Compressing dictionary matching index via sparsification technique
• Design and evaluation of C++ open multi-methods
• The complexity of compressed membership problems for finite automata
• Fast string dictionary lookup with one error
• scientific article; zbMATH DE number 2089205 (Why is no real title available?)
• Orthogonal range searching for text indexing
• scientific article; zbMATH DE number 914134 (Why is no real title available?)
• Generalized substring compression
• Incremental algorithms for dispatching in dynamically typed languages

This page was built for publication: Multi-method dispatching: a geometric approach with applications to string matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819581)