Pages that link to "Item:Q1384098"
From MaRDI portal
The following pages link to On the solution of linear recurrence equations (Q1384098):
Displaying 32 items.
- Continuous amortization and extensions: with applications to bisection-based root isolation (Q277222) (← links)
- A new dichotomic algorithm for the uniform random generation of words in regular languages (Q391418) (← links)
- Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated (Q401474) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- On a linear runs and tumbles equation (Q503013) (← links)
- An exactly solvable self-convolutive recurrence (Q623429) (← links)
- Synthesis with asymptotic resource bounds (Q832230) (← links)
- On solutions of some nonlinear recurrences (Q1088984) (← links)
- Improved quick hypervolume algorithm (Q1652507) (← links)
- A new asymptotic notation: Weak Theta (Q1666904) (← links)
- A frame for general divide-and-conquer recurrences (Q1847368) (← links)
- Efficient \(k\)-anonymous microaggregation of multivariate numerical data via principal component analysis (Q2224935) (← links)
- Proving divide and conquer complexities in Isabelle/HOL (Q2362108) (← links)
- A solution to the recurrence relative formula of the linear circular digital series (Q2703804) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles (Q2862553) (← links)
- Asymptotics of divide-and-conquer recurrences via iterated function systems (Q2920844) (← links)
- A note on the system of linear recurrence equations (Q2975653) (← links)
- A Real Elementary Approach to the Master Recurrence and Generalizations (Q3010381) (← links)
- (Q3158129) (← links)
- (Q3655906) (← links)
- (Q3749347) (← links)
- (Q3990995) (← links)
- (Q4021501) (← links)
- (Q4267200) (← links)
- (Q4324839) (← links)
- (Q4455248) (← links)
- Verification of Closest Pair of Points Algorithms (Q5049012) (← links)
- (Q5091049) (← links)
- Connecting slow solutions to nested recurrences with linear recurrent sequences (Q5870247) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- More solutions to nonlinear recurrence equations (Q6115581) (← links)