The web
Every named object
A field says which part of the subject an essay sits in and a series follows one idea in depth. This is the third axis: the named objects themselves, and every essay that touches each one.
There are 696 named objects here, and 472 of them are named by more than one essay. Those have a page of their own. The rest link straight to the single essay that names them — a page whose whole content is one card would say nothing the essay itself does not.
- Access pattern 10 essays
- Adaptive coding 1 essay
- Adaptive sort 4 essays
- Additive error 5 essays
- Adjacency 7 essays
- Adjacency list 2 essays
- Admissibility 6 essays
- Adversarial input 10 essays
- Adversary 1 essay
- Adversary argument 5 essays
- Affine gap 3 essays
- Aho-corasick 7 essays
- Algorithm selection 1 essay
- Aliasing 3 essays
- Alignment 15 essays
- Allocator 5 essays
- Alphabet 23 essays
- Alphabet order 2 essays
- Alphabet size 18 essays
- Alphabetic code 2 essays
- Amortisation 4 essays
- Amortised 7 essays
- Amortised analysis 12 essays
- Approximate matching 16 essays
- Approximate membership 6 essays
- Approximation 2 essays
- Approximation ratio 1 essay
- Arithmetic coding 2 essays
- Arrival process 9 essays
- Artefact 1 essay
- Associativity 3 essays
- Asymptotic analysis 1 essay
- Asymptotic notation 4 essays
- Automaton 8 essays
- Auxiliary space 14 essays
- Average case 5 essays
- B-tree 8 essays
- Backtracking 3 essays
- Backtracking search 14 essays
- Backward search 13 essays
- Bad partition 1 essay
- Bad-character rule 5 essays
- Balance 1 essay
- Balls in bins 2 essays
- Band 1 essay
- Banded dp 1 essay
- Bellman–Ford 5 essays
- Benchmark input 4 essays
- Benchmarking 6 essays
- Bidirectional index 18 essays
- Bidirectional search 3 essays
- Binary heap 2 essays
- Binary search 12 essays
- Binary search tree 4 essays
- Bit vector 17 essays
- Bit-parallel 2 essays
- Bitmap 2 essays
- Bits per symbol 4 essays
- Block decomposition 1 essay
- Block size 2 essays
- Block transfer 21 essays
- Blocked filter 2 essays
- Blocking 1 essay
- Bloom filter 14 essays
- Bookkeeping 1 essay
- Bottom-k 3 essays
- Boundary order 1 essay
- Bounded depth parse 4 essays
- Boyer moore 1 essay
- Branch prediction 1 essay
- Branching factor 1 essay
- Branching program 1 essay
- Branchless 4 essays
- Break-even 10 essays
- Bubble sort 1 essay
- Bucket load 5 essays
- Bucket merge 1 essay
- Buffered tree 1 essay
- Bulk loading 1 essay
- Burrows-wheeler 4 essays
- Burrows-wheeler runs 7 essays
- Burrows-wheeler transform 13 essays
- Burstiness 9 essays
- Bzip2 1 essay
- Cache 28 essays
- Cache capacity 1 essay
- Cache line 2 essays
- Cache oblivious 3 essays
- Call stack 3 essays
- Cancellation 2 essays
- Cap 2 essays
- Cardinality 8 essays
- Cardinality estimate 4 essays
- Cardinality estimation 2 essays
- Carry propagation 1 essay
- Cartesian tree 3 essays
- Chained hashing 3 essays
- Character comparison 9 essays
- Check 9 essays
- Clock resolution 4 essays
- Closed form 11 essays
- Clustering 1 essay
- Code length 1 essay
- Commensurability 2 essays
- Commentz-walter 8 essays
- Compaction 1 essay
- Comparison count 35 essays
- Comparison sort 1 essay
- Complexity class 17 essays
- Composition 3 essays
- Compound operation 4 essays
- Compound walk 4 essays
- Compressed bit vector 3 essays
- Compressibility 11 essays
- Compression 5 essays
- Compression ratio 1 essay
- Compression schedule 3 essays
- Compulsory miss 2 essays
- Concatenation 1 essay
- Concentration 6 essays
- Condensation 2 essays
- Conditional entropy 3 essays
- Conditional lower bound 1 essay
- Conditional move 1 essay
- Connectivity 2 essays
- Constant factor 23 essays
- Constant time 2 essays
- Construction 10 essays
- Context model 5 essays
- Control 15 essays
- Copy 3 essays
- Copy depth 6 essays
- Corpus 22 essays
- Correctness 6 essays
- Correlation 1 essay
- Cost model 44 essays
- Count-MIN 1 essay
- Count-Min sketch 7 essays
- Count-Sketch 2 essays
- Counted primitive 8 essays
- Counter 1 essay
- Counterexample 20 essays
- Counting argument 9 essays
- Counting convention 5 essays
- Counting filter 4 essays
- Counting sort 4 essays
- Covering 1 essay
- Crossing 1 essay
- Crossing point 8 essays
- Crossover 17 essays
- CSR (compressed sparse row) 1 essay
- Cuckoo hashing 6 essays
- Curve fitting 7 essays
- Cutoff 7 essays
- Damerau levenshtein 1 essay
- Data movement 5 essays
- Dead branch 4 essays
- Decision tree 4 essays
- Decrease-key 1 essay
- Deferral 2 essays
- Definition 4 essays
- Deflate 1 essay
- Degeneracy 3 essays
- Degree distribution 2 essays
- Deletion 1 essay
- Denominator 3 essays
- Density 5 essays
- Dependency graph 1 essay
- Depth 8 essays
- Depth cap 3 essays
- Depth limit 3 essays
- Depth-first search 1 essay
- Derandomisation 4 essays
- Descent 11 essays
- Design parameter 11 essays
- Determinism 2 essays
- Deterministic algorithm 6 essays
- Deterministic automaton 4 essays
- Deterministic shuffle 1 essay
- Dictionary coding 1 essay
- Dijkstra's algorithm 12 essays
- Directed acyclic graph 2 essays
- Directed graph 2 essays
- Directory 2 essays
- Displacement 3 essays
- Distinct count 1 essay
- Distinguishing prefix 1 essay
- Distribution 24 essays
- Divide and conquer 3 essays
- Document array 17 essays
- Document collection 18 essays
- Document listing 21 essays
- Dominance 4 essays
- Double hashing 1 essay
- Dual-pivot quicksort 1 essay
- Dynamic array 1 essay
- Dynamic graph 2 essays
- Dynamic programming 28 essays
- Early exit 3 essays
- Edit distance 31 essays
- Efficiency ratio 1 essay
- Elias fano 10 essays
- Encoding 1 essay
- Endpos 1 essay
- Entropy 24 essays
- Epsilon 1 essay
- Epsilon closure 2 essays
- Equal elements 1 essay
- Equidistribution 1 essay
- Error bound 1 essay
- Error budget 14 essays
- Error propagation 1 essay
- Estimator 31 essays
- Estimator bias 4 essays
- Evaluation order 11 essays
- Evasiveness 2 essays
- Eviction 3 essays
- Exhaustive search 10 essays
- Expected case 6 essays
- Expected cost 1 essay
- Expected value 3 essays
- Expiry 9 essays
- Exponential decay 3 essays
- Exponential histogram 6 essays
- Exponential search 1 essay
- Exponential time 1 essay
- External merge sort 5 essays
- External-memory 1 essay
- External-memory model 15 essays
- Extraction 7 essays
- Extrapolation 1 essay
- Factorial 2 essays
- Failure function 2 essays
- Failure link 5 essays
- Failure mode 18 essays
- Failure probability 4 essays
- False negative 1 essay
- False-positive 5 essays
- False-positive rate 12 essays
- Falsification 18 essays
- Fan-in 2 essays
- Fanout 3 essays
- Filter 2 essays
- Filtering 7 essays
- Fingerprint 4 essays
- Finite size effect 5 essays
- Fit 1 essay
- Fitting 7 essays
- Fixed point 7 essays
- Floating point 1 essay
- FM-index 22 essays
- Forecast 1 essay
- Formal verification 1 essay
- Forward decay 1 essay
- Frequency vector 1 essay
- Galloping 3 essays
- Gamma coding 1 essay
- Generated collection 6 essays
- Generation 1 essay
- Geometric distribution 2 essays
- Geometric series 2 essays
- Good-suffix rule 6 essays
- Greedy 1 essay
- Greedy algorithm 1 essay
- Greenwald–Khanna 11 essays
- Grid 8 essays
- Growth factor 4 essays
- Guarantee 51 essays
- Half life 3 essays
- Harmonic mean 2 essays
- Hash collision 3 essays
- Hash family 7 essays
- Hash flooding 1 essay
- Hash function 16 essays
- Hash table 11 essays
- Header cost 1 essay
- Heap 14 essays
- Heap order 1 essay
- Heapify 1 essay
- Heapsort fallback 1 essay
- Heavy hitter 23 essays
- Heavy tail 3 essays
- Heuristic search 8 essays
- Hirschberg 1 essay
- Histogram 12 essays
- Honest limit 60 essays
- Huffman code 6 essays
- Huffman coding 3 essays
- Hybrid sort 1 essay
- HyperLogLog 7 essays
- Idempotence 3 essays
- Implementation detail 1 essay
- In place 2 essays
- Inclusion exclusion 1 essay
- Independence assumption 8 essays
- Index 2 essays
- Index maintenance 2 essays
- Index size 74 essays
- Index structure 1 essay
- Information content 1 essay
- Information floor 8 essays
- Information theory 2 essays
- Information-theoretic bound 6 essays
- Initialisation 1 essay
- Insertion cutoff 2 essays
- Insertion order 5 essays
- Insertion sort 1 essay
- Instrumentation 4 essays
- Integer overflow 1 essay
- Interpolation 1 essay
- Interval 5 essays
- Interval dp 5 essays
- Interval stabbing 1 essay
- Interval symbols 13 essays
- Introsort 6 essays
- Invalidation 2 essays
- Invariant 6 essays
- Inverse Ackermann 1 essay
- Inverse permutation 1 essay
- Inversions 3 essays
- Invertibility 3 essays
- Jaccard index 1 essay
- Java 4 essays
- Join 3 essays
- Join order 1 essay
- k-wise independence 4 essays
- Key width 1 essay
- Killer adversary 1 essay
- Kmp 1 essay
- Knapsack 3 essays
- Knee 1 essay
- Kraft inequality 1 essay
- Landmark 3 essays
- Lazy construction 3 essays
- Lazy evaluation 1 essay
- Lcp array 1 essay
- Leading zeros 2 essays
- Lempel ziv 5 essays
- Lempel ziv parse 17 essays
- Levenshtein 1 essay
- LF mapping 1 essay
- Library sort 4 essays
- Limit 2 essays
- Linear counting 3 essays
- Linear probing 4 essays
- Linear sketch 2 essays
- Linear time 1 essay
- Load balancing 3 essays
- Load factor 13 essays
- Local alignment 1 essay
- Local search 1 essay
- Locality 21 essays
- Locate 16 essays
- Locating 5 essays
- Log odds 2 essays
- Logarithm 2 essays
- Longest common subsequence 2 essays
- Lookup table 2 essays
- Lower bound 41 essays
- Lower order term 1 essay
- Lowest common ancestor 1 essay
- Lsm tree 4 essays
- Lz77 1 essay
- Lz78 1 essay
- Machine 1 essay
- Machine word 2 essays
- Match length 1 essay
- Matrix-chain 1 essay
- Maximum load 4 essays
- Measured count 32 essays
- Measurement 108 essays
- Measurement design 14 essays
- Median of means 4 essays
- Median of medians 1 essay
- Memoisation 4 essays
- Memory allocation 1 essay
- Memory hierarchy 7 essays
- Memory layout 12 essays
- Memory traffic 1 essay
- Merge policy 6 essays
- Merge sort 9 essays
- Merge tree 12 essays
- Mergeable summary 20 essays
- Merging 2 essays
- Metric 4 essays
- Midpoint 1 essay
- MIN_GALLOP 2 essays
- minrun 3 essays
- Misprediction 3 essays
- Misra–Gries 22 essays
- Miss rate 9 essays
- Model 8 essays
- Model order 2 essays
- Modulus 1 essay
- Monotonicity 2 essays
- Morris's counter 2 essays
- Move to front 3 essays
- Multi pattern 9 essays
- Multi-pass 3 essays
- Multiply shift 1 essay
- Multiset 1 essay
- Naive scan 1 essay
- Natural run 2 essays
- Negative weight 7 essays
- Node fill 2 essays
- Nondeterministic automaton 5 essays
- Normalisation 1 essay
- Occupancy 6 essays
- Occurrence 3 essays
- Off-by-one 1 essay
- One pass 10 essays
- One-sided error 13 essays
- Open-addressing 1 essay
- Operation count 14 essays
- Optimal binary search tree 2 essays
- Optimality 8 essays
- Optimisation 2 essays
- Order of evaluation 1 essay
- Ordered code 2 essays
- Orientation 2 essays
- Orthogonal vectors 1 essay
- Output-sensitive 25 essays
- Overfitting 4 essays
- Overhead 1 essay
- Overlap 2 essays
- Overlapping subproblems 3 essays
- Packed representation 2 essays
- Packing 1 essay
- Parallelism 5 essays
- Parameter 4 essays
- Parameter choice 24 essays
- Parametric search 2 essays
- Pareto frontier 7 essays
- Parse 7 essays
- Partial order 4 essays
- Partition 23 essays
- Partitioning 1 essay
- Pass direction 1 essay
- Path compression 1 essay
- Pattern matching 14 essays
- Pattern-defeating 1 essay
- pdqsort 4 essays
- Peak and total 4 essays
- Peak space 5 essays
- Per level 2 essays
- Permutation 14 essays
- Phase transition 2 essays
- Phi function 3 essays
- Phrase 15 essays
- Phrase count 13 essays
- Phrase index 6 essays
- Pigeonhole 8 essays
- Pigeonhole principle 2 essays
- Pipeline 2 essays
- Pivot 17 essays
- Pointer chasing 2 essays
- Poisson distribution 1 essay
- Potential function 9 essays
- Power law 1 essay
- Practice 7 essays
- Precondition 10 essays
- Predecessor query 2 essays
- Predictability 1 essay
- Prediction 1 essay
- Preferential attachment 2 essays
- Prefetching 2 essays
- Prefix code 3 essays
- Prefix doubling 1 essay
- Preprocessing 17 essays
- Presortedness 7 essays
- Previous occurrence chain 8 essays
- Primary occurrence 4 essays
- Priority queue 6 essays
- Propagation 5 essays
- Pruning 13 essays
- Pseudo polynomial 2 essays
- Q gram 3 essays
- Quadrangle inequality 2 essays
- Quantile 3 essays
- Quantile summary 11 essays
- Quantisation 1 essay
- Query 1 essay
- Query distribution 1 essay
- Query plan 6 essays
- Query planner 2 essays
- Quickselect 2 essays
- Quicksort 29 essays
- Quotient filter 1 essay
- R-index 11 essays
- Radix sort 2 essays
- Random access 1 essay
- Random bits 7 essays
- Randomised algorithm 12 essays
- Randomised binary search tree 1 essay
- Randomised data structure 4 essays
- Range minimum 18 essays
- Range query 1 essay
- Range reporting 4 essays
- Rank 20 essays
- Rank directory 6 essays
- Rank error 11 essays
- Rank query 10 essays
- Ranking 10 essays
- Read amplification 1 essay
- Record size 3 essays
- Recurrence 9 essays
- Recursion 5 essays
- Recursion depth 6 essays
- Red–black tree 1 essay
- Reduction 1 essay
- Redundancy 4 essays
- Regime 19 essays
- Regret 6 essays
- Regular-expression 3 essays
- Rejection test 2 essays
- Relative error 18 essays
- Relaxation 7 essays
- Repetition 31 essays
- Reproducibility 6 essays
- Reservoir sampling 1 essay
- Resizing 4 essays
- Resource accounting 6 essays
- Retraction 1 essay
- Reverse index 5 essays
- Reweighting 5 essays
- Robin Hood hashing 1 essay
- Rolling hash 1 essay
- Rotation 3 essays
- Rounding 3 essays
- Run 2 essays
- Run boundary sampling 5 essays
- Run count 4 essays
- Run stack 1 essay
- Run-length 15 essays
- Run-length encoding 1 essay
- Running maximum 1 essay
- Sample marks 10 essays
- Sampling 23 essays
- Satisfiability 1 essay
- Saturating counter 1 essay
- Saturation 1 essay
- Scale 5 essays
- Scan 6 essays
- Score 1 essay
- Search frontier 10 essays
- Search scheme 6 essays
- Second frequency moment 3 essays
- Secondary occurrence 9 essays
- Seed-and-extend 5 essays
- Seeded randomness 4 essays
- Seek 1 essay
- Segment tree 4 essays
- Select 6 essays
- Selection 5 essays
- Selection sort 3 essays
- Selectivity 9 essays
- Self-index 41 essays
- Sensitivity analysis 3 essays
- Separator 10 essays
- Shannon bound 1 essay
- Shard 18 essays
- Shared prefix 2 essays
- Shift rule 10 essays
- Shift table 1 essay
- Shortest path 14 essays
- Shuffle 1 essay
- Side information 2 essays
- Sift-down 1 essay
- Silent failure 1 essay
- Simulation 2 essays
- Size model 1 essay
- Sketch 17 essays
- Skew 1 essay
- Skewed distribution 1 essay
- Skip list 7 essays
- Skipping 1 essay
- Sliding window 16 essays
- Smoothed analysis 1 essay
- Sorted run 1 essay
- Sorting network 1 essay
- Space 7 essays
- Space accounting 11 essays
- Space bound 1 essay
- Space lower bound 5 essays
- Space overhead 30 essays
- Space time trade 13 essays
- Space-saving 18 essays
- Span 1 essay
- Sparse bit vector 1 essay
- Sparse dynamic programming 1 essay
- Sparse graph 6 essays
- Sparse set 4 essays
- Specification 3 essays
- Stabbing query 2 essays
- Stability 5 essays
- Stack 1 essay
- Stack depth 1 essay
- Stack invariant 1 essay
- Staircase 1 essay
- State 1 essay
- State bits 43 essays
- State explosion 2 essays
- State machine 2 essays
- State set 1 essay
- Stirling's approximation 3 essays
- Stochastic averaging 2 essays
- Stopping rule 3 essays
- Stream model 7 essays
- Streaming algorithm 10 essays
- Streaming model 15 essays
- String comparison 2 essays
- String matching 9 essays
- Strongly connected components 2 essays
- Sublinear 3 essays
- Sublinear algorithm 1 essay
- Subproblem 19 essays
- Subset construction 3 essays
- Substitution matrix 6 essays
- Substring 3 essays
- Succinct 5 essays
- Succinct structure 1 essay
- Suffix array 21 essays
- Suffix array sampling 4 essays
- Suffix automaton 6 essays
- Suffix trie 1 essay
- Summary 8 essays
- Swaps 10 essays
- Symbol 1 essay
- T-digest 1 essay
- Tail 7 essays
- Tail behaviour 4 essays
- Tail call 1 essay
- Tail latency 6 essays
- Temporal resolution 4 essays
- Thompson construction 1 essay
- Threat model 1 essay
- Three-way partition 3 essays
- Threshold 19 essays
- Tight bound 3 essays
- Time space tradeoff 4 essays
- Time window 7 essays
- Timestamp 10 essays
- Timsort 9 essays
- Toehold 3 essays
- Tolerance 4 essays
- Topological sort 3 essays
- Trace 5 essays
- Traceback 7 essays
- Trade 6 essays
- Trade off 101 essays
- Transitions 2 essays
- Transitivity 2 essays
- Transpose 1 essay
- Transposition 1 essay
- Traversal 6 essays
- Traversal order 3 essays
- Treap 5 essays
- Tree height 5 essays
- Tree shape 2 essays
- Treeify threshold 1 essay
- Triangle counting 2 essays
- Triangle inequality 8 essays
- Trie 9 essays
- Tug-of-war 3 essays
- Tuning constant 3 essays
- Turnstile model 2 essays
- Two choices 5 essays
- Two parameter bound 7 essays
- Ukkonen 1 essay
- Unbiased estimator 7 essays
- Uniform sampling 1 essay
- Union by rank 1 essay
- Union–find 1 essay
- Unit of cost 12 essays
- Universal hashing 4 essays
- Upper bound 8 essays
- Validity 2 essays
- Van emde boas layout 2 essays
- Variance 10 essays
- Vectorisation 1 essay
- Verification 14 essays
- Version history 5 essays
- Visited set 3 essays
- Walk 2 essays
- Wavelet tree 37 essays
- Weighted path length 2 essays
- Word size 1 essay
- Work 1 essay
- Working memory 2 essays
- Working set 9 essays
- Workload 1 essay
- Worst case 34 essays
- Worst case guarantee 10 essays
- Write amplification 5 essays
- Zipf 3 essays
- Zipf distribution 12 essays