On a question of Leiss regarding the Hanoi Tower problemAZRIEL, D; BEREND, D.Theoretical computer science. 2006, Vol 369, Num 1-3, pp 377-383, issn 0304-3975, 7 p.Article

Encore des résultats d'itérations discrètes = Further results for discrete iterationsROBERT, F.Rapport de recherche - IMAG. 1985, Num 556, issn 0750-7380, 25 p.Report

Bifurcations structure of one parameter families of piecewise increasing functions with a single discontinuity = Structure de bifurcations des familles à un paramètre de fonctions croissantes par morceaux avec une seule discontinuitéMASSE, C; COSNARD, M; ACQUIER, M. H et al.Rapport de recherche - IMAG. 1985, Num 538, issn 0750-7380, 17 p.Report

Algorithm transformations for the data broadcast elimination methodGUSEV, M; EVANS, D. J.International journal of computer mathematics. 2000, Vol 73, Num 4, pp 433-461, issn 0020-7160Article

On the estimation of the set of stable solutions for the recurrent equationsGAJEWSKI, K; RADZISZEWSKI, B.Bulletin of the Polish Academy of Sciences. Technical sciences. 1989, Vol 37, Num 3-4, pp 135-140, issn 0239-7528, 6 p.Article

Computability of recurrence equationsSAOUTER, Y; QUINTON, P.Theoretical computer science. 1993, Vol 116, Num 2, pp 317-337, issn 0304-3975Article

Méthode récurrente de prédiction optimale d'un processus aléatoire gaussien. Mesures en temps discretNAZARENKO, A. I.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 2, pp 200-202, issn 0002-3388Article

Convergence locale d'itérations série ou parallèle = Local convergence of serial or parallel iterationsROBERT, F.Rapport de recherche - IMAG. 1985, Num 536, issn 0750-7380, 33 p.Report

All solutions of a system of recursion equations in infinite trees and other contraction theoriesBLOOM, S. L.Journal of computer and system sciences (Print). 1983, Vol 27, Num 2, pp 225-255, issn 0022-0000Article

Test algorithmique de l'attraction d'un point fixe dans une itération discrète = Algorithmic test for a fixed-point attraction in a discrete iterationPELLEGRIN, Didier.Rapport de recherche - IMAG. 1985, Num 549, issn 0750-7380, 39 p.Report

Revisiting the decomposition of Karp, Miller and WinogradDARTE, A; VIVIEN, F.Parallel processing letters. 1995, Vol 5, Num 4, pp 551-562, issn 0129-6264Article

Localized algorithms for VLSI processor arraysEVANS, D. J; GUSEV, M.International journal of computer mathematics. 2000, Vol 75, Num 2, pp 149-166, issn 0020-7160Article

Computability of affine non-conditional recurrent systemsSAOUTER, Y; LE VERGE, H.Information processing letters. 1999, Vol 69, Num 6, pp 291-295, issn 0020-0190Article

Undecidability of restricted uniform recurrence equationsWANKE, E.Acta informatica. 1996, Vol 33, Num 5, pp 463-475, issn 0001-5903Article

Pages from the computer files of R. William GosperISMAIL, M. E. H; TAKEUCHI, Y; ZHANG, R et al.Proceedings of the American Mathematical Society. 1993, Vol 119, Num 3, pp 747-760, issn 0002-9939Article

A purely verification proof of the first Rogers-Ramanujan identityEKHAD, S. B; TRE, S.Journal of combinatorial theory. Series A. 1990, Vol 54, Num 2, pp 309-311, issn 0097-3165Article

Synthesizing systolic arrays with control signals from recurrence equationsRAJOPADHYE, S. V.Distributed computing. 1989, Vol 3, Num 2, pp 88-105, issn 0178-2770Article

Bifurcation structure of a discrete neuronal equation = Structure de bifurcations d'une équation neuronale discrèteCOSNARD, Michel; COLES, Eric.Rapport de recherche - IMAG. 1985, Num 543, issn 0750-7380, 36 p.Report

Stirling number asymptotics from recursion equations using the ray methodKNESSL, C; KELLER, J. B.Studies in applied mathematics (Cambridge). 1991, Vol 84, Num 1, pp 43-56, issn 0022-2526, 14 p.Article

Orthogonal polynomials, associated polynomials and functions of the second kindVAN ASSCHE, W.Journal of computational and applied mathematics. 1991, Vol 37, Num 1-3, pp 237-249, issn 0377-0427Article

On the equivalence of two systems of Affine Recurrence EquationsBARTHOU, Denis; FEAUTRIER, Paul; REDON, Xavier et al.Lecture notes in computer science. 2002, pp 309-313, issn 0302-9743, isbn 3-540-44049-6, 5 p.Conference Paper

Synthesis of a new systolic architecture for the algebraic path problemBENAINI, Abdelhamid; QUINTON, Patrice; ROBERT, Yves et al.Rapports de recherche - INRIA. 1989, Vol 1094, issn 0249-6399, 32 p.Report

Infeld-Hull factorization and the simplified solution of the Dirac-Coulomb equationWONG, M. K. F.Physical review. A, General physics. 1986, Vol 34, Num 2, pp 1559-1560, issn 0556-2791Article

The design of optimal systolic arraysGUO-JIE LI; WAH, B. W.IEEE transactions on computers. 1985, Vol 34, Num 1, pp 66-77, issn 0018-9340Article

Exponential transient length generated by a neuronal recurrence equationNDOUNDAM, René; TCHUENTE, Maurice.Theoretical computer science. 2003, Vol 306, Num 1-3, pp 513-533, issn 0304-3975, 21 p.Article