Live briefing
Everything about Algorithm engineering
Algorithm engineering focuses on the design, analysis, implementation, optimization, profiling and experimental evaluation of computer algorithms, bridging the gap between algorithmics theory and practical applications of algorithms in software engineering. It is a general methodology for algorithmic research. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Algorithm engineeringA 5-minute orientation
- Skim a recent paper: Artificial hummingbird algorithm: A new bio-inspired optimizer with its engineering applicationsInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: Pelican Optimization Algorithm: A Novel Nature-Inspired Algorithm for Engineering ApplicationsCited 853 times
- Go sideways: Empirical algorithmicsA closely related topic
- Go sideways: Theoretical computer scienceA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Pelican Optimization Algorithm: A Novel Nature-Inspired Algorithm for Engineering Applications
Gannet optimization algorithm : A new metaheuristic algorithm for solving engineering optimization problems
Queuing search algorithm: A novel metaheuristic algorithm for solving engineering optimization problems
Material Generation Algorithm: A Novel Metaheuristic Algorithm for Optimization of Engineering Problems
Engineering a Lightweight Suffix Array Construction Algorithm
Algorithm engineering for public key algorithms
Social mimic optimization algorithm and engineering applications
Multi-tracker Optimization Algorithm: A General Algorithm for Solving Engineering Optimization Problems
🆕 Influential since 2022
Artificial hummingbird algorithm: A new bio-inspired optimizer with its engineering applications
Artificial rabbits optimization: A new bio-inspired meta-heuristic algorithm for solving engineering optimization problems
Black-winged kite algorithm: a nature-inspired meta-heuristic for solving benchmark functions and engineering problems
Osprey optimization algorithm: A new bio-inspired metaheuristic algorithm for solving engineering optimization problems
📚 Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Parallel Processing and Applied MathematicsRoman Wyrzykowski · 2003
Introduction to AlgorithmsThomas H. Cormen, Charles E. Leiserson · 1990
Swarm Intelligence AlgorithmsAdam Slowik · 2020
Structured Object-Oriented Formal Language and MethodShaoying Liu, Zhenhua Duan · 2013
The Master AlgorithmPedro Domingos · 2015
The art of error correcting codingRobert H. Morelos-Zaragoza · 2002
Genetic algorithms + data structures = evolution programsZbigniew Michalewicz · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Empirical algorithmics In computer science, empirical algorithmics (or experimental algorithmics) is the practice of using empirical methods to study the behavior of algorithms…
- Theoretical computer science Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation…
- Analysis of algorithms In computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other…
- Outline of computer science Computer science (also called computing science) is the study of the theoretical foundations of information and computation and their implementation and…
- Computer science Fundamental areas of computer science Computer science is the study of computation, information, and automation, together with their associated phenomena…
- Asymptotically optimal algorithm In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independen…
- DIMACS The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) is a collaboration between Rutgers University, Princeton University, and…
- Computational complexity In computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus…