A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.

Used in questions asking for efficient (polynomial-time) reductions between computational problems.
A precedence graph or conflict graph or serializability graph is a graph of conflicts between transactions in a database.
3 questions
97 questions
a greedy algorithm which forms minimum spanning tree for the given graph. During execution, Prim's algorithm grows single tree by adding edges to it, unlike Kruskal's algorithm in …
15 questions
Questions about (typically randomized) algorithms that can produce no or an incorrect answer with a certain probability.
173 questions
Questions about the branch of mathematics concerned with modelling and analysing random phenomena.
414 questions
Process algebras (also known as process calculi) are formal models of concurrency
23 questions
Questions about how operating systems decide which process to execute at which time.
138 questions
Questions related to design, implementation, and analysis of programming languages. NOT for questions about how to program, which are off-topic on this site.
Questions about how to optimise a program's performance, both manually and automatically, e.g. in compilers.
76 questions
0 questions
the most commonly used logic programming language. It supports non-deterministic programming through backtracking and pattern matching through unification.
34 questions
Applications that allow to create formal proofs. They assist the user by finding partial and checking complete proofs.
83 questions
a system where one can show an easily verifiable witness that they computed some amount of work, useful or not.
4 questions
Questions about general methods and techniques for proving multiple theorems. When asking about the proof of a single statement, use tags relating to what the proof is about instead.
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
116 questions
Necessary properties of formal langagues in certain classes that rely on closure against repetition of certain subwords. Make sure your question isn't covered by applying the techniques in https://cs…
Questions about state machines with a single stack for memory. They characterize the class of context-free languages.
off-topic here. Do not ask questions about how to write code in Python. However, conceptual questions about computer science are more appropriate. See our help center for the…
A computation model which relies on quantum-mechanic phenomena, such as entanglement and superposition. This generalizes the probabilistic model of computation.
240 questions
12 13
15 16