Keyword

algorithm design and analysis

Description: A computer science subject concerned with constructing algorithms and evaluating their correctness, efficiency, and computational complexity.
OpenAlex ID: keywords/algorithm-design-and-analysis
2020 · Alok Kumar Yadav, Solomon Sunday Oyelere · Education and Information Technologies · 84
1994 · Dexter Kozen · The MIT Press eBooks · 51
2006 · Lecture notes in computer science · 48
2001 · Clara I. Grima, Alberto Márquez · Springer eBooks · 32
2019 · Daniel Coore, Daniel Fokum · ACM Technical Symposium on Computer Science Education (SIGCSE) · 20
2000 · Cordelia Hall, John O’Donnell · Springer eBooks · 19
2024 · Sanz-Alonso, Daniel, Al-Ghattas, Omar · arXiv (Cornell University) · 18
1988 · Leonidas J. Guibas, Jorge Stolfi · Springer eBooks · 17
2007 · BILARDI, GIANFRANCO, PIETRACAPRINA, ANDREA ALBERTO, et al. · Chapman & Hall/CRC eBooks · 12
2018 · Juan Galvis, Eric T. Chung, et al. · Lecture notes in computational science and engineering · 11
2002 · E.T.L. Omtzigt · Workshop on Physics and Computation (PhysComp) · 11
2021 · Jason King · ACM Technical Symposium on Computer Science Education (SIGCSE) · 10
2017 · Zhang, Yanyong, Mosteiro, Miguel A, et al. · Lecture notes in computer science · 8
2012 · Woeginger, Gerhard J., Thilikos, Dimitrios M. · Lecture notes in computer science · 6
2003 · J. Matocha · IEEE Frontiers in Education Conference (FIE) · 6
2002 · Pai H. Chou · 6
2001 · Michael T. Goodrich, Roberto Tamassia · ACM Technical Symposium on Computer Science Education (SIGCSE) · 6
2020 · Daniel Raviv, Yumi Nakagawa, et al. · ASEE Annual Conference & Exposition · 5
2013 · David Kirkpatrick · Lecture notes in computer science · 5
2006 · Michal Armoni · ACM SIGCSE Bulletin · 5
2016 · Sankowski, Piotr, Zaroliagis, Christos · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 4
2020 · M. Sohel Rahman, Kunihiko Sadakane, et al. · Lecture notes in computer science · 3
Works count: 147
Citation count: 510
Year
Topic
Type