Category:Analysis of algorithms

A

• Amortized data structures (18 P)

P

• Analysis of parallel algorithms (13 P)
• Parameterized complexity (1 C, 7 P)

Q

• Quasi-polynomial time algorithms (8 P)

• Analysis of algorithms

A

• Accounting method (computer science)
• Adversary model
• Algorithmic efficiency
• Amortized analysis
• The Art of Computer Programming
• Asymptotically optimal algorithm
• Average-case complexity

B

• Best, worst and average case
• Bidimensionality
• Big O notation
• Branching factor

C

• Cache-oblivious algorithm
• Cache-oblivious distribution sort
• Charging argument
• Combinatorial search
• Competitive analysis (online algorithm)
• Computational complexity

D

• Deterministic algorithm
• Dovetailing (computer science)

E

• Empirical algorithmics
• Entropy compression
• External memory algorithm

F

• Funnelsort

G

• Galactic algorithm

H

• Half-exponential function

I

• Instruction path length
• Iterative compression

K

• Kernelization
• Klee–Minty cube

L

• List update problem

M

• Master theorem (analysis of algorithms)
• Mem (computing)
• Memory-bound function

O

• Oblivious RAM
• Output-sensitive algorithm

P

• Polylogarithmic function
• Polynomial delay
• Potential method
• Probabilistic analysis of algorithms
• Pseudo-polynomial time

Q

• Quasi-polynomial time

R

• Randomized algorithm
• Reservoir sampling

S

• Smoothed analysis

T

• Time complexity

W

• Worst-case complexity