Category:Computer science stubs
Appearance
This category is maintained by WikiProject Stub sorting. Please propose new stub templates and categories here before creation. |
This category is for stub articles relating to computer science. You can help by expanding them. To add an article to this category, use {{comp-sci-stub}} instead of {{stub}} . |
Subcategories
This category has the following subcategory, out of 15 total.
(previous page) (next page)Τ
- Computer science stub templates (26 P)
Pages in category "Computer science stubs"
The following 189 pages are in this category, out of approximately 491 total. This list may not reflect recent changes.
(previous page) (next page)O
- Oaklisp
- Object hierarchy
- Observability (software)
- Observational equivalence
- Occam-π
- Offset (computer science)
- One-pass algorithm
- Online optimization
- Ontology Definition MetaModel
- Ontology Inference Layer
- Opaque binary blob
- Opaque data type
- Open Architecture Computing Environment
- Open Knowledge Base Connectivity
- Operability
- Orthogonality (term rewriting)
P
- Pachinko allocation
- Page address register
- Parallel slowdown
- Parameter validation
- Path expression
- Peptide computing
- Percept (information technology)
- Persistent programming language
- PlanetLab
- PlusCal
- Polar surface area
- Polyvariance
- Portable object (computing)
- Prefetching
- Presentation semantics
- Principal (computer security)
- Principles of attention stress
- Prioritised Petri net
- Priority inheritance
- Program comprehension
- Program dependence graph
- Program transformation
- Programming by example
- Progressive disclosure
- Property equivalence
- Proportional share scheduling
- Protected procedure
- Proteins@home
- Pseudo-LRU
- Pseudoconversational transaction
- PSI Comp 80
- Pulse computation
R
- Raster Document Object
- RDF/XML
- Re-order buffer
- Read–modify–write
- Real computation
- Real-time Programming Language
- Recursive join
- Reflector (cellular automaton)
- Relationship extraction
- Relativistic programming
- Replicator (cellular automaton)
- Research Institute for Symbolic Computation
- Resource contention
- Retrenchment (computing)
- Reverse lookup
- RFPolicy
- ROAM
- Room synchronization
- Row data gateway
- Rule induction
- Run-to-completion scheduling
S
- Satplan
- Scalable TCP
- Schema evolution
- Secure environment
- Secure Operations Language
- Security Protocols Open Repository
- Semantic analysis (machine learning)
- Semantic computing
- Semantic resolution tree
- Semantic URL attack
- Semantometrics
- Service-oriented development of applications
- Services computing
- Session type
- Shotgun debugging
- Sign bit
- SIGSAM
- Simple HTML Ontology Extensions
- Simple precedence grammar
- Simple precedence parser
- Single pushout graph rewriting
- Single-user mode
- Single version of the truth
- Skill chaining
- Skin friction line
- Snapshot algorithm
- Soft state
- Software metering
- Spacefiller
- SPARQL Syntax Expressions
- SpatiaLite
- Speculative multithreading
- Speedup theorem
- Spoiler (security vulnerability)
- SSLIOP
- Stable storage
- Stanza (computing)
- Stochastic probe
- Stooge sort
- Storage violation
- Strangler fig pattern
- Streamlet (scientific visualization)
- Streamsurface
- STRIDE model
- Stride scheduling
- Structural risk minimization
- Structured content
- Stutter bisimulation
- Subspace Gaussian mixture model
- Summer School Marktoberdorf
- SureType
- Surfel
- SxS
- Symbolic simulation
- Symbolic trajectory evaluation
- Symposium on Parallelism in Algorithms and Architectures
- Symposium on Trends in Functional Programming
- Synaptic weight
- Synchronous Data Flow
- Synset
- Syntactic noise
- Syntax Definition Formalism
- System Fault Tolerance
- System migration
- System on TPTP
T
- Table data gateway
- Technical informatics
- Tensor glyph
- Test bench
- Texture advection
- Theory of regions
- Thomas write rule
- Thought vector
- Time aware long short-term memory
- Timer coalescing
- Tombstone diagram
- Trace-based simulation
- Transaction data
- Traversed edges per second
- Trellis quantization
- Truncation selection
- Turing Talk
- Turnaround document
- Twin vector quantization
- Two-level scheduling
- Type erasure
- Typed assembly language