Category:Theoretical computer science

A

• Algorithms (59 C, 137 P)

C

• Computational learning theory (22 P)

E

• Evolutionary computation (5 C, 22 P)

F

• Formal languages (13 C, 202 P)
• Formal methods (18 C, 104 P)

G

• Graph theory (26 C, 94 P)

I

• Information theory (17 C, 206 P)

L

• Logic in computer science (20 C, 103 P)

M

• Mathematical theorems in theoretical computer science (1 C, 6 P)
• Mathematics of computing (6 C, 8 P)

N

• Natural computation (3 P)

P

• Problems in computer science (2 C, 5 P)
• Pseudorandomness (1 C, 17 P)
• Pursuit–evasion (1 C, 15 P)

Q

• Quantum computing (3 C, 95 P)
• Quantum information science (8 C, 178 P)

R

• Rewriting systems (5 C, 36 P)

T

• Theoretical computer science conferences (39 P)
• Theoretical computer science journals (2 C, 4 P)
• Theoretical computer scientists (8 C, 141 P)
• Theory of computation (8 C, 92 P)

Σ

• Theoretical computer science stubs (1 C, 75 P)

• Theoretical computer science

A

• ACM Doctoral Dissertation Award
• ACM SIGACT
• Algorithm
• Algorithm engineering
• Algorithmic logic
• Algorithmic technique
• Algorithmic transparency
• Ambient calculus
• Analysis of Boolean functions
• Angelic non-determinism
• API-Calculus
• Automated reasoning

B

• Bigraph
• Bio-inspired computing
• Bird–Meertens formalism
• Bisimulation
• Bridging model
• British Colloquium for Theoretical Computer Science

C

• Calculating Space
• Categorical logic
• Chaos computing
• Chemical computer
• Circuit Value Problem
• Cobham's theorem
• Coinduction
• Combinatorial optimization
• Comp.theory
• Complexity class
• Complexity function
• Computability in Europe
• Computation
• Computational irreducibility
• Computational problem
• Concurrence (quantum computing)
• Configurable modularity
• Corecursion
• Correctness (computer science)

D

• Demonic non-determinism
• Description number
• Dis-unification
• Dominance-based rough set approach
• Dynamic Data Driven Applications Systems

E

• Erdős Lectures
• Error tolerance (PAC learning)
• European Association for Theoretical Computer Science
• Exact cover
• Expander mixing lemma
• Extractor (mathematics)

F

• Flajolet Lecture Prize
• Formal language
• Formal methods
• Formal verification
• French Institute for Research in Computer Science and Automation
• Full-employment theorem
• Fundamenta Informaticae

G

• Glossary of quantum computing
• Gödel Prize
• Grammar systems theory
• Granular computing

H

• Hidden subgroup problem
• Hindley–Milner type system
• Hub labels

I

• Idempotence
• Indirect self-reference
• Institution (computer science)
• Institutional model theory
• Interactive computation

J

• Journal of Automata, Languages and Combinatorics

K

• Knowledge Based Software Assistant
• Knuth Prize
• Knuth's Simpath algorithm
• Krivine machine

L

• Lambda calculus
• Language of Temporal Ordering Specification
• Learning augmented algorithm
• Least-squares spectral analysis
• Level ancestor problem
• LogP machine
• Lowest common ancestor
• Lulu smoothing

M

• Machine learning in physics
• Manifold hypothesis
• Medvedev reducibility
• Monge array
• Motion planning

N

• Natural computing
• Neighbour-sensing model
• Nerode Prize
• Nominal techniques
• Nominal terms (computer science)

O

• Occam learning

P

• Pattern language (formal languages)
• PEPA
• Π-calculus
• Postselection
• Probabilistic bisimulation
• Profinite word
• Promise theory
• Property testing
• Pseudorandomness

Q

• Quantum algorithm
• Quantum capacity
• Quantum complexity theory
• Quantum computing
• Quantum digital signature
• Quantum machine learning
• Quasi-empiricism in mathematics

R

• Ranked alphabet
• Recursion (computer science)
• Recursive definition
• Reed–Muller code
• Regular numerical predicate
• Representer theorem
• Rough set

S

• Safety and liveness properties
• Scientific community metaphor
• Selman's theorem
• Semantic spacetime
• Semigroup action
• Simulation (computer science)
• Small-bias sample space
• Spintronics
• Summer School Marktoberdorf
• Sun–Ni law

T

• Tardiness (scheduling)
• Theory of Computing Systems
• Threshold theorem
• Transcriptor
• Tree (automata theory)
• Tree automaton
• Tree transducer
• Random-access Turing machine
• Turing machine

U

• Unrestricted algorithm

W

• Weakest precondition