Abraham Isgur
Solving Non-Homogeneous Nested Recursions Using Trees
Isgur, Abraham; Rahman, Mustazee; Tanny, Stephen
Citation
Isgur, A., Rahman, M., & Tanny, S. (2013). Solving Non-Homogeneous Nested Recursions Using Trees. Annals of Combinatorics, 17(4), https://doi.org/10.1007/s00026-013-0202-9
| Journal Article Type | Article |
|---|---|
| Online Publication Date | Aug 18, 2013 |
| Publication Date | 2013 |
| Deposit Date | Nov 5, 2021 |
| Journal | Annals of Combinatorics |
| Print ISSN | 0218-0006 |
| Electronic ISSN | 0219-3094 |
| Publisher | Springer |
| Volume | 17 |
| Issue | 4 |
| DOI | https://doi.org/10.1007/s00026-013-0202-9 |
| Public URL | https://durham-repository.worktribe.com/output/1222895 |
| Related Public URLs | https://arxiv.org/abs/1105.2351 |
You might also like
Spot-Based Generations for Meta-Fibonacci Sequences
(2011)
Journal Article
On inhomogeneous polynuclear growth
(2022)
Journal Article
Percolation with Small Clusters on Random Graphs
(2015)
Journal Article
Local algorithms for independent sets are half-optimal
(2017)
Journal Article
Random sorting networks: local statistics via random matrix laws
(2018)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search