Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("BERTONI A")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 43

  • Page / 2
Export

Selection :

  • and

GRAMMATICHE CONTEXT-FREE SU SPAZI METRICI COMPATTI. = GRAMMAIRES INDEPENDANTES DU CONTEXTE SUR DES ESPACES METRIQUES COMPACTSBERTONI A.1974; CALCOLO; ITAL.; DA. 1974; VOL. 11; NO 1; PP. 155-170; ABS. ANGL.; BIBL. 5 REF.Article

Analysis of the efficiency of a third order cascaded Raman laser operating at the wavelength of 1.24 μmBERTONI, A.Optical and quantum electronics. 1997, Vol 29, Num 11-12, pp 1047-1058, issn 0306-8919Article

ON EFFICIENT COMPUTATION OF THE COEFFICIENTS OF SOME POLYNOMIALS WITH APPLICATIONS TO SOME ENUMERATION PROBLEMSBERTONI A; MAURI G.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 3; PP. 142-145; BIBL. 11 REF.Article

TOWARDS A THEORY OF ABSTRACT DATA TYPES: A DISCUSSION ON PROBLEMS AND TOOLSBERTONI A; MAURI G; MIGLIOLI P et al.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 44-58; BIBL. 16 REF.Conference Paper

THREE EFFICIENT ALGORITHMS FOR COUNTING PROBLEMSBERTONI A; MAURI G; TORELLI M et al.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 1; PP. 50-53; BIBL. 9 REF.Article

ON THE ANALYTICAL IDENTIFICATION OF THE OPTIMAL LOAN AND DEPOSIT INTEREST RATES OF A COMMERCIAL BANK.BERTONI A; MAZZOLENI P; SZEGO GP et al.1975; METROECONOMICA; ITAL.; DA. 1975; VOL. 27; NO 1; PP. 44-67; BIBL. 9 REF.Article

EQUIVALENCE AND MEMBERSHIP PROBLEMS FOR REGULAR TRACE LANGUAGESBERTONI A; MAURI G; SABADINI N et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 140; PP. 61-71; BIBL. 11 REF.Conference Paper

A HIERARCHY OF REGULAR TRACE LANGUAGES AND SOME COMBINATORIAL APPLICATIONSBERTONI A; MAURI G; SABADINI N et al.1982; WORLD CONFERENCE ON MATHEMATICS AT THE SERVICE OF MAN. 2/1982-06-28/LAS PALMAS; ESP; DA. 1982; PP. 146-153; BIBL. 10 REF.Conference Paper

ANALYSIS AND COMPACTING OF MUSICAL TEXTSBERTONI A; HAUS G; MAURI G et al.1978; J. CYBERN.; USA; DA. 1978; VOL. 8; NO 3-4; PP. 257-272; BIBL. 6 REF.Article

On ranking 1-way finitely ambiguous NL languages and #P1-complete census functionsBERTONI, A; GOLDWURM, M.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 2, pp 135-148, issn 0988-3754Article

Implicit parallelism in genetic algorithmsBERTONI, A; DORIGO, M.Artificial intelligence. 1993, Vol 61, Num 2, pp 307-314, issn 0004-3702Article

Les publications périodiques des sociétés historiques et archéologiques en Ile-de-FranceBERTONI, A; WALTISPERGER, C.Paris et l'Ile-de-France, Mémoires Paris. 1980, Vol 31, pp 37-46Article

On the inclusion problem for finitely ambiguous rational trace languagesBERTONI, A; MASSAZZA, P.Informatique théorique et applications (Imprimé). 1998, Vol 32, Num 1-3, pp 79-98, issn 0988-3754Article

On 2PFA's and the Hadamard quotient of formal power seriesANSELMO, M; BERTONI, A.Bulletin of the Belgian Mathematical Society. Simon Stevin. 1994, Vol 1, Num 2, pp 165-173, issn 1370-1444Conference Paper

Ranking and formal power seriesBERTONI, A; BRUSCHI, D; GOLDWURM, M et al.Theoretical computer science. 1991, Vol 79, Num 1, pp 25-35, issn 0304-3975, 11 p.Article

The complexity of computing the number of strings of given length in context-free languagesBERTONI, A; GOLDWURM, M; SABADINI, N et al.Theoretical computer science. 1991, Vol 86, Num 2, pp 325-342, issn 0304-3975Article

A boosting algorithm for regressionBERTONI, A; CAMPADELLI, P; PARODI, M et al.Lecture notes in computer science. 1997, pp 343-348, issn 0302-9743, isbn 3-540-63631-5Conference Paper

Membership problems for regular and context-free trace languagesBERTONI, A; MAURI, G; SABADINI, N et al.Information and computation (Print). 1989, Vol 82, Num 2, pp 135-150, issn 0890-5401Article

An optimal lower bound for nonregular languagesBERTONI, A; MEREGHETTI, C; PIGHIZZINI, G et al.Information processing letters. 1994, Vol 50, Num 6, pp 289-292, issn 0020-0190Article

Non deterministic machines and their generalizationsBERTONI, A; MAURI, G; SABADINI, N et al.Lecture notes in physics. 1983, Num 196, pp 86-97, issn 0075-8450Article

Electron interference and entanglement in coupled 1D systems with noiseBUSCEMI, F; BORDONE, P; BERTONI, A et al.The European physical journal. D, Atomic, molecular and optical physics (Print). 2012, Vol 66, Num 12, issn 1434-6060, 66312.1-66312.11Article

Counting problems and algebraic formal power series in noncommuting variablesBERTONI, A; GOLDWURM, M; MASSAZZA, P et al.Information processing letters. 1990, Vol 34, Num 3, pp 117-121, issn 0020-0190Article

On the class NL with oracleBERTONI, A; MAURI, G; SABADINI, N et al.Computers and artificial intelligence. 1987, Vol 6, Num 5, pp 411-420, issn 0232-0274Article

Efficient use of the local discontinuous galerkin method for meshes sliding on a circular boundaryALOTTO, P; BERTONI, A; PERUGIA, I et al.IEEE transactions on magnetics. 2002, Vol 38, Num 2, pp 405-408, issn 0018-9464, 1Conference Paper

A neural algorithm for the Maximum clique problem: Analysis, experiments, and circuit implementationBERTONI, A; CAMPADELLI, P; GROSSI, G et al.Algorithmica. 2002, Vol 33, Num 1, pp 71-88, issn 0178-4617Article

  • Page / 2