Live briefing
Everything about Potential method
Method of analyzing the amortized complexity of a data structure
In computational complexity theory, the potential method is a method used to analyze the amortized time and space complexity of a data structure, a measure of its performance over sequences of operations that smooths out the cost of infrequent but expensive operations. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Potential methodA 5-minute orientation
- Skim a recent paper: Intelligent obstacle avoidance path planning method for picking manipulator combined with artificial potential field methodInfluential work since 2022
- Pick up a classic book: Intraoperative neurophysiological monitoringThe most-reprinted book on the subject
- Read the landmark paper: From ultrasoft pseudopotentials to the projector augmented-wave methodCited 84,486 times
- Go sideways: Dynamic arrayA closely related topic
- Go sideways: Amortized analysisA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
From ultrasoft pseudopotentials to the projector augmented-wave method
The potential harmonic expansion method
Liquefaction potential evaluations: energy-based method versus stress-based method
Model potential method in molecular calculations
Embedded-atom-method tantalum potential developed by the force-matching method
Towards a Kohn-Sham potential via the optimized effective-potential method
Braaten-Pisarski method at finite chemical potential
SUPERSYMMETRY, VARIATIONAL METHOD AND HULTHÉN POTENTIAL
🆕 Influential since 2022
Intelligent obstacle avoidance path planning method for picking manipulator combined with artificial potential field method
An AI Method to Score Celebrity Visual Potential
Improved Artificial Potential Field Method for UAV Path Planning
Deep Learning-Meshless Method for Inverse Potential Problems
Bootstrapping semi-supervised annotation method for potential suicidal messages
📚 Books worth reading
Intraoperative neurophysiological monitoringAage R. Møller · 2005
Essentials of clinical neurophysiologyKarl E. Misulis · 1993
Electrical neuroimagingThomas Koenig · 2009- 📕Deep brain stimulation and epilepsyHans O. Lüders · 2004
Neurophysiological techniquesC. H. Vanderwolf, Alan A. Boulton · 1990
EEG/ERP AnalysisNidal Kamel, Aamir Saeed Malik · 2014- 📕Navier-Stokes and potential theory solutions for a helicopter fuselage and comparison with experimentMark S. Chaffin · 1994
Electromyography and Evoked PotentialsA. Struppler · 1985
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Dynamic array In computer science, a dynamic array, growable array, resizable array, dynamic table, mutable array, or array list is a random access, variable-size list…
- Amortized analysis In computer science, amortized analysis is a method for analyzing a given algorithm's complexity, or how much of a resource, especially time or memory…
- Quantum cylindrical quadrupole The quantum cylindrical quadrupole is a solution to the Schrödinger equation, i ℏ ∂ ∂ t ψ ( x , t ) = − ℏ 2 2 m ∂ 2 ∂ x 2 ψ ( x , t ) + V ( x ) ψ ( x…
- Fibonacci heap In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better…
- Hashed array tree In computer science, a hashed array tree (HAT) is a dynamic array data-structure published by Edward Sitarski in 1996, maintaining an array of separate…
- Queap In computer science, a queap is a priority queue data structure. The data structure allows insertions and deletions of arbitrary elements, as well as retrieval…
- Finger tree In computer science, a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A…
- JLO cocycle In noncommutative geometry, the Jaffe–Lesniewski–Osterwalder (JLO) cocycle (named after Arthur Jaffe, Andrzej Lesniewski, and Konrad Osterwalder) is a…