bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Add reference to Mo's algorithm

This commit is contained in:
Antti H S Laaksonen 2017-04-22 12:00:43 +03:00
parent e8608fa76f
commit 334cf16de7
2 changed files with 12 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
chapter27.tex
View File

@ -315,7 +315,8 @@ because both cases take a total of $O(n \sqrt n)$ time.
\key{Mo's algorithm}\footnote{According to \cite{cod15}, this algorithm \key{Mo's algorithm}\footnote{According to \cite{cod15}, this algorithm
is named after Mo Tao, a Chinese competitive programmer, but is named after Mo Tao, a Chinese competitive programmer, but
the technique has appeared earlier in the literature.} can be used in many problems the technique has appeared earlier in the literature \cite{ken06}.}
can be used in many problems
that require processing range queries in that require processing range queries in
a \emph{static} array. a \emph{static} array.
Since the array is static, the queries can be Since the array is static, the queries can be

14
list.tex
View File

@ -227,15 +227,21 @@
Efficient randomized pattern-matching algorithms. Efficient randomized pattern-matching algorithms.
\emph{IBM Journal of Research and Development}, 31(2):249--260, 1987. \emph{IBM Journal of Research and Development}, 31(2):249--260, 1987.
\bibitem{kle05}
J. Kleinberg and É. Tardos.
\emph{Algorithm Design}, Pearson, 2005.
\bibitem{kas61} \bibitem{kas61}
P. W. Kasteleyn. P. W. Kasteleyn.
The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice.
\emph{Physica}, 27(12):1209--1225, 1961. \emph{Physica}, 27(12):1209--1225, 1961.
\bibitem{ken06}
C. Kent, G. M. Landau and M. Ziv-Ukelson.
On the complexity of sparse exon assembly.
\emph{Journal of Computational Biology}, 13(5):1013--1027, 2006.
\bibitem{kle05}
J. Kleinberg and É. Tardos.
\emph{Algorithm Design}, Pearson, 2005.
\bibitem{knu982} \bibitem{knu982}
D. E. Knuth. D. E. Knuth.
\emph{The Art of Computer Programming. Volume 2: Seminumerical Algorithms}, Addison–Wesley, 1998 (3rd edition). \emph{The Art of Computer Programming. Volume 2: Seminumerical Algorithms}, Addison–Wesley, 1998 (3rd edition).