Run-length encoding is a lossless compression technique that replaces consecutive repetitions of a value with a representation of that value and its repetition count.
run-length-encodingSatisfiability Modulo TheoriesSatisfiability modulo theories combines Boolean reasoning with mathematical theories to determine whether logical constraints admit a model.
satisfiability-modulo-theoriesShor's AlgorithmShor’s algorithm uses quantum period finding to factor integers and compute discrete logarithms in polynomial time, challenging widely used public-key cryptography.
shors-algorithmShortest Path ProblemThe shortest path problem finds a route of minimum total weight between vertices in a graph, with algorithms determined by graph structure and edge weights.
shortest-path-problemSMT-LIBSMT-LIB is an international initiative providing standard languages, logical theories, and benchmark collections for satisfiability modulo theories solvers.
smt-libSorting AlgorithmA sorting algorithm rearranges data into a specified order, with performance determined by its comparison model, memory requirements, stability, and input characteristics.
sorting-algorithmSpace ComplexitySpace complexity measures how an algorithm’s memory requirements grow with input size, under a specified computational model and accounting convention.
space-complexityStable SortingStable sorting preserves the original relative order of elements that compare as equal, allowing earlier ordering information to survive subsequent sorts.
stable-sortingStack (Data Type)A stack is an abstract data type that stores elements in last-in, first-out order, supporting insertion and removal at one designated end.
stack-data-typeStrassen AlgorithmStrassen’s algorithm multiplies matrices using seven recursive block products instead of eight, reducing arithmetic complexity below cubic time.
strassen-algorithmStrong Exponential Time HypothesisThe Strong Exponential Time Hypothesis asserts that the exponential-time complexity of Boolean satisfiability approaches exhaustive search as clause width increases.
strong-exponential-time-hypothesisTime ComplexityTime complexity describes how the computational work required by an algorithm grows with the size of its input under a specified computational model.
time-complexityTimsortTimsort is a stable, adaptive sorting algorithm that combines natural merge sort with insertion sort to exploit existing order in data.
timsortTree (Data Structure)A tree is a hierarchical data structure whose parent–child relationships support efficient searching, indexing, prioritization, and representation of nested information.
tree-data-structureTuring AwardThe Turing Award is an annual ACM prize recognizing contributions of lasting and major technical importance to computing.
turing-awardTuring CompletenessTuring completeness is the ability of a computational system, given unbounded resources, to simulate any Turing machine.
turing-completenessTuring MachineA Turing machine is an abstract computational model used to define algorithms, establish limits of computability, and analyze computational resources.
turing-machineUnique Games ConjectureA conjecture in computational complexity asserting that distinguishing almost satisfiable unique constraint systems from highly unsatisfiable ones is NP-hard.
unique-games-conjectureUniversal Turing MachineA universal Turing machine is a single abstract computing machine that can simulate any Turing machine from an encoded description and input.
universal-turing-machineXorshiftXorshift is a family of fast pseudorandom number generators that update their state using bitwise exclusive-or and shift operations.
xorshiftZstandardZstandard is a lossless compression algorithm and format designed to combine fast compression and decompression with adjustable compression ratios and support for trained dictionaries.
zstandard