book chapter · Cambridge University Press eBooks · 2023

Algorithm design

Veli Mäkinen, Djamal Belazzougui, Fabio Cunial, Alexandru I. Tomescu

Cited by 1Abstract and details only

Abstract

This chapter gives an introduction to complexity analysis, data representations, and reductions. In addition, the Knuth–Morris–Pratt algorithm is covered to give some taste of dynamic programming – a technique introduced in Chapters 4 and 6 and used extensively thereafter.

Cite this paper

APA 7

Mäkinen, V., Belazzougui, D., Cunial, F., & Tomescu, A. I. (2023). Algorithm design. Cambridge University Press eBooks, 10–20. https://doi.org/10.1017/9781009341257.004

MLA 9

Mäkinen, Veli, et al. “Algorithm design.” Cambridge University Press eBooks, 2023, pp. 10–20, https://doi.org/10.1017/9781009341257.004.

Chicago

Mäkinen, Veli, Djamal Belazzougui, Fabio Cunial, and Alexandru I. Tomescu. 2023. “Algorithm design.” Cambridge University Press eBooks: 10–20. https://doi.org/10.1017/9781009341257.004.

Harvard

Mäkinen, V. et al. (2023) ‘Algorithm design’, Cambridge University Press eBooks, pp. 10–20. Available at: https://doi.org/10.1017/9781009341257.004.

BibTeX

@incollection{makinen2023algorithm,
  title = {{Algorithm design}},
  author = {Mäkinen, Veli and Belazzougui, Djamal and Cunial, Fabio and Tomescu, Alexandru I.},
  booktitle = {Cambridge University Press eBooks},
  pages = {10--20},
  year = {2023},
  doi = {10.1017/9781009341257.004}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.