Manuel Kauers
- Michael Boshernitzan. Orders of infinity generated by difference equations. In American Journal of Mathematics, 106:1067--1089, 1984.Google Scholar
Cross Ref
- Michael Boshernitzan. Discrete Orders of Infinity. In American Journal of Mathematics, 106:1147--1198, 1984.Google ScholarCross Ref
- Keith O. Geddes, Gaston H. Gonnet. A New Algorithm for Computing Symbolic Limits Using Generalized Hierarchical Series. In Proceedings of ISSAC'88, 1988 Google ScholarDigital Library
- Ronald L. Graham, Donald E. Knuth, Oren Patashnik. Concrete Mathematics. Addison-Wesley, second edition, 1994.Google Scholar
- Dominik Gruntz. On Computing Limits in a Symbolic Manipulation System. ETH Diss 11432, 1996.Google Scholar
- Maxwell Rosenlicht. Hardy fields. In Journal of Mathematical Analysis and Applications, 93:286--311, 1983.Google ScholarCross Ref
- Michael Karr. Summation in Finite Terms. In Journal of the ACM, 28:305--350, 1981 Google ScholarDigital Library
- Konrad Knopp. Theorie und Anwendung der unendlichen Reihen. Springer, fifth edition, 1964.Google Scholar
- George Pó1ya, Gabor Szegõ. Problems and Theorems in Analysis I. Springer, 1978.Google Scholar
- Bruno Salvy, John Shackell. Symbolic Asymptotics: Functions of Two Variables, Implicit Functions. In Journal of Symbolic Computation, 25:329--349, 1998. Google ScholarDigital Library
- Carsten Schneider. Symbolic Summation in Difference Fields. PhD Thesis RISC, 2001.Google Scholar
- John Shackell. Growth Estimate of exp-log Functions. In Journal of Symbolic Computation, 10:611--632, 1990. Google ScholarDigital Library
- John Shackell, Bruno Salvy. Symbolic Asymptotics: Multiseries of Inverse Functions. In Journal of Symbolic Computation, 27:543--563, 1999. Google ScholarDigital Library
Recommendations
The relation between preset distinguishing sequences and synchronizing sequences
AbstractWe study the relation between synchronizing sequences and preset distinguishing sequences which are some special sequences used in finite state machine based testing. We show that the problems related to preset distinguishing sequences can be ...
Limits of dense graph sequences
We show that if a sequence of dense graphs G"n has the property that for every fixed graph F, the density of copies of F in G"n tends to a limit, then there is a natural ''limit object,'' namely a symmetric measurable function W:[0,1]^2->[0,1]. This ...
Energy efficient stochastic computing with Sobol sequences
DATE '17: Proceedings of the Conference on Design, Automation & Test in EuropeEnergy efficiency presents a significant challenge for stochastic computing (SC) due to the long random binary bit streams required for accurate computation. In this paper, a type of low discrepancy (LD) sequences, the Sobol sequence, is considered for ...
Comments