Search results

{{Short description|Type of parser for ambiguous grammars}} ...rithm is the [[Cocke-Younger-Kasami algorithm|Cocke-Younger-Kasami]] (CYK) algorithm. ...

{{short description|Formal language}} ...ensitive language|context-sensitive]] and [[recursive language|recursive]] languages are recursively enumerable. ...

{{Short description|Mutual exclusion algorithm}} '''Dekker's algorithm''' is the first known correct solution to the [[mutual exclusion]] problem ...

{{short description|Randomized polynomial time class of computational complexity theory}} !colspan="3"|RP algorithm (1 run) ...

{{Short description|Algorithm for indexing of words by their pronunciation}} ...s, such as the word's origin and usage over time and borrowings from other languages, phonetic algorithms necessarily take into account numerous rules and excep ...

{{Short description|Phonetic algorithm for indexing words}} ...o. 12 (December), 1990.</ref> It fundamentally improves on the [[Soundex]] algorithm by using information about variations and inconsistencies in English spelli ...

{{short description|Repetition of a process}} ...ng with the related technique of [[recursion]]) is a standard element of [[algorithm]]s. ...

{{Short description|Theorem in computability theory}} ...ormed automatically. One can distinguish between the [[syntax (programming languages)|syntax]] of a program, and its [[semantics (computer science)|semantics]]. ...

{{Short description|Problem in formal language theory}} ...ically, is a nesting depth of one always sufficient? If not, is there an [[algorithm]] to determine how many are required? The problem was first introduced by E ...

{{Short description|Computer system for solving algebra problems}} ...mental integer and polynomial operations, such as the [[Schönhage–Strassen algorithm]] for fast multiplication of integers and polynomials. [[Integer factorizat ...

{{Short description|Concept in computer science}} ...ght occasionally be much longer. Such an algorithm is called a [[Las Vegas algorithm]]. ...

{{Short description|Description of an algorithm that resembles a computer program}} ...icient and environment-independent description of the key principles of an algorithm. It is commonly used in textbooks and [[scientific publications]] to docume ...

{{Short description|Parsing algorithm for context-free grammars}} {{Infobox algorithm ...

{{Short description|None}} ...ancient Egyptians, whose [[Ancient Egyptian multiplication|multiplication algorithm]] used division by two as one of its fundamental steps.<ref>{{citation |tit ...

{{Short description|Formal language generated by context-free grammar}} Context-free languages have many applications in [[programming languages]], in particular, most arithmetic expressions are generated by context-free ...

{{Short description|Property of some cryptographic algorithms}} '''Malleability''' is a property of some [[cryptography|cryptographic]] [[algorithm]]s.<ref>{{cite journal ...

{{short description|Searching algorithm}} ...(the key value by which the book's entries are ordered): in each step the algorithm calculates where in the remaining [[Mathematical optimization#Optimization ...

{{Short description|Printing component that produces a raster image}} ...n than the output device, which the RIP resizes using an [[image scaling]] algorithm. ...

{{Short description|Algorithm for parsing context-free languages}} {{Infobox algorithm ...

{{Short description|Algorithm that combines multiple sorted lists into one}} ...d order. These algorithms are used as [[subroutine]]s in various [[sorting algorithm]]s, most famously [[merge sort]]. ...