Category:Analysis of algorithms

• Analysis of algorithms (computing)

A

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

B

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

C

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

D

• Deterministic algorithm (computing)
• Dovetailing (computer science) (computing)

E

• Empirical algorithmics (computing)
• Entropy compression (computing)
• External memory algorithm (computing)

F

• Funnelsort (computing)

G

• Galactic algorithm (computing)

H

• Half-exponential function (computing)

I

• Instruction path length (computing)
• Iterative compression (computing)

K

• Kernelization (computing)
• Klee–Minty cube (computing)

L

• List update problem (computing)

M

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

O

• Oblivious RAM (computing)
• Oblivious ram (computing)
• Output-sensitive algorithm (computing)

P

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

R

• Randomized algorithm (computing)
• Reservoir sampling (computing)

T

• Time complexity (computing)

W

• Worst-case complexity (computing)