| a |
| almost well relation | Turchin's Relation and Subsequence Relation in Loop Approximation |
| c |
| combinatorial optimization | Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems |
| g |
| graphical modeling | Making the Evolution of Graphical Models Visible |
| h |
| Higman embedding | Turchin's Relation and Subsequence Relation in Loop Approximation |
| Human Computer Interface | Making the Evolution of Graphical Models Visible |
| l |
| loop approximation | Turchin's Relation and Subsequence Relation in Loop Approximation |
| m |
| message passing | A Sufficient Condition for the Observational Equivalence of Processes |
| Multiple Ant Colony Optimization | Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems |
| Multiple-trip vehicle routing problem | Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems |
| p |
| processes | A Sufficient Condition for the Observational Equivalence of Processes |
| program transformation | Turchin's Relation and Subsequence Relation in Loop Approximation |
| r |
| repository mining | Making the Evolution of Graphical Models Visible |
| s |
| sliding window protocol | A Sufficient Condition for the Observational Equivalence of Processes |
| supercompilation | Turchin's Relation and Subsequence Relation in Loop Approximation |
| t |
| textual modeling | Making the Evolution of Graphical Models Visible |
| v |
| verification | A Sufficient Condition for the Observational Equivalence of Processes |
| version control | Making the Evolution of Graphical Models Visible |
