about

algorithm
algorithm design
‣ backtracking
‣ dynamic programming
‣ 𝟣 ‣ 𝟤 ‣ 𝟥 ‣ 𝟦
algorithm analysis

data
set
ordering
sequence
position
region

graph ‣ 𝟤 ‣ 𝟥
tree ‣ 𝟤
directed acyclic graph
rooted tree ‣ 𝟤
connected graph ‣ 𝟤 ‣ 𝟥
isomorphic graph
complete graph
planar graph
expander graph
bipartite graph
chordal graph
perfect graph

path ‣ 𝟤 ‣ 𝟥 ‣ 𝟦
spanning tree ‣ 𝟤
cycle
flow ‣ 𝟤
cut ‣ 𝟤 ‣ 𝟥
matching ‣ 𝟤
tour
scheduling
matroid
domination
coloring
labeling

number ‣ bit
function ‣ operation
divisor ‣ partition
prime ‣ factorization
residue ‣ finite field
fraction ‣ lattice
permutation ‣ count
ordering ‣ sort

sequence
arithmetic function
recurrence
iterated function
polynomial
polynomial function
series
complex function

point ‣ 𝟤
polygon ‣ 𝟤
shape ‣ 𝟤
convex hull ‣ 𝟤
triangulation
neighbor

surface
differentiable surface
topological surface
minimal surface
developable surface
geodesic

function
root finding
optimization ‣ 𝟤 ‣ 𝟥
regression
interpolation
approximation

linear function ‣ 𝟤 ‣ 𝟥
linear equation ‣ 𝟤
linear optimization ‣ 𝟤
sparse linear function
sparse linear equation
sparse linear optimization

number
function
wave
spiral
function
differential equation ‣ 𝟤

logic
language
automaton
proof
game
grid

data
estimation
fitting
correlation
factoring
transformation
embedding
representation

signal ‣ 𝟤 ‣ 𝟥
system ‣ 𝟤 ‣ 𝟥 ‣ 𝟦 ‣ 𝟧
state

string
substring ‣ 𝟤 ‣ 𝟥 ‣ 𝟦
subsequence ‣ 𝟤 ‣ 𝟥
palindrome

code
compression
correction ‣ 𝟤
encryption ‣ 𝟤

data ‣ sensor
text ‣ language
audio ‣ sound
image ‣ color
model ‣ simulation
graphics ‣ animation
camera ‣ vision
glass ‣ motion
robot ‣ perception

computer
math
physics
biology
medicine
geography
sociology
engineering
art

book
programming
problem solving
activity

science
technology
industry ‣ 𝟤