"Designing Recurrence Sequences: Properties and Algorithms"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Recurrence sequences /	Everest, Graham,; Van Der Poorten, A. J.	[2003], ©2003.	American Mathematical Society,
Division and square root: digit-recurrence algorithms and implementations /	Ercegovac, Miloš D.; Lang, Tomás,	[1994], ©1994.	Kluwer Academic Publishers,
Difference Sets, Sequences and their Correlation Properties	A. Pott; P. Vijay Kumar; Tor Helleseth; Dieter Jungnickel	1999	Springer Netherlands
Techniques for Designing and Analyzing Algorithms	Douglas R. Stinson	2021	Routledge
Average Case Analysis of Algorithms on Sequences	Wojciech Szpankowski	2001	John Wiley & Sons
Mathematical Properties of Sequences and Other Combinatorial Structures	Jong-Seon No; Hong-Yeop Song; Tor Helleseth; P. Vijay Kumar	2003	Springer US
Extremes and Related Properties of Random Sequences and Processes	M. R. Leadbetter; G. Lindgren; H. Rootzen	1983	Springer New York
Asymptotic Properties of Permanental Sequences: Related to Birth and Death Processes and Autoregressive Gaussian Sequences	Michael B. Marcus; Jay Rosen	1st ed. 2021	Springer International Publishing
Learning Decision Sequences For Repetitive Processes—Selected Algorithms	Wojciech Rafajłowicz	1st ed. 2022	Springer International Publishing
Recurrence.	Daníel Bjarnason,; Thurídur Jónsdóttir.; Hlynur A. Vilmarsson.; María Huld Markan Sigfúsdóttir.; Daníel Bjarnason,; Anna S. Þorvaldsdóttir,
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology	Dan Gusfield	1997-05	Cambridge University Press
Designing Evolutionary Algorithms for Dynamic Environments	Ronald W. Morrison	2004	Springer Berlin Heidelberg
Designing efficient algorithms for parallel computers	Michael J. Quinn	1987	McGraw-Hill
Recurrence and Topology	John M. Alongi, Gail S. Nelson	2007	American Mathematical Society
Stream Data Mining: Algorithms and Their Probabilistic Properties	Leszek Rutkowski; Maciej Jaworski; Piotr Duda	1st ed. 2020	Springer International Publishing
Recurrence relations	Open University	1982	Open University Press
Planning Lessons and Courses: Designing Sequences of Work for the Language Classroom	Tessa Woodward	2001-02	Cambridge University Press
Tumor Dormancy and Recurrence	Yuzhuo Wang; Francesco Crea	1st ed. 2017	Springer International Publishing
Nietzsche and Eternal Recurrence	Bevis E. McNeil	1st ed. 2021	Springer International Publishing
Sports Leagues Scheduling: Models, Combinatorial Properties, and Optimization Algorithms	Dirk Briskorn (auth.)	2008	Springer-Verlag Berlin Heidelberg
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Designing Recurrence Sequences: Properties and Algorithms	Evangelos Tzanis	International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004)	Theodore Simos; George Maroulis	2004	Routledge
Polynomials and Recurrence Sequences	Igor Shparlinski	Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness	Igor Shparlinski	2003	Birkhäuser Basel
Sequences and Recurrence Relations		Introduction to the design & analysis of algorithms	Anany Levitin	2012	Pearson
Sequences and Recurrence Relations		Introduction to the design and analysis of algorithms	Levitin, Anany V	2011;2019	Pearson
Sequences and Recurrence Relations		Introduction to the Design and Analysis of Algorithms	Anany Levitin	2011	Addison Wesley (Pearson Education Inc.)
Linear Recurrence Sequences	Wolfgang M. Schmidt	Diophantine Approximation: Lectures given at the C. I. M. E. Summer School held in Cetraro, Italy, June 28 – July 6, 2000	David Masser; Yuri V. Nesterenko; Hans Peter Schlickewei; Wolfgang M. Schmidt; Michel Waldschmidt; Francesco Amoroso; Umberto Zannier	2003	Springer Berlin Heidelberg
C - Recurrence sequences		Exponential Diophantine Equations	T. N. Shorey; R. Tijdeman	1986-11	Cambridge University Press
Pisot Sequences, Boyd Sequences and Linear Recurrence	M. J. Bertin; A. Decomps-Guilloux; M. Grandet-Hugot; M. Pathiaux-Delefosse; J. P. Schreiber	Pisot and Salem Numbers	Marie J. Bertin; Annette Decomps-Guilloux; Marthe Grandet-Hugot; Martine Pathiaux-Delefosse; Jean Schreiber	1992	Birkhäuser Basel
Recurrence ranks and moment sequences	Joshua Cooper; Grant Fickes	Number Theory and Combinatorics: A Collection in Honor of the Mathematics of Ronald Graham	Bruce M. Landman; Florian Luca; Melvyn B. Nathanson; Jaroslav Nešetřil; Aaron Robertson	2022	De Gruyter
2 Sequences and Recurrence Relations		Higher Mathematics	Robert Barclay, Brian Logan, Mike Smith	2019	Hodder Gibson
Generic Linear Recurrence Sequences	Letterio Gatto; Parham Salehyan	Hasse-Schmidt Derivations on Grassmann Algebras: With Applications to Vertex Operators	Letterio Gatto; Parham Salehyan	1st ed. 2016	Springer International Publishing
Appendix F - Recurrence sequences		Distribution Modulo One and Diophantine Approximation	Yann Bugeaud	2012-07	Cambridge University Press
3 - Binary recurrence sequences		Exponential Diophantine Equations	T. N. Shorey; R. Tijdeman	1986-11	Cambridge University Press
39 Nonlinear recurrence sequences		Number theory: Dreaming in dreams: Proc. of the 5th China-Japan seminar	Takshi Aoki, Shigeru Kanemitsu, Jianya Liu	2010	WS
Designing Algorithms	Johannes Brauer	Programming Smalltalk – Object-Orientation from the Beginning: An introduction to the principles of programming	Johannes Brauer	2015	Springer Fachmedien Wiesbaden
Designing algorithms		Practical programming: an introduction to computer science using Python 3. 6	Campbell, Jennifer P. L.; Gries, Paul; Montojo, Jason	2017	The Pragmatic Bookshelf
Designing algorithms		Applied Computational Thinking with Python	Sofía De Jesús, Dayrene Martinez	2020	Packt Publishing
Designing algorithms		How to design programs: an introduction to programming and computing	Matthias Felleisen	2001	MIT Press
Designing Algorithms		How to design Programs. An Introduction to Programming and Computing (online version) [2nd ed. ]	Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi	2014	MIT
Designing Algorithms		How to Design Programs: An Introduction to Programming and Computing	Matthias Felleisen; Robert Bruce Findler; Matthew Flatt; Shriram Krishnamurthi	2001	MIT Press
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Designing Recurrence Sequences: Properties and Algorithms" - similar Books and Chapters