Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
recursion depth
Description:
Recursion depth is the number of nested recursive calls or levels reached during an algorithmic or mathematical process.
Related topics:
Complex Systems and Dynamics (10%),
Advanced Mathematical Theories and Applications (8%)
OpenAlex ID:
keywords/recursion-depth
PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions
2016
·
Jun Zhang
, Xiaokui Xiao
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
222
Fractal curves and complexity
1987
·
James E. Cutting
, Jeffrey J. Garvin
·
Perception & Psychophysics
·
166
PDF
A limiting distribution for quicksort
1989
·
Mireille Régnier
·
RAIRO - Theoretical Informatics and Applications
·
113
PDF
Undecidable boundedness problems for datalog programs
1995
·
Gerd G Hillebrand
, Paris C Kanellakis
, et al.
·
The Journal of Logic Programming
·
75
PDF
A Rate-Distortion view of human pragmatic reasoning
2020
·
Zaslavsky, Noga
, Hu, Jennifer
, et al.
·
arXiv (Cornell University)
·
65
PDF
The Ackermann function. a theoretical, computational, and formula manipulative study
1971
·
Yngve Sundblad
·
BIT Numerical Mathematics
·
43
Learning the Dyck Language with Attention-based Seq2Seq Models
2019
·
Xiang Yu
, Ngoc Thang Vu
, et al.
·
BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP (BlackboxNLP)
·
37
PDF
Recursive Ant Colony Optimization for estimation of parameters of a function
2012
·
Deepak K. Gupta
, Yogesh Arora
, et al.
·
International Conference on Recent Advances in Information Technology
·
34
Space-time tradeoffs for linear recursion
1979
·
Sowmitri Swamy
, John E. Savage
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
30
PDF
Algorithm 426: Merge sort algorithm [M1]
1972
·
C. Bron
·
Communications of the ACM
·
24
PDF
A new order-theoretic characterisation of the polytime computable functions
2015
·
Martin Avanzini
, Naohi Eguchi
, et al.
·
Theoretical Computer Science
·
21
PDF
An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority,
2013
·
Nikos Leonardos
·
Lecture notes in computer science
·
19
Recursion flattening
2008
·
Greg Stitt
, Jason Villarreal
·
ACM Great Lakes Symposium on VLSI (GLSVLSI)
·
19
An anisotropic directional subdivision and multiresolution scheme
2014
·
Mariantonia Cotronei
, Daniele Ghisi
, et al.
·
Advances in Computational Mathematics
·
16
Insights in the light trapping effect in silicon solar cells with backside diffraction gratings
2013
·
Markus Wellenzohn
, Rainer Hainberger
·
Journal of Photonics for Energy
·
14
PDF
Recursive optimal estimation in Szarkowski rotation scheme
2010
·
Jacek Wesołowski
·
Statistics in Transition New Series
·
13
PDF
New recursive minor expansion algorithms, a presentation in a comparative context
1979
·
J. Smit
·
Lecture notes in computer science
·
13
Twelve Simple Algorithms to Compute Fibonacci Numbers
2018
·
Dasdan, Ali
·
arXiv (Cornell University)
·
12
PDF
Exact output rate of Peresʼs algorithm for random number generation
2013
·
Sung-il Pae
·
Information Processing Letters
·
12
Transformations of logic programs
1984
·
Olga Štěpánková
, Petr Štěpánek
·
The Journal of Logic Programming
·
12
Space-time tradeoffs for linear recursion
1983
·
Sowmitri Swamy
, John E. Savage
·
Theory of Computing Systems
·
11
A New Order-Theoretic Characterisation of the Polytime Computable Functions
2012
·
Martin Avanzini
, Naohi Eguchi
, et al.
·
Lecture notes in computer science
·
10
Improving the Precision of WCET Analysis by Input Constraints and Model-Derived Flow Constraints
2011
·
Reinhard Wilhelm
, Philipp Lucas
, et al.
·
Springer eBooks
·
10
Automata, Languages and Programming
1984
·
Jan Paredaens
·
Lecture notes in computer science
·
10
Derivation of the Fibonacci Recurrence as the Unique Stable Depth-2 Linear Recursion: Ostrogradsky Stability, Gram–Schmidt Orthogonality, and Kolmogorov Minimality
2026
·
Davis, Abby
·
Zenodo (CERN European Organization for Nuclear Research)
·
9
Show more works
View as search
Works count:
220
Citation count:
1,143
Year
Topic
Type