Euclidean algorithmIn mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that…View analysis →
Complexity classIn computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly analyzed resources are…View analysis →
Linked listIn computer science, a linked list is a linear collection of data elements whose order is not given by their physical placement in memory. Instead, each element points to the…View analysis →
Reduced instruction set computerIn electronics and computer science, a reduced instruction set computer (RISC, pronounced "risk") is a computer architecture designed to simplify the individual instructions…View analysis →
Computational complexity theoryIn theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and explores the…View analysis →
Hash tableIn computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array is an abstract data type…View analysis →
Computer architectureIn computer science and computer engineering, a computer architecture is the conceptual design and operational structure of a computer system that define how component parts are…View analysis →
UsabilityUsability or user-friendliness is the capacity of a system to provide a condition for its users to perform the tasks safely, effectively, and efficiently while enjoying the…View analysis →
Scientific visualizationScientific visualization (also spelled scientific visualisation) is an interdisciplinary branch of science concerned with the visualization of scientific phenomena. It is also…View analysis →
Quantum algorithmIn quantum computing, a quantum algorithm is an algorithm that runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of…View analysis →
Aqua (user interface)Aqua is a graphical user interface, design language and visual theme used in Apple's macOS operating system. It was themed to replicate water, with "droplet-like" components and…View analysis →
Rete algorithmThe Rete algorithm (/ˈriːtiː/ REE-tee, /ˈreɪtiː/ RAY-tee, rarely /ˈriːt/ REET, /rɛˈteɪ/ reh-TAY) is a pattern matching algorithm for implementing rule-based systems. The…View analysis →
Supercomputer architectureApproaches to supercomputer architecture have taken dramatic turns since the earliest systems were introduced in the 1960s. Early supercomputer architectures pioneered by Seymour…View analysis →
Interaction designInteraction design, often abbreviated as IxD, is "the practice of designing interactive digital products, environments, systems, and services." While interaction design has an…View analysis →
Simplex algorithmIn mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming.View analysis →
Software visualizationSoftware visualization or software visualisation refers to the visualization of information of and related to software systems—either the architecture of its source code or…View analysis →
Mesa (computer graphics)Mesa, also called Mesa3D and The Mesa 3D Graphics Library, is an open source implementation of OpenGL, OpenGL ES, Vulkan, and other graphics API specifications, as well as OpenCL…View analysis →
Multiplication algorithmA multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient than others…View analysis →
Search algorithmIn computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data…View analysis →
Parameterized complexityIn computer science, parameterized complexity is a branch of computational complexity theory that focuses on classifying computational problems according to their inherent…View analysis →
Binary treeIn computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary…View analysis →
Intel Core (microarchitecture)The Intel Core microarchitecture (provisionally referred to as Next Generation Micro-architecture, and developed as Merom) is a multi-core processor microarchitecture launched by…View analysis →
Persistent data structureIn computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified. Such data…View analysis →
Voice user interfaceA voice user interface (VUI) enables spoken human interaction with computers, using speech recognition to understand spoken commands and answer questions, and typically text to…View analysis →
Analysis of algorithmsIn computer science, the analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to…View analysis →
Floyd–Warshall algorithmIn computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for…View analysis →
Root-finding algorithmIn numerical analysis, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f is a number x such that…View analysis →
A* search algorithmA* (pronounced "A-star") is a graph traversal and pathfinding algorithm that is used in many fields of computer science due to its completeness, optimality, and optimal…View analysis →
Disjoint-set data structureIn computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint…View analysis →
Enumeration algorithmIn computer science, an enumeration algorithm is an algorithm that enumerates the answers to a computational problem. Formally, such an algorithm applies to problems that take an…View analysis →
Quantum complexity theoryQuantum complexity theory is the subfield of computational complexity theory that deals with complexity classes defined using quantum computers, a computational model based on…View analysis →
Real-time computer graphicsReal-time computer graphics or real-time rendering is the sub-field of computer graphics focused on producing and analyzing images in real time. The term can refer to anything…View analysis →
Quantum Turing machineA quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple model that captures all…View analysis →
Pascal (microarchitecture)Pascal is the codename for a GPU microarchitecture developed by Nvidia, as the successor to the Maxwell architecture. The architecture was first introduced in April 2016 with the…View analysis →
PSPACEIn computational complexity theory, PSPACE is the set of all decision problems that can be solved by a Turing machine using a polynomial amount of space.View analysis →
Kinetic data structureA kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously. For example, a kinetic convex hull data structure…View analysis →
