8
algorithms
× 14 |
3
spanning-trees
× 2 |
1
lower-bounds
|
0
divide-and-conquer
× 2 |
5
binary-trees
× 4 |
3
attribute-grammars
|
1
queues
|
0
programming-languages
|
4
graphs
× 8 |
2
complexity-theory
× 2 |
1
algorithm-analysis
|
0
greedy-algorithms
|
4
compilers
× 5 |
2
shortest-path
|
1
cpu-cache
|
0
context-sensitive
|
4
data-structures
× 4 |
2
mathematical-foundations
|
1
memory-access
|
0
cpu
|
4
formal-grammars
× 3 |
2
memory-allocation
|
0
sorting
× 6 |
0
kleene-star
|
4
parsers
× 3 |
2
binary-search-trees
|
0
formal-languages
× 3 |
0
reductions
|
4
finite-automata
× 2 |
1
turing-machines
× 5 |
0
minimum-spanning-tree
× 2 |
0
sequential-circuit
|
4
automata
|
1
undecidability
× 4 |
0
computer-networks
× 2 |
0
semi-decidability
|
4
regular-expressions
|
1
trees
× 2 |
0
counting
× 2 |
0
searching
|
3
recurrence-relation
× 7 |
1
context-free
× 2 |
0
digital-circuits
× 2 |
0
notation
|
3
heaps
× 2 |
1
cpu-pipelines
|
0
computer-architecture
× 2 |
0
square-grid
|
3
asymptotics
× 2 |
1
halting-problem
|
0
arrays
× 2 |
0
in-place
|
Mr. Sigma.
