ويكيبيديا:مبادرة العطاء الرقمي/المقالات المقترحة/علم الحاسوب
Computer Science[عدل]
- SHA-2
- Speculative execution
- Year 2038 problem
- Directed acyclic graph
- Cluster analysis
- SHA-1
- Bitwise operation
- ECMAScript
- Breadth-first search
- 3-D Secure
- Usage share of operating systems
- Polymorphism
- Block cipher mode of operation
- Salt
- Exclusive or
- Hash-based message authentication code
- Extract
- Singleton pattern
- Cryptanalysis of the Enigma
- Trie
- Heapsort
- Rainbow table
- Tree traversal
- Behavior-driven development
- TypeScript
- Levenshtein distance
- Activation function
- Code talker
- Abstract data type
- Artificial general intelligence
- Database schema
- Prim's algorithm
- Join
- Factory method pattern
- Minimum spanning tree
- Hierarchical clustering
- Topological sorting
- Cypherpunk
- Cosine similarity
- Priority queue
- Relational model
- List of academic databases and search engines
- Zero-knowledge proof
- Magic number
- Monad
- Branch predictor
- Hamming distance
- Boolean satisfiability problem
- Radix sort
- Business Process Model and Notation
- Context-free grammar
- Foobar
- Shortest path problem
- Idempotence
- Applications of artificial intelligence
- Third normal form
- One-time password
- Memory hierarchy
- Best
- Check digit
- Binary heap
- Real-time computing
- Letter frequency
- Integer
- Elliptic Curve Digital Signature Algorithm
- Jaccard index
- Relational algebra
- Event-driven programming
- Bombe
- Windows-1252
- Canny edge detector
- Message authentication code
- B+ tree
- Colossus computer
- Command pattern
- Associative array
- Beale ciphers
- Actor model
- Star schema
- Call stack
- Birthday attack
- Object-oriented analysis and design
- Context switch
- Forward secrecy
- Column-oriented DBMS
- Shamir's Secret Sharing
- Blowfish
- Second normal form
- Role-based access control
- Microkernel
- RC4
- Signed number representations
- David Gelernter
- Block cipher
- Anomaly detection
- Comparison of relational database management systems
- Chomsky hierarchy
- Data mart
- Exception handling
- Open Database Connectivity
- Database design
- Linker
- Linear congruential generator
- Teradata
- Cut
- Closure
- Isolation
- Digital Signature Algorithm
- Digest access authentication
- Self-balancing binary search tree
- Currying
- Abstract factory pattern
- Coroutine
- Dining philosophers problem
- Generic programming
- Apriori algorithm
- Connected component
- Two-phase commit protocol
- Illegal prime
- Multiple inheritance
- Skip list
- Fibonacci heap
- Circular buffer
- Delimiter
- Vertex cover
- Quantum programming
- Alice and Bob
- Hill climbing
- Agent-based model
- Cell
- Architectural pattern
- Preemption
- Data structure alignment
- Doubly linked list
- Division algorithm
- List of NP-complete problems
- Master theorem
- Two-phase locking
- Bucket sort
- Fragmentation
- Maximum flow problem
- Shellsort
- Discrete logarithm
- Xerox Alto
- Database transaction
- R-tree
- Multiplication algorithm
- Flat file database
- Tree structure
- Asynchronous I/O
- Common Lisp
- Grover's algorithm
- Adjacency list
- No free lunch theorem
- In-memory database
- Tail call
- Key size
- Universal Turing machine
- Higher-order function
- JD Edwards
- Time series database
- Memory segmentation
- Code page 437
- String searching algorithm
- Atomicity
- ALGOL 60
- Splay tree
- Hamiltonian path problem
- Functional dependency
- Independent set
- Initialization vector
- Row- and column-major order
- Edit distance
- Secret sharing
- Branch
- Short-circuit evaluation
- Counting sort
- Mersenne Twister
- Max-flow min-cut theorem
- Kolmogorov complexity
- Combinatorial optimization
- S-expression
- C99
- Type conversion
- Computer chess
- Futures and promises
- History of cryptography
- Graph
- Message passing
- Set cover problem
- Abstraction layer
- Static program analysis
- Snowflake schema
- Dynamic programming language
- Computational complexity of mathematical operations
- Timeline of quantum computing
- PKCS
- Concurrency control
- System programming
- Radix tree
- Serializability
- List
- Inverted index
- Loose coupling
- Cryptographically secure pseudorandom number generator
- Amortized analysis
- Outline of computer science
- Executive information system
- Approximate string matching
- Nonlinear programming
- First-class function
- DBase
- Relational operator
- Pattern matching
- Communicating sequential processes
- Suffix tree
- Codd's 12 rules
- Authenticated encryption
- VC dimension
- Double-ended queue
- Outline of artificial intelligence
- Denormalization
- Formal verification
- User error
- Cycle detection
- Standard ML
- Consistency model
- Static single assignment form
- Randomized algorithm
- Strassen algorithm
- Profiling
- Decision problem
- Comparison of database tools
- Compare-and-swap
- Blob detection
- Constraint satisfaction problem
- Quantum information
- Algorithmic efficiency
- Operational data store
- Interval tree
- Side effect
- Coq
- Quickselect
- Kent Beck
- CORDIC
- Parsing expression grammar
- Blind signature
- Approximation algorithm
- Cursor
- Non-deterministic Turing machine
- Multiversion concurrency control
- Spatial database
- Programming language theory
- Statement
- Object code
- Candidate key
- Array programming
- Control flow graph
- Fixed-point combinator
- Citation index
- Fold
- X86 memory segmentation
- Trapdoor function
- Public key fingerprint
- Feature detection
- Pumping lemma for regular languages
- Where
- Longest common substring problem
- Web of trust
- Null
- Handwriting recognition
- Object file
- Duff's device
- IEEE 754-1985
- Reentrancy
- Clipping
- Affine cipher
- Cyc
- Algebraic data type
- Literate programming
- Topological data analysis
- Web engineering
- Job shop scheduling
- Dual EC DRBG
- Anonymous P2P
- Delegation pattern
- Pre-shared key
- Reversible computing
- Clipper chip
- Oracle machine
- Fourth normal form
- Iterator
- Signed zero
- Continuation-passing style
- Demand paging
- Context-free language
- Haxe
- Avalanche effect
- Don Norman
- Salsa20
- Trusted Computing
- Collision attack
- Peterson's algorithm
- Optimizing compiler
- Cold boot attack
- Local search
- Void type
- Microsoft Jet Database Engine
- Self-modifying code
- Cuckoo hashing
- Differential cryptanalysis
- CYK algorithm
- Ring signature
- Forward chaining
- Adversary
- CiteSeerX
- Set
- Evaluation strategy
- Data architecture
- Mean shift
- Bibliographic database
- MINIX 3
- Starvation
- Dependent type
- Hidden surface determination
- Glossary of graph theory terms
- Graph drawing
- Entry point
- Classical cipher
- Backward chaining
- Calling convention
- Hoare logic
- Commitment scheme
- Tree rotation
- Consistency
- Arthur Samuel
- Continuation
- Comparison sort
- Union type
- Factory
- Quadratic probing
- Ambiguous grammar
- Pseudorandom binary sequence
- Entropy encoding
- TorChat
- Cocktail shaker sort
- Model checking
- De Bruijn sequence
- Application virtualization
- Business performance management
- AI-complete
- Minimum-cost flow problem
- List of important publications in computer science
- List of online databases
- K-ary tree
- S-box
- OLE DB
- Comparison of parser generators
- Schnorr signature
- SIGGRAPH
- Affective computing
- Information visualization
- List of computer science conferences
- Binary decision diagram
- CCM mode
- Treemapping
- Lamport signature
- Communications security
- Embedded database
- Software transactional memory
- David Cheriton
- SQL Server Compact
- 2-satisfiability
- Game tree
- System F
- Meet-in-the-middle attack
- Malleability
- Dynamic loading
- A New Kind of Science
- Code
- No free lunch in search and optimization
- Subtyping
- Pipeline
- Parametric polymorphism
- Computer programming in the punched card era
- Map
- Collision resistance
- Communications Security Establishment
- Dominating set
- Christos Papadimitriou
- BQP
- Bitmap index
- DPLL algorithm
- Left recursion
- Graph isomorphism problem
- Disassembler
- Declaration
- Las Vegas algorithm
- Suffix array
- CPLEX
- Computational intelligence
- ALGOL 68
- Register allocation
- Terminal and nonterminal symbols
- Model-driven architecture
- Unification
- Treap
- CBC-MAC
- Denotational semantics
- End-user development
- Universal hashing
- Delete
- Temporal Key Integrity Protocol
- DFA minimization
- Fifth normal form
- Key server
- RSA problem
- SQL-92
- Aravind Joshi
- Cooperative multitasking
- Polynomial-time reduction
- Answer set programming
- Squeak
- Access Control Matrix
- Exact cover
- H.263
- Network Security Services
- Technology strategy
- Rope
- Blum Blum Shub
- Autokey cipher
- Tracing garbage collection
- Pseudo-polynomial time
- Single event upset
- Subgraph isomorphism problem
- Carnegie Mellon School of Computer Science
- Optimal asymmetric encryption padding
- Algorithmic information theory
- Operator-precedence parser
- Armstrong's axioms
- Dutch national flag problem
- Linear programming relaxation
- Tree sort
- 74181
- Graph partition
- Confusion and diffusion
- Opportunistic TLS
- Glasgow Haskell Compiler
- Sorting network
- Call graph
- IBM Informix
- Gerald Jay Sussman
- PowerPC G4
- Block size
- EFF DES cracker
- Lamport's bakery algorithm
- Autonomic computing
- Advanced Encryption Standard process
- Artificial bee colony algorithm
- Van Emde Boas tree
- Computational creativity
- Rewriting
- Radiosity
- Operational semantics
- Deep Thought
- Maximal independent set
- Data domain
- Transactional memory
- Poly1305
- Instrumentation
- Jakob Nielsen
- Paillier cryptosystem
- Structural type system
- ElGamal signature scheme
- Graph cuts in computer vision
- Variable-length code
- CODASYL
- Microsoft Data Access Components
- Anonymous remailer
- Chosen-ciphertext attack
- Atomic commit
- Correctness
- Relational calculus
- Color quantization
- Aspect-oriented software development
- Empty string
- Tacit programming
- NSAKEY
- Chromatic polynomial
- Karger's algorithm
- Parameterized complexity
- Abstract interpretation
- Frame
- W. T. Tutte
- French Institute for Research in Computer Science and Automation
- ID-based encryption
- SQL Anywhere
- Data aggregation
- Dead code elimination
- NetLogo
- Camellia
- Hadamard code
- Data element
- Cigarette smokers problem
- Presburger arithmetic
- Ralph Kimball
- AA tree
- Asymptotic computational complexity
- Unique games conjecture
- Durability
- Proof assistant
- Canonical LR parser
- Deterministic pushdown automaton
- Earley parser
- Expander graph
- Loop optimization
- Channel I/O
- Computation tree logic
- Semantic security
- Constant folding
- Ciphertext indistinguishability
- Ad hoc polymorphism
- Name binding
- Destructor
- Function composition
- Jonathan Zittrain
- McEliece cryptosystem
- XOR linked list
- Skipjack
- DBLP
- Accuracy paradox
- Schedule
- Concatenative programming language
- Modula-3
- Lagrangian relaxation
- Interactive proof system
- Parallel random-access machine
- MAINWAY
- Nominal type system
- NTRUEncrypt
- Montgomery modular multiplication
- Distributed algorithm
- Trusted Computing Group
- Bees algorithm
- Turing degree
- Compiler-compiler
- NSA encryption systems
- Crypt
- Isabelle
- Arts and Humanities Citation Index
- Terry Sejnowski
- Collection
- Yarrow algorithm
- Merge
- Hybrid cryptosystem
- Powerset construction
- Sharp-P-complete
- Keystroke-level model
- Database theory
- Commit
- Secure voice
- Naked objects
- PowerPC 7xx
- Rule 184
- Inline assembler
- Unit type
- Structural induction
- Executable UML
- Arlington Hall
- Automatic parallelization
- B*
- Acoustic cryptanalysis
- GLR parser
- Polynomial-time approximation scheme
- Filesystem-level encryption
- Rubberhose
- Grille
- Mutual recursion
- Dominator
- Gpg4win
- Deterministic context-free language
- Leftist tree
- Catamorphism
- Back-end database
- Call-with-current-continuation
- Average-case complexity
- Agent-based computational economics
- Fortuna
- Turing reduction
- PCP theorem
- Partial evaluation
- Bill Inmon
- Corecursion
- SQL:2003
- Rabin cryptosystem
- Greibach normal form
- Comparison of object-relational database management systems
- Cryptographic Service Provider
- Pairing-based cryptography
- Generic function
- Zentralblatt MATH
- Crypto phone
- Multimap
- Function type
- GOST
- CAST-128
- Generalized algebraic data type
- Edmonds' algorithm
- KeeLoq
- SQL/PSM
- Circuit complexity
- Tree decomposition
- David J. Farber
- Domain-key normal form
- Simple Features
- Graph minor
- 40-bit encryption
- Chan's algorithm
- Transaction data
- Kleene's recursion theorem
- Object type
- Operational system
- Pairing heap
- Jim Bell
- Government database
- O(1) scheduler
- Michael A. Jackson
- Guarded Command Language
- List of complexity classes
- List of terms relating to algorithms and data structures
- Linear grammar
- Ross J. Anderson
- Introduction to Automata Theory
- TLS-PSK
- Generalized suffix tree
- Domain-specific modeling
- Astrophysics Data System
- Edge cover
- W-shingling
- Upper ontology
- SLD resolution
- Btrieve
- Charles H. Moore
- Station-to-Station protocol
- L
- Authorization certificate
- OCB mode
- Distributed concurrency control
- String operations
- Predicate transformer semantics
- Pie menu
- Jeffrey Ullman
- Search problem
- Operator-precedence grammar
- Flashsort
- Trellis
- Brian Reid
- EAX mode
- Blinding
- Hutter Prize
- Mizar system
- Threshold cryptosystem
- Role-oriented programming
- Check constraint
- Automated proof checking
- Esterel
- Proxy re-encryption
- Knuth Prize
- CMAC
- Pairing
- Total functional programming
- Communication complexity
- Feedback arc set
- Competitive analysis
- Quantum walk
- NESSIE
- Cardan grille
- The Third Manifesto
- Integrity constraints
- Cryptography law
- SQL:2008
- Interface-based programming
- Fair-share scheduling
- Database audit
- Internet studies
- BD+
- Snark
- Probabilistically checkable proof
- Skew heap
- Expression-oriented programming language
- Dijkstra Prize
- Language technology
- A Symbolic Analysis of Relay and Switching Circuits
- Tutte polynomial
- 3M computer
- KASUMI
- Tomaso Poggio
- Asymptotically optimal algorithm
- Data warehouse appliance
- Cyberinfrastructure
- Three-pass protocol
- D
- Anonym.OS
- Jack Edmonds
- Delimited continuation
- IBM Research - Almaden
- Community network
- P/poly
- Lustre
- Probabilistic encryption
- Adaptive quadrature
- Vantage-point tree
- Conditional loop
- McCarthy 91 function
- Fusion tree
- Bozo bit
- Jack Dongarra
- Hasty Pudding cipher
- John Gage
- Application streaming
- MQV
- Boomerang attack
- Commitment ordering
- Key encapsulation
- Introselect
- Data element definition
- Coinduction
- OpenBSD security features
- CAcert.org
- Result set
- Link time
- Attack model
- Quantum finite automata
- Michael McRobbie
- Arrow
- Web of Knowledge
- AN/CYZ-10
- ISAAC
- Fractional cascading
- Multivariate cryptography
- A5/2
- IEEE P1363
- Feedback vertex set
- Abstraction inversion
- Deterministic encryption
- Peter J. Denning
- Maclisp
- YAWL
- Enterprise Data Modeling
- Anubis
- David Eppstein
- Andrew Project
- ARIA
- Catalog Service for the Web
- Aozora Bunko
- E0
- L-attributed grammar
- BATON
- Lock
- Automatic label placement
- ZINC database
- Parity game
- Secure Hash Standard
- Combinatorial search
- Platform-independent model
- Verifiable secret sharing
- Broadcast encryption
- SPIN model checker
- Kernelization
- Gadget
- V
- FEAL
- Order by
- Calculus of communicating systems
- Call Level Interface
- One-way quantum computer
- Lucid
- Computers and Intractability
- Brian Randell
- Artificial stupidity
- Vertex separator
- Laguerre's method
- POSSE project
- Mario Szegedy
- Interlock protocol
- Peter Landin
- Regular tree grammar
- Cobham's thesis
- Stable model semantics
- National DNA database
- Recordset
- Server-Gated Cryptography
- List of academic computer science departments
- Jim Highsmith
- Quantum digital signature
- WATFIV
- Alex Biryukov
- Merkle's Puzzles
- Hugh Darwen
- Block cellular automaton
- Soft heap
- Semi-Thue system
- ICE
- Oakley protocol
- Distinguishing attack
- ContactPoint
- CAST-256
- Proof complexity
- Cluster state
- Normal number
- Scott Ambler
- Deniable authentication
- The Humane Interface
- R
- James Clark
- KeY
- Combined Cipher Machine
- A-normal form
- Addition-chain exponentiation
- St-connectivity
- Strong NP-completeness
- List decoding
- AntiPatterns
- Cellular Message Encryption Algorithm
- Integrated Computer-Aided Manufacturing
- Star height problem
- Higher-order abstract syntax
- 3-Way
- Raphael Finkel
- List of functional programming topics
- John Alan Robinson
- Anonymous recursion
- Hirsch conjecture
- Hidden Field Equations
- Action at a distance
- NSPACE
- David E. Goldberg
- Graph state
- Information-based complexity
- Book embedding
- Tony Hey
- Kuroda normal form
- Common Algebraic Specification Language
- Ronald Fedkiw
- Full Domain Hash
- NTRUSign
- Hessian form of an elliptic curve
- P-Grid
- Benaloh cryptosystem
- Adaptive grammar
- Blom's scheme
- Automated Mathematician
- Anticipatory scheduling
- Global serializability
- Lovelace Medal
- Schnorr group
- Information algebra
- Symposium on Principles of Programming Languages
- Index locking
- Complete
- 2-EXPTIME
- Strong RSA assumption
- Coding by exception
- PostBQP
- Gio Wiederhold
- Fagin's theorem
- Paul H. Cress
- IDEA NXT
- Rabin signature algorithm
- Abstract family of languages
- Declarative Referential Integrity
- Artificial chemistry
- Heinz Zemanek
- Cryptomeria cipher
- Weak NP-completeness
- Encyclopedia of Reagents for Organic Synthesis
- Charles Goldfarb
- Akelarre
- COCONUT98
- Architecture of Btrieve
- Concrete security
- Cocks IBE scheme
- CMN-GOMS
- Mathematical Optimization Society
- Advice
- GMR
- Hierocrypt
- Monoculture
- ATLA Religion Database
- Implicit certificate
- Efficient Probabilistic Public-Key Encryption Scheme
- Complexity of constraint satisfaction
- CIPHERUNICORN-A
- David S. H. Rosenthal
- Muller automaton
- International Symposium on Graph Drawing
- CIPHERUNICORN-E
- SafetyLit
- Kotok-McCarthy
- GGH signature scheme
- Disaster informatics
- Graph-structured stack
- Decision Linear assumption
- Helmut Schreyer
- Herb Grosch
- David McGoveran
- Gerhard Weikum
- Plaintext-aware encryption
- Conjunctive grammar
- Constraint satisfaction dual problem
- Analytical Sciences Digital Library
- Cris Kobryn
- John Amsden Starkweather
- LR-attributed grammar
- Tom Berson
- Thomsen Diagrams
- Harmony Compiler
- Demzilla
- ADOdb Lite
- Nikos Lorentzos
- ECLR-attributed grammar