Skip to search formSkip to main contentSkip to account menu

Recursion (computer science)

Known as: Recursive algorithm, Recursion(computer science), Recursive calls 
Recursion in computer science is a method where the solution to a problem depends on solutions to smaller instances of the same problem (as opposed… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
The paper presents a new memory-efficient distributed arithmetic (DA) architecture for high-order FIR filters. The proposed… 
Highly Cited
1997
Highly Cited
1997
Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived… 
Review
1997
Review
1997
Advanced Database System by Carlo Zaniolo, Stefano Ceri, Christos Faloutsos, Richard T. Snodgrass, V.S. Subrahmanian, and Roberto… 
Highly Cited
1997
Highly Cited
1997
We discuss the implementation of theoretical tests to assess the structural properties of simple or combined linear congruential… 
Highly Cited
1995
Highly Cited
1995
We propose a model for optimally directed conceptual design of machines in which the transformation of function to form occurs… 
Highly Cited
1993
Highly Cited
1993
The tupling transformation strategy can be used to merge loops together by combining recursive calls and also to eliminate… 
Highly Cited
1989
Highly Cited
1989
A hierarchical recursive algorithm is presented to estimate the rotor speed and parameters of the induction machine on the basis… 
Highly Cited
1987
Highly Cited
1987
A self-starting multistage, time-domain procedure is presented for the identification of nonlinear, multi-degree-of-freedom… 
Highly Cited
1981
Highly Cited
1981
A Boolean algebra is recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and…