Multi-method dispatching: a geometric approach with applications to string matching problems
From MaRDI portal
Recommendations
- Time and space efficient multi-method dispatching
- scientific article; zbMATH DE number 914134
- Data structures and algorithms 3: Multi-dimensional searching and computational geometry. Transl. from the German
- Incremental algorithms for dispatching in dynamically typed languages
- Design and evaluation of C++ open multi-methods
Cited in
(9)- The complexity of compressed membership problems for finite automata
- Compressing dictionary matching index via sparsification technique
- Generalized substring compression
- Orthogonal range searching for text indexing
- Fast string dictionary lookup with one error
- Incremental algorithms for dispatching in dynamically typed languages
- Time and space efficient multi-method dispatching
- scientific article; zbMATH DE number 914134 (Why is no real title available?)
- Design and evaluation of C++ open multi-methods
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)