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)

Related topics

Related topics

50 relations
ALGOL 60AP Computer ScienceAdaptive quadratureAlgorithmic efficiency

Broader (1)

Theoretical computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2005
Highly Cited
2005
A Course in Credibility Theory and its Applications
The Bayes Premium.- Credibility Estimators.- The Buhlmann-Straub Model.- Treatment of Large Claims in Credibility.- Hierarchical… 
Highly Cited
2005
Highly Cited
2005
Identification of Hammerstein nonlinear ARMAX systems
Highly Cited
2001
Highly Cited
2001
Recursive position estimation in sensor networks
Recursive hierarchy provides a framework for extending position estimation throughout a sensor network. Given imprecise ranging… 
Highly Cited
1995
Highly Cited
1995
Closed-form Green's functions for general sources and stratified media
The closed-form Green's functions of the vector and scalar potentials in the spatial domain are presented for the sources of… 
Highly Cited
1990
Highly Cited
1990
Recursive and Sequential Tests of the Unit Root and Trend Break Hypothesis: Theory and International Evidence
This paper investigates the possibility, raised by Perron (1989, 1990a), that aggregate economic time series can be characterized… 
Highly Cited
1986
Highly Cited
1986
A Fast Recursive Algorithm For Computing The Discrete Cosine Transform
  • H. Hou
  • Optics & Photonics
  • 1986
  • Corpus ID: 44710299
The Discrete Cosine Transform (DCT) has found wide applications in various fields, including image data compression, because it… 
Highly Cited
1980
Highly Cited
1980
A Recursive Lagrangian Formulation of Maniputator Dynamics and a Comparative Study of Dynamics Formulation Complexity
An efficent Lagangian formulation of manipulator dynamics has been developed. The efficiency derives from recurrence relatons for… 
Highly Cited
1979
Highly Cited
1979
Motion-compensated television coding: Part I
We present methods of estimating displacements of moving objects from one frame to the next in a television scene and using such… 
Highly Cited
1976
Highly Cited
1976
An adaptive recursive LMS filter
An adaptive, recursive, least mean-square-digital filter is heuristically derived that has the computational simplicity of… 
Highly Cited
1964
Highly Cited
1964
Some classes of recursive functions
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)