On a recursive ascent parseurARETZ, F. E. J. K.Information processing letters. 1988, Vol 29, Num 4, pp 201-206, issn 0020-0190Article

Extension of synthesis algorithm of recursive processes to μ-calculusKIMURA, S; TOGASHI, A; SHIRATORI, N et al.Information processing letters. 1996, Vol 58, Num 2, pp 97-104, issn 0020-0190Article

Momentum modification of the RLS algorithmsBILSKI, Jaroslaw.Lecture notes in computer science. 2004, pp 151-157, issn 0302-9743, isbn 3-540-22123-9, 7 p.Conference Paper

Parallelism for multipeg Towers of HanoiLU, X.-M; DILLON, T. S.Mathematical and computer modelling. 1995, Vol 21, Num 3, pp 3-17, issn 0895-7177Article

A recursive modified Gram-Schmidt algorithm based adaptive beamformerJAGADEESHA, S. N; SINHA, S. N; MEHRA, D. K et al.Signal processing. 1994, Vol 39, Num 1-2, pp 69-78, issn 0165-1684Article

Tracking characteristics of an OBE parameter-estimation algorithmRAO, A. K; YIH-FANG HUANG.IEEE transactions on signal processing. 1993, Vol 41, Num 3, pp 1140-1148, issn 1053-587XArticle

Learnability of enumerable classes of recursive functions from typical examplesNESSEL, J.Lecture notes in computer science. 1999, pp 264-275, issn 0302-9743, isbn 3-540-66748-2Conference Paper

A recursive algorithm for the generation of space-filling curvesBREINHOLT, G; SCHIERZ, C.Eusipco : European signal processing conference. 1998, pp 487-490, isbn 960-7620-05-4, 4VolConference Paper

Inversion of a recursive tree traversalVAN DE SNEPSCHEUT, J. L. A.Information processing letters. 1991, Vol 39, Num 5, pp 265-267, issn 0020-0190Article

A refined class of cost functions in blind equalizationSHTROM, V; FAN, H.International conference on acoustics, speech, and signal processing. 1997, pp 2273-2286, isbn 0-8186-7919-0Conference Paper

Minimum-maximal matching in series-parallel graphsRICHEY, M. B; PARKER, R. G.European journal of operational research. 1988, Vol 33, Num 1, pp 98-105, issn 0377-2217Article

Recursive computation of inner bounds for the parameters of linear modelsNORTON, J. P.International Journal of Control. 1989, Vol 50, Num 6, pp 2423-2430, issn 0020-7179, 8 p.Article

Completion times in multipurpose batch plants with set-up, transfer and clean-up timesGRAU, R; ESPUNA, A; PUIGJANER, L et al.Computers & chemical engineering. 1996, Vol 20, pp S1143-S1148, issn 0098-1354, SUPBConference Paper

A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problemsPALACIOS-VELEZ, O; CUEVAS RENAUD, B.ACM transactions on mathematical software. 1990, Vol 16, Num 3, pp 275-292, issn 0098-3500, 18 p.Article

Rank-2 intersection and polymorphic recursionDAMIANI, Ferruccio.Lecture notes in computer science. 2005, pp 146-161, issn 0302-9743, isbn 3-540-25593-1, 16 p.Conference Paper

Finding recursions for multidimensional arraysPRETZEL, Oliver.Information and computation (Print). 2002, Vol 173, Num 1, pp 1-14, issn 0890-5401Article

Mixed time scale recursive algorithmsBUCKLEW, James A; KURTZ, Thomas G.IEEE transactions on signal processing. 2001, Vol 49, Num 8, pp 1824-1830, issn 1053-587XArticle

Recursive bounds for perfect hashingFACHINI, Emanuela; NILLI, Alon.Discrete applied mathematics. 2001, Vol 111, Num 3, pp 307-311, issn 0166-218XArticle

The Fedorov algorithm revisedVOYTEKHOVSKY, Yury L.Acta crystallographica. Section A, Foundations of crystallography. 2001, Vol 57, Num 4, pp 475-477, issn 0108-7673Article

Equivalence of recursive specifications in process algebraPONSE, Alban; USENKO, Yaroslav S.Information processing letters. 2001, Vol 80, Num 1, pp 59-65, issn 0020-0190Article

Computable partial solids and voxels setsLIEUTIER, A.Lecture notes in computer science. 1999, pp 349-360, issn 0302-9743, isbn 3-540-65685-5Conference Paper

Experience with a recursive perturbation based algorithm for symmetric indefinite linear systemsGUPTA, A; GUSTAVSON, F; KARAIVANOV, A et al.Lecture notes in computer science. 1999, pp 1096-1103, issn 0302-9743, isbn 3-540-66443-2Conference Paper

On the generation of binary trees from (0-1) codesAHRABIAN, H; NOWZARI-DALINI, A.International journal of computer mathematics. 1998, Vol 69, Num 3-4, pp 243-251, issn 0020-7160Article

Termination analysis by inductive evaluationBRAUBURGER, J; GIESL, J.Lecture notes in computer science. 1998, pp 254-269, issn 0302-9743, isbn 3-540-64675-2Conference Paper

Efficient induction of executable logic programs from examplesINUZUKA, N; SEKI, H; ITOH, H et al.Lecture notes in computer science. 1997, pp 212-224, issn 0302-9743, isbn 3-540-63875-XConference Paper