Everything about Asymptotically optimal algorithm

🧭 Start here: a 6-step reading path

1. Read the overview: Asymptotically optimal algorithmA 5-minute orientation
2. Skim a recent paper: Genetic RRT: Asymptotically Optimal Sampling-based Path Planning via Optimization of Genetic AlgorithmInfluential work since 2022
3. Pick up a classic book: Introduction to Multiple Time Series AnalysisThe most-reprinted book on the subject
4. Read the landmark paper: The sliding-window Lempel-Ziv algorithm is asymptotically optimalCited 92 times
5. Go sideways: Computational complexityA closely related topic
6. Go sideways: Time complexityA closely related topic

🏆 Landmark papers (most cited)

• The sliding-window Lempel-Ziv algorithm is asymptotically optimal

  A.D. Wyner, J. Ziv · 1994 · Proceedings of the IEEE · 92 citations

• Asymptotically Optimal Estimation Algorithm for the Sparse Signal With Arbitrary Distributions

  Chongwen Huang, Lei Liu, Chau Yuen · 2018 · IEEE Transactions on Vehicular Technology · 25 citations

• An Encoding Algorithm of Triply Extended Reed–Solomon Codes With Asymptotically Optimal Complexities

  Sian-Jheng Lin · 2018 · IEEE Transactions on Communications · 25 citations

• Combinational optimization problems for which almost every algorithm is asymptotically optimal

  W. Szpankowski · 1995 · Optimization · 18 citations

• Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem

  Justin Salez, Devavrat Shah · 2009 · Mathematics of Operations Research · 16 citations

• Asymptotically optimal dualization algorithms

  E. V. Djukova, P. A. Prokofjev · 2015 · Computational Mathematics and Mathematical Physics · 9 citations

• An asymptotically optimal gradient algorithm for quadratic optimization with low computational cost

  Anatoly Zhigljavsky, Luc Pronzato, Elena Bukina · 2012 · Optimization Letters · 8 citations

• Asymptotically Optimal Contextual Bandit Algorithm Using Hierarchical Structures

  Mohammadreza Mohaghegh Neyshabouri, Kaan Gokcesu, Hakan Gokcesu · 2019 · IEEE Transactions on Neural Networks and Learning Systems · 6 citations

🆕 Influential since 2022

• Genetic RRT: Asymptotically Optimal Sampling-based Path Planning via Optimization of Genetic Algorithm

  Xiyuan Wang · 2023 · Highlights in Science, Engineering and Technology · 5 citations

• An asymptotically optimal algorithm for generating bin cardinalities

  Luc Devroye, Dimitrios Los · 2025 · Mathematics and Computers in Simulation · 2 citations

• ASYMPTOTICALLY OPTIMAL ALGORITHM FOR PROCESSING SIDE RADIATION SIGNALS FROM MONITOR SCREENS ON LIQUID CRYSTAL STRUCTURES

  Dmytro Yevgrafov, Yurii Yaremchuk · 2023 · Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska · 2 citations

• An asymptotically optimal algorithm for online stacking

  Martin Olsen, Lars Nørvang Andersen, Allan Gross · 2023 · Mathematical Methods of Operations Research · 1 citations

• An asymptotically optimal public parking lot location algorithm based on intuitive reasoning

  Chao Wang, Wei Zhang, Sumin Wang · 2022 · Intelligent and Converged Networks · 1 citations

📚 Books worth reading

• Introduction to Multiple Time Series AnalysisHelmut Lütkepohl, Helmut Lutkepohl · 1991
• Computer algorithmsEllis Horowitz · 1997
• Point-to-set maps and mathematical programmingP. Huard, A. Auslender · 1979
• Fundamentals of data structures in CEllis Horowitz · 1993
• Data structures, algorithms, and applications in C++Sartaj Sahni · 1998
• Approximation and Online AlgorithmsThomas Erlebach · 2013
• Empirical LikelihoodArt B. Owen · 2001
• Data Structures and Algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2014

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• 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…
• Time complexity In theoretical computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm…
• Comparison sort A comparison sort is a type of sorting algorithm that only reads the list elements through a single abstract comparison operation (often a "less than or…
• Quantum complexity theory Quantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational…
• Matrix multiplication algorithm Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms…
• Shellsort Shellsort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be understood as either a generalization of sorting by exchange…
• Asymptotic computational complexity In computational complexity theory, asymptotic computational complexity is the use of asymptotic analysis for the estimation of the computational complexity…
• Kirkpatrick–Seidel algorithm The Kirkpatrick–Seidel algorithm is an algorithm designed for computing the convex hull of a set of points in the plane, offering a time complexity of…