Computer science
- Basic block (compilers)
- Static Single Assignment form
- Continuation-passing style
- Three-address code
- A-normal form
- Superscalar processor
- What is symbolic computation?
- Backus–Naur form
- Common subexpression elimination
- Aho–Corasick algorithm
- Knuth–Morris–Pratt algorithm
- Very Long Instruction Word
- Branch table
- Double-ended queue
- Software transactional memory
- The downsides of the Actor model (Concurrency)
- String interning
- Reference counting
- Tracing garbage collection
- Communicating sequential processes
- History of operating systems
- Native POSIX Thread Library
- How do mutexes really work?
- How does a mutex work? What does it cost?
- Monitor (synchronization)
- Monitor vs Mutex
- Why UI frameworks are mostly single threaded?
- ETL - Extract, Transform, Load
- primary/replica (technology)
- Associative array
- Hash function
- Hamming distance
- Self-organizing list
- A Gentle Introduction To Graph Theory
- Coroutine
- Preemption
- Critical section
- Mutual exclusion
- Protection ring
- vDSO
- Thunk
- Tagged union
- Algebraic data type
- Partition refinement
- Shunting-yard algorithm
- GC Cheney’s algorithm
- SOLID
- What is CQRS and why you should be be careful with it
- Typed vs Untyped Virtual Machines
- Binary translation
- References are like jumps