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.
The spanning tree of a connected undirected graph G is a tree having all the vertices and some number of edges of G.
Questions related to algorithms that use numerical approximations for the problems of mathematical analysis.
Questions about methods and techniques to prove correctness of programs.
Questions about techniques for enforcing an agreed order of events between several concurrently executing threads. Specific synchronization mechanisms include mutexes (locks), condition variables, se…
A method in analysis of algorithms that considers the overall cost of a sequence of operations.
Questions about algorithms that deterministically generate sequences of numbers that have stochastic properties of random sequences.
Questions about algorithms related to substrings, or about properties of substrings.
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
equal to the length of the shortest program computing s and halting. Measures the lack of structure in a string.
Research on methods and techniques to ensure the utility and quality of software systems through design and development processes.
Questions about the relation of (subfields of) computer science to the relevant mathematical foundations and their application.
Model checking refers to the following problem: given a model of a system, test automatically whether this model meets a given specification.
verifying that a variable, expression or value has the declared type
used to transmit information through a noisy channel. They also have applications in theoretical computer science and combinatorics. Some well known error correcting codes a…
Creating samples from a well-specified population using a probabilistic method and/or producing random numbers from a specified distribution.
the problem of finding groups of data points (often modelled as nodes in a graph) that are closer to each other than to other points.