Matches in LOV for { ?s <http://www.w3.org/2000/01/rdf-schema#label> ?o. }
- D.4.7.4 label "D.4.7.4. Real-time systems and embedded systems".
- D.4.8.0 label "D.4.8.0. Measurements".
- D.4.8.1 label "D.4.8.1. Modeling and prediction".
- D.4.8.2 label "D.4.8.2. Monitors".
- D.4.8.3 label "D.4.8.3. Operational analysis".
- D.4.8.4 label "D.4.8.4. Queueing theory".
- D.4.8.5 label "D.4.8.5. Simulation".
- D.4.8.6 label "D.4.8.6. Stochastic analysis".
- D.4.9.0 label "D.4.9.0. Command and control languages".
- D.4.9.1 label "D.4.9.1. Linkers".
- D.4.9.2 label "D.4.9.2. Loaders".
- D.4.9.3 label "D.4.9.3. Window managers".
- D.4.m label "D.4.m. Miscellaneous".
- D.m.0 label "D.m.0. Software psychology".
- E.0 label "E.0. GENERAL".
- E.1.0 label "E.1.0. Arrays".
- E.1.1 label "E.1.1. Distributed data structures".
- E.1.2 label "E.1.2. Graphs and networks".
- E.1.3 label "E.1.3. Lists, stacks, and queues".
- E.1.4 label "E.1.4. Records".
- E.1.5 label "E.1.5. Tables".
- E.1.6 label "E.1.6. Trees".
- E.2.0 label "E.2.0. Composite structures".
- E.2.1 label "E.2.1. Contiguous representations".
- E.2.2 label "E.2.2. Hash-table representations".
- E.2.3 label "E.2.3. Linked representations".
- E.2.4 label "E.2.4. Object representation".
- E.2.5 label "E.2.5. Primitive data items".
- E.3.0 label "E.3.0. Code breaking".
- E.3.1 label "E.3.1. Data encryption standard".
- E.3.2 label "E.3.2. Public key cryptosystems".
- E.3.3 label "E.3.3. Standards".
- E.4.0 label "E.4.0. Data compaction and compression".
- E.4.1 label "E.4.1. Error control codes".
- E.4.2 label "E.4.2. Formal models of communication".
- E.4.3 label "E.4.3. Nonsecret encoding schemes".
- E.5.0 label "E.5.0. Backup/recovery".
- E.5.1 label "E.5.1. Optimization".
- E.5.2 label "E.5.2. Organization/structure".
- E.5.3 label "E.5.3. Sorting/searching".
- E.m label "E.m. MISCELLANEOUS".
- F.0 label "F.0. GENERAL".
- F.1.0 label "F.1.0. General".
- F.1.1.0 label "F.1.1.0. Automata".
- F.1.1.1 label "F.1.1.1. Bounded-action devices".
- F.1.1.2 label "F.1.1.2. Computability theory".
- F.1.1.3 label "F.1.1.3. Relations between models".
- F.1.1.4 label "F.1.1.4. Self-modifying machines".
- F.1.1.5 label "F.1.1.5. Unbounded-action devices".
- F.1.2.0 label "F.1.2.0. Alternation and nondeterminism".
- F.1.2.1 label "F.1.2.1. Interactive and reactive computation".
- F.1.2.2 label "F.1.2.2. Online computation".
- F.1.2.3 label "F.1.2.3. Parallelism and concurrency".
- F.1.2.4 label "F.1.2.4. Probabilistic computation".
- F.1.2.5 label "F.1.2.5. Relations among modes".
- F.1.2.6 label "F.1.2.6. Relativized computation".
- F.1.3.0 label "F.1.3.0. Complexity hierarchies".
- F.1.3.1 label "F.1.3.1. Machine-independent complexity".
- F.1.3.2 label "F.1.3.2. Reducibility and completeness".
- F.1.3.3 label "F.1.3.3. Relations among complexity classes".
- F.1.3.4 label "F.1.3.4. Relations among complexity measures".
- F.1.m label "F.1.m. Miscellaneous".
- F.2.0 label "F.2.0. General".
- F.2.1.0 label "F.2.1.0. Computation of transforms".
- F.2.1.1 label "F.2.1.1. Computations in finite fields".
- F.2.1.2 label "F.2.1.2. Computations on matrices".
- F.2.1.3 label "F.2.1.3. Computations on polynomials".
- F.2.1.4 label "F.2.1.4. Number-theoretic computations".
- F.2.2.0 label "F.2.2.0. Complexity of proof procedures".
- F.2.2.1 label "F.2.2.1. Computations on discrete structures".
- F.2.2.2 label "F.2.2.2. Geometrical problems and computations".
- F.2.2.3 label "F.2.2.3. Pattern matching".
- F.2.2.4 label "F.2.2.4. Routing and layout".
- F.2.2.5 label "F.2.2.5. Sequencing and scheduling".
- F.2.2.6 label "F.2.2.6. Sorting and searching".
- F.2.3 label "F.2.3. Tradeoffs between Complexity Measures".
- F.3.0 label "F.3.0. General".
- F.3.1.0 label "F.3.1.0. Assertions".
- F.3.1.1 label "F.3.1.1. Invariants".
- F.3.1.2 label "F.3.1.2. Logics of programs".
- F.3.1.3 label "F.3.1.3. Mechanical verification".
- F.3.1.4 label "F.3.1.4. Pre- and post-conditions".
- F.3.1.5 label "F.3.1.5. Specification techniques".
- F.3.2.0 label "F.3.2.0. Algebraic approaches to semantics".
- F.3.2.1 label "F.3.2.1. Denotational semantics".
- F.3.2.2 label "F.3.2.2. Operational semantics".
- F.3.2.3 label "F.3.2.3. Partial evaluation".
- F.3.2.4 label "F.3.2.4. Process models".
- F.3.2.5 label "F.3.2.5. Program analysis".
- F.3.3.0 label "F.3.3.0. Control primitives".
- F.3.3.1 label "F.3.3.1. Functional constructs".
- F.3.3.2 label "F.3.3.2. Object-oriented constructs".
- F.3.3.3 label "F.3.3.3. Program and recursion schemes".
- F.3.3.4 label "F.3.3.4. Type structure".
- F.3.m label "F.3.m. Miscellaneous".
- F.4.0 label "F.4.0. General".
- F.4.1.0 label "F.4.1.0. Computability theory".
- F.4.1.1 label "F.4.1.1. Computational logic".
- F.4.1.10 label "F.4.1.10. Temporal logic".
- F.4.1.2 label "F.4.1.2. Lambda calculus and related systems".