Live briefing
Everything about Algorithmic efficiency
Property of an algorithm
In computer science, algorithmic efficiency is a property of an algorithm which relates to the amount of computational resources used by the algorithm. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Algorithmic efficiencyA 5-minute orientation
- Skim a recent paper: Swarm-intelligence-based quantum-inspired optimization techniques for enhancing algorithmic efficiency and empirical assessmentInfluential work since 2022
- Pick up a classic book: Parallelization of the implicit RPLUS algorithmThe most-reprinted book on the subject
- Read the landmark paper: Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsCited 1,833 times
- Go sideways: Analysis of algorithmsA closely related topic
- Go sideways: Computer performanceA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Algorithmic efficiency of simulated annealing for heat exchanger network design
Algorithmic rationality: Epistemology and efficiency in the data sciences
Algorithmic complexity theory and the relative efficiency of financial markets
Algorithmic approach of destabilizing factors of improving the technical systems efficiency
Algorithmic Trading Efficiency and its Impact on Market-Quality
Algorithmic Efficiency in Convex Hull Computation: Insights from 2D and 3D Implementations
The role of algorithmic trading systems on stock market efficiency
🆕 Influential since 2022
Swarm-intelligence-based quantum-inspired optimization techniques for enhancing algorithmic efficiency and empirical assessment
Thermodynamic analysis of algorithmic cooling protocols: Efficiency metrics and improved designs
Whither Symbolic Efficiency? Social Media, New Structuralism, and Algorithmic Desire
Advancing multi-port container stowage efficiency: A novel DQN-LNS algorithmic solution
Algorithmic trading and market efficiency around the introduction of the NYSE Hybrid Market
đź“š Books worth reading
- 📕Parallelization of the implicit RPLUS algorithmPaul D. Orkwis · 1994
- 📕An improved battery state-of-charge indicator · 1984
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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…
- Computer performance In computing, computer performance is the amount of useful work accomplished by a computer system. Outside specific contexts, computer performance is estimated…
- 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…
- 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…
- External sorting External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not…
- Program optimization In computer science, program optimization, code optimization, or software optimization is the process of modifying a software system to make some aspect…
- Cache-oblivious algorithm In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having…
- Space–time tradeoff A space–time trade-off (also known as time–memory trade-off or the algorithmic space-time continuum) in computer science is a trade-off where an algorithm…