Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
The analysis of algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Algorithms & data structures
Algorithms and complexity
Algorithmics: the spirit of computing
Algorithmics: the spirit of computing
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Algorithmics: theory & practice
Algorithmics: theory & practice
Algorithms
File structures: an analytic approach
File structures: an analytic approach
Efficient parallel algorithms
Communications of the ACM
Introduction to algorithms
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
Teaching calculation and discrimination: a more effective curriculum
Communications of the ACM
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Communications of the ACM - Special issue: Soviet computing
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Data structures and algorithm analysis
Data structures and algorithm analysis
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The design and analysis of algorithms
The design and analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
Compared to what?: an introduction to the analysis of algorithms
Information retrieval: data structures and algorithms
Information retrieval: data structures and algorithms
Algorithms and data structures: with applications to graphics and geometry
Algorithms and data structures: with applications to graphics and geometry
An introduction to parallel algorithms
An introduction to parallel algorithms
A logical approach to discrete math
A logical approach to discrete math
Parallel computing (2nd ed.): theory and practice
Parallel computing (2nd ed.): theory and practice
Computational geometry in C
Text algorithms
Problems on algorithms
Parallel computing: principles and practice
Parallel computing: principles and practice
Foundations of parallel programming
Foundations of parallel programming
Randomized algorithms
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Introduction to Algorithms: A Creative Approach
Introduction to Algorithms: A Creative Approach
Algorithms: Their Complexity and Efficiency
Algorithms: Their Complexity and Efficiency
Data Structures and Their Algorithms
Data Structures and Their Algorithms
Analysis of Algorithms and Data and Structures
Analysis of Algorithms and Data and Structures
Data Structures and Algorithms
Data Structures and Algorithms
Combinatorial Algorithms
Fundamentals of Computer Alori
Fundamentals of Computer Alori
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Progress report: Brown university instructional computing laboratory
SIGSCE '84 Proceedings of the fifteenth SIGCSE technical symposium on Computer science education
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Design and analysis of algorithms reconsidered
Proceedings of the thirty-first SIGCSE technical symposium on Computer science education
A derivation-first approach to teaching algorithms
Proceeding of the 44th ACM technical symposium on Computer science education
An Experimental Method for the Active Learning of Greedy Algorithms
ACM Transactions on Computing Education (TOCE)
| Hi-index | 0.00 |
In this paper we propose and discuss how to teach algorithms, including contents, methodologies, textbooks, and computer labs. We use the ACM/IEEE curricula as a starting point and compare our proposal to theirs. We raise several issues, but we do not provide definite answers. Our main proposal is a paradigm driven methodology for the main algorithmic course, as well as some paradigms and problems not usually covered. An ultimate teaching algorithm is still an open problem.