Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
linear recursion
Description:
A computational recursion in which each recursive step makes at most one recursive call, studied in algorithms and programming-language theory.
Related topics:
Advanced Database Systems and Queries (15%),
Logic, programming, and type systems (14%),
Advanced Combinatorial Mathematics (8%)
OpenAlex ID:
keywords/linear-recursion
Maintaining views incrementally
1993
·
Ashish Gupta
, Inderpal Singh Mumick
, et al.
·
ACM SIGMOD Record
·
245
PDF
Query optimization by simulated annealing
1987
·
Yannis E. Ioannidis
, Eugene Wong
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
193
PDF
Friezes
2010
·
Ibrahim Assem
, Christophe Reutenauer
, et al.
·
Advances in Mathematics
·
109
PDF
Limits of chromatic zeros of some families of maps
1980
·
S Beraha
, J Kahane
, et al.
·
Journal of Combinatorial Theory Series B
·
106
The Polynomial Method for Random Matrices
2007
·
N. Raj Rao
, Alan Edelman
·
Foundations of Computational Mathematics
·
97
PDF
A study of transitive closure as a recursion mechanism
1987
·
H. V. Jagadish
, Rakesh Agrawal
, et al.
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
96
A Temporal Relational Algebra as Basis for Temporal Relational Completeness
1990
·
Alexander Tuzhilin
, James Clifford
·
Faculty Digital Archive (New York University Florence)
·
88
Risk-sensitive filtering and smoothing via reference probability methods
1997
·
S. Dey
, J.B. Moore
·
IEEE Transactions on Automatic Control
·
82
A decidable class of bounded recursions
1987
·
J. F. Naughton
, Y. Sagiv
·
ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS)
·
75
Recursive XML schemas, recursive XML queries, and relational storage: XML-to-SQL query translation
2004
·
R. Krishnamurthy
, V.T. Chakaravarthy
, et al.
·
IEEE International Conference on Data Engineering (ICDE)
·
73
Growth functions on Fuchsian groups and the Euler characteristic
1987
·
William J. Floyd
, Steven P. Plotnick
·
Inventiones mathematicae
·
67
Gonc̆arov polynomials and parking functions
2003
·
Joseph P.S. Kung
, Catherine Yan
·
Journal of Combinatorial Theory Series A
·
64
PDF
A powerful strategy for deriving efficient programs by transformation
1984
·
Alberto Pettorossi
·
ACM Conference on LISP and Functional Programming (LFP)
·
63
PDF
Characterizations of flowchartable recursions
1973
·
S.A. Walker
, H.R. Strong
·
Journal of Computer and System Sciences
·
63
Risk-sensitive filtering and smoothing for hidden Markov models
1995
·
Subhrakanti Dey
, John B. Moore
·
Systems & Control Letters
·
58
Efficient compilation of linear recursive programs
1973
·
Ashok K. Chandra
·
Annual Symposium on Switching & Automata Theory
·
58
Y-systems,Q-systems, and 4D $\mathcal {N}=2$ supersymmetric QFT
2014
·
Sergio Cecotti
, Michele Del Zotto
·
Journal of Physics A Mathematical and Theoretical
·
57
PDF
Some Periodic and Non-Periodic Recursions
2001
·
M. Csörnyei
, M. Laczkovich
·
Monatshefte für Mathematik
·
50
Counting solutions to the View Maintenance Problem.
1992
·
Ashish Gupta
, Dinesh Katiyar
, et al.
·
49
Argument reduction by factoring
1995
·
J.F. Naughton
, R. Ramakrishnana
, et al.
·
Theoretical Computer Science
·
46
Subtree-elimination algorithms in deductive databases
1991
·
Yatin Saraiya
·
40
Towards an algebraic theory of recursion
1991
·
Yannis E. Ioannidis
, Eugene Wong
·
Journal of the ACM
·
39
Query optimization by simulated annealing
1987
·
Yannis E. Ioannidis
, Eugene Wong
·
ACM SIGMOD Record
·
37
Characterizations of dominant and dominated solutions of linear recursions
1980
·
R. M. M. Mattheij
·
Numerische Mathematik
·
37
Compiling general linear recursions by variable connection graph analysis
1989
·
Jiawei Han
·
Computational Intelligence
·
36
Show more works
View as search
Works count:
321
Citation count:
3,498
Year
Topic
Type