11573/1711013 - 2024 -
DEPTH LOWER BOUNDS IN STABBING PLANES FOR COMBINATORIAL PRINCIPLES∗ Dantchev, S.; Galesi, N.; Ghani, A.; Martin, B. - 01a Articolo in rivista
paper: LOGICAL METHODS IN COMPUTER SCIENCE (Braunschweig : Logical Methods in Computer Science c/o Institut f. Theoretische Informatik, Technische Universität Braunschweig.) pp. - - issn: 1860-5974 - wos: WOS:001147709200001 (0) - scopus: 2-s2.0-85186412811 (0)
11573/1701929 - 2024 -
Vertex-connectivity for node failure identification in Boolean Network Tomography Galesi, N.; Ranjbar, F.; Zito, M. - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. - - issn: 0020-0190 - wos: WOS:001108296300001 (0) - scopus: 2-s2.0-85174202301 (0)
11573/1701927 - 2023 -
On vanishing sums of roots of unity in polynomial calculus and sum-of-squares Bonacina, Ilario; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: COMPUTATIONAL COMPLEXITY (Birkhaeuser Verlag AG:Viaduktstrasse 42-44, CH 4051 Basel Switzerland:011 41 61 2050707, EMAIL: subscriptions@birkhauser.ch, INTERNET: http://www.birkhauser.ch, Fax: 011 41 61 2050792) pp. 1-45 - issn: 1016-3328 - wos: WOS:001100965700001 (0) - scopus: 2-s2.0-85176394156 (0)
11573/1701953 - 2023 -
On the Algebraic Proof Complexity of Tensor Isomorphism Galesi, N.; Grochow, J. A.; Pitassi, T.; She, A. - 04b Atto di convegno in volume
conference: 38th Computational Complexity Conference, CCC 2023 (gbr)
book: Leibniz International Proceedings in Informatics, LIPIcs - ()
11573/1654274 - 2023 -
Bounded-depth Frege complexity of Tseitin formulas for all graphs Galesi, N.; Itsykson, D.; Riazanov, A.; Sofronova, A. - 01a Articolo in rivista
paper: ANNALS OF PURE AND APPLIED LOGIC (-Amsterdam Netherlands: Elsevier BV
-Amsterdam : North-Holland) pp. - - issn: 0168-0072 - wos: WOS:000834535700001 (0) - scopus: 2-s2.0-85135795348 (0)
11573/1654517 - 2022 -
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares Bonacina, I.; Galesi, N.; Lauria, M. - 04b Atto di convegno in volume
conference: International Symposium on Mathematical Foundations of Computer Science (Vienna; Austria)
book: 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) - (978-3-95977-256-3)
11573/1634804 - 2022 -
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles Dantchev, S.; Galesi, N.; Ghani, A.; Martin, B. - 04b Atto di convegno in volume
conference: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022 (Marsiglia; Francia)
book: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) - (978-3-95977-222-8)
11573/1634797 - 2022 -
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography Galesi, N.; Ranjbar, F. - 01a Articolo in rivista
paper: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 103-117 - issn: 0304-3975 - wos: WOS:000830148200009 (1) - scopus: 2-s2.0-85127464721 (1)
11573/1422847 - 2020 -
Cops-Robber Games and the Resolution of Tseitin Formulas Galesi, N.; Talebanfard, N.; Toran, J. - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATION THEORY (New York, N.Y. : Association for Computing Machinery) pp. 1-22 - issn: 1942-3454 - wos: WOS:000583676000002 (5) - scopus: 2-s2.0-85085257046 (7)
11573/1308191 - 2019 -
Resolution and the binary encoding of combinatorial principles Dantchev, S.; Galesi, N.; Martin, B. - 04b Atto di convegno in volume
conference: 34th Computational Complexity Conference, CCC 2019 (New Brunswick; United States)
book: Leibniz International Proceedings in Informatics, LIPIcs - (978-3-95977-116-0)
11573/1311217 - 2019 -
Bounded-depth frege complexity of tseitin formulas for all graphs Galesi, N.; Itsykson, D.; Riazanov, A.; Sofronova, A. - 04b Atto di convegno in volume
conference: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019 (Aachen; Germany)
book: Leibniz International Proceedings in Informatics, LIPIcs - (978-3-95977-117-7)
11573/1422856 - 2019 -
Polynomial calculus space and resolution width Galesi, N.; Kolodziejczyk, L.; Thapen, N. - 04b Atto di convegno in volume
conference: Annual IEEE Symposium on Foundations of Computer Science, FOCS (Baltimore; United States)
book: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS - (978-1-7281-4952-3)
11573/1350776 - 2019 -
Vertex-connectivity for node failure identification in boolean network tomography Galesi, N.; Ranjbar, F.; Zito, M. - 04b Atto di convegno in volume
conference: 15th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2019 (Munich; Germany)
book: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - (978-3-030-34404-7; 978-3-030-34405-4)
11573/1264316 - 2018 -
Tight bounds for maximal identifiability of failure nodes in boolean network tomography Galesi, Nicola; Ranjbar, Fariba - 04b Atto di convegno in volume
conference: 38th IEEE International Conference on Distributed Computing Systems, ICDCS 2018 (Vienna University of Technology (TU Wien), aut)
book: Proceedings - International Conference on Distributed Computing Systems - (9781538668719)
11573/1264314 - 2018 -
Cops-Robber games and the resolution of Tseitin Formulas Galesi, Nicola; Talebanfard, Navid; Torán, Jacobo - 04b Atto di convegno in volume
conference: 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018 (gbr)
book: 21st International Conference on Theory and Applications of Satisfiability Testing, SAT 2018 Held as Part of the Federated Logic Conference, FloC 2018; Oxford; United Kingdom; 9 July 2018 through 12 July 2018; Code 215249 - (9783319941431)
11573/978134 - 2017 -
Space proof complexity for random 3-CNFs Bennett, Patrick; Bonacina, Ilario; Galesi, Nicola; Huynh, Tony; Molloy, Mike; Wollan, Paul Joseph - 01a Articolo in rivista
paper: INFORMATION AND COMPUTATION (Orlando, Fla. : Academic Press
[New York] : Elsevier Science (USA)) pp. 165-176 - issn: 1090-2651 - wos: WOS:000407658600008 (3) - scopus: 2-s2.0-85021162863 (6)
11573/902276 - 2016 -
A framework for space complexity in algebraic proof systems Bonacina, Ilario; Galesi, Nicola - 01a Articolo in rivista
paper: JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY (ACM / Association for Computing Machinery:1515 Broadway, 17th Floor:New York, NY 10036:(212)869-7440, EMAIL: acmhelp@hq.acm.org, INTERNET: http://www.acm.org, Fax: (212)944-1318) pp. 1-20 - issn: 0004-5411 - wos: WOS:000357529300006 (5) - scopus: 2-s2.0-84936945139 (12)
Bonacina, Ilario; Galesi, Nicola; Thapen, Neil - 01a Articolo in rivista
paper: SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics:3600 University City Science Center:Philadelphia, PA 19104:(800)447-7426, (215)382-9800, EMAIL: service@siam.org, INTERNET: http://www.siam.org, Fax: (215)386-7999) pp. 1894-1909 - issn: 0097-5397 - wos: WOS:000387321500007 (5) - scopus: 2-s2.0-85010644516 (6)
11573/902288 - 2016 -
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-25 - issn: 1529-3785 - wos: WOS:000390984400004 (0) - scopus: 2-s2.0-84987984208 (0)
11573/908272 - 2015 -
The space complexity of cutting planes refutations Galesi, Nicola; Pudlák, Pavel; Thapen, Neil - 04b Atto di convegno in volume
conference: 30th Conference on Computational Complexity, CCC 2015 (Portrland)
book: Leibniz International Proceedings in Informatics, LIPIcs - (9783939897811; 9783939897811)
11573/643028 - 2014 -
Proofs of Space: When Space Is of the Essence Ateniese, Giuseppe; Bonacina, Ilario; Faonio, Antonio; Galesi, Nicola - 04b Atto di convegno in volume
book: Security and Cryptography for Networks - 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings - (9783319108780; 9783319108780)
Bonacina, Ilario; Galesi, Nicola; Thapen, Neil - 04b Atto di convegno in volume
conference: 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 (Radisson Blu Warwick Hotel, usa)
book: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS - (9781479965175; 9781479965175)
11573/718353 - 2013 -
A characterization of tree-like Resolution size Beyersdorff, Olaf; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 666-671 - issn: 0020-0190 - wos: WOS:000322610700005 (19) - scopus: 2-s2.0-84879377601 (25)
11573/496975 - 2013 -
Pseudo-Partitions, Transeversality and Locality: A combinatorial characterization for Space measure in Algebraic Systems Ilario, Bonacina; Galesi, Nicola - 04b Atto di convegno in volume
conference: Innovations in Theoretical Computer Science (Berkeley)
book: Proc. Innovations in Theoretical Computer Science - ()
11573/496979 - 2013 -
Parameterized Complexity of DPLL Search Procedures Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-21 - issn: 1529-3785 - wos: WOS:000323892900004 (18) - scopus: 2-s2.0-84879381038 (23)
11573/490888 - 2012 -
Parameterized bounded-depth Frege is not optimal Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATION THEORY (New York, N.Y. : Association for Computing Machinery) pp. 1-16 - issn: 1942-3454 - wos: (0) - scopus: 2-s2.0-84868675131 (18)
Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo - 04b Atto di convegno in volume
conference: 26th Annual IEEE Conference on Computational Complexity (CCC) (San Jose, CA)
book: Proceedings of the 26th Annual IEEE Conference on Computational Complexity - (9780769544113)
11573/392502 - 2011 -
Parameterized complexity of DPLL search procedures Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo - 04b Atto di convegno in volume
conference: 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011 (Ann Arbor, MI)
book: Theory and Applications of Satisfiability Testing - SAT 2011 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings - (9783642215803; 9783642215810)
11573/391744 - 2011 -
Parameterized bounded-depth Frege is not optimal Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo; Alexander A., Razborov: - 04b Atto di convegno in volume
conference: 38th International Colloquium on Automata, Languages and Programming, ICALP 2011 (Zurich)
book: Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I 2011 - (9783642220050; 9783642220067)
11573/133664 - 2010 -
Optimality of size-degree tradeoffs for polynomial calculus Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC (New York, NY : Association for Computing Machinery, c2000-) pp. 1-22 - issn: 1529-3785 - wos: WOS:000284931300004 (20) - scopus: 2-s2.0-78649352528 (20)
11573/208782 - 2010 -
On the Automatizability of Polynomial Calculus Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: THEORY OF COMPUTING SYSTEMS (Springer-Verlag New York Incorporated:175 Fifth Avenue:New York, NY 10010:(212)460-1500, EMAIL: orders@springer-ny.com, INTERNET: http://www.springer-ny.com, Fax: (212)533-3503) pp. 491-506 - issn: 1432-4350 - wos: WOS:000278029300008 (12) - scopus: 2-s2.0-77952958208 (17)
11573/133793 - 2010 -
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games Olaf, Beyersdorff; Galesi, Nicola; Lauria, Massimo - 01a Articolo in rivista
paper: INFORMATION PROCESSING LETTERS (-Amsterdam : Elsevier Science
-Amsterdam : North-Holland) pp. 1074-1077 - issn: 0020-0190 - wos: WOS:000284388500009 (12) - scopus: 2-s2.0-77957276708 (18)
11573/133120 - 2006 -
Rank Bounds and Integrality Gaps for Cutting Planes Procedures J., Buresh Oppenheim; Galesi, Nicola; A., Magen; S., Hoory; T., Pitassi - 01a Articolo in rivista
paper: THEORY OF COMPUTING ([Chicago, Ill. : Department of Computer Science, University of Chicago], 2005-) pp. 65-90 - issn: 1557-2862 - wos: (0) - scopus: (0)
Galesi, Nicola; Thapen, N. - 04b Atto di convegno in volume
conference: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005 (St Andrews, Scotland,)
book: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005 - (9783540262763)
11573/162896 - 2004 -
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank Galesi, Nicola; Kullmann, O. - 04b Atto di convegno in volume
conference: The International Conferences on Theory and Applications of Satisfiability Testing (SAT) (Vancouver (BC), Canada)
book: Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004 - (9783540278290)
11573/205902 - 2004 -
The Complexity of Treelike Systems over lamdda-Local Formulae Galesi, Nicola; Thapen, N. - 04b Atto di convegno in volume
conference: IEEE Conference on Computational Complexity. (Amherst, Massachusetts, USA)
book: 19th Annual IEEE Conference on Computational Complexity (CCC 2004) - ()
11573/133655 - 2004 -
On the complexity of resolution with bounded conjunctions Juan Luis, Esteban; Galesi, Nicola; Jochen, Messner - 01a Articolo in rivista
paper: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 347-370 - issn: 0304-3975 - wos: WOS:000223383700009 (21) - scopus: 2-s2.0-3242685008 (31)
11573/208299 - 2003 -
Rank Bounds and Integrality Gaps for Cutting Planes Procedures Buresh Oppenheim, J.; Galesi, Nicola; Hoory, S.; Magen, A.; Pitassi, T. - 04b Atto di convegno in volume
conference: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003) (Cambridge, MA (USA))
book: 44th Symposium on Foundations of Computer Science (FOCS 2003) - ()
11573/133656 - 2003 -
Space complexity of random formulae in resolution Eli Ben, Sasson; Galesi, Nicola - 01a Articolo in rivista
paper: RANDOM STRUCTURES & ALGORITHMS (John Wiley & Sons Incorporated:Customer Service, 111 River Street:Hoboken, NJ 07030:(800)225-5945, (201)748-6000, EMAIL: societyinfo@wiley.com, INTERNET: http://www.wiley.com, Fax: (212)748-6551) pp. 92-109 - issn: 1042-9832 - wos: WOS:000184211400005 (38) - scopus: 2-s2.0-0042806264 (51)
11573/133658 - 2003 -
Degree complexity for a modified pigeonhole principle Maria Luisa, Bonet; Galesi, Nicola - 01a Articolo in rivista
paper: ARCHIVE FOR MATHEMATICAL LOGIC (Springer Verlag Germany:Tiergartenstrasse 17, D 69121 Heidelberg Germany:011 49 6221 3450, EMAIL: g.braun@springer.de, INTERNET: http://www.springer.de, Fax: 011 49 6221 345229) pp. 403-414 - issn: 0933-5846 - wos: WOS:000183780000001 (1) - scopus: 2-s2.0-0037998778 (2)
11573/133657 - 2002 -
Monotone Simulations of Nonmonotone Proofs A., Atserias; Galesi, Nicola; P., Pudlak - 01a Articolo in rivista
paper: JOURNAL OF COMPUTER AND SYSTEM SCIENCES (Academic Press Incorporated:6277 Sea Harbor Drive:Orlando, FL 32887:(800)543-9534, (407)345-4100, EMAIL: ap@acad.com, INTERNET: http://www.idealibrary.com, Fax: (407)352-3445) pp. 626-638 - issn: 0022-0000 - wos: WOS:000180154300003 (16) - scopus: 2-s2.0-23844483527 (19)
11573/162894 - 2002 -
On the complexity of resolution with bounded conjunctions. Juan Luis, Esteban; Galesi, Nicola; Jochen, Messner - 04b Atto di convegno in volume
conference: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, (Malaga, Spain,)
book: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, - (9783540438649)
11573/133660 - 2001 -
Monotone Proofs of the Pigeon Hole Principle Atserias, A.; Galesi, Nicola; Gavalda, R. - 01a Articolo in rivista
paper: MATHEMATICAL LOGIC QUARTERLY (- WILEY-V C H VERLAG GMBH, PO BOX 10 11 61, WEINHEIM, GERMANY, D-69451
-Johann Ambrosius Barth:Prager Strasse 16 B, D-04103 Leipzig Germany:011 49 341 9781570, Fax: 011 49 341 9781575) pp. 461-474 - issn: 0942-5616 - wos: WOS:000172160800005 (7) - scopus: 2-s2.0-0035541203 (7)
11573/208300 - 2001 -
Monotone Simulations of Nonmonotone Proofs. Atserias, A.; Galesi, Nicola; Pudlak, P. - 04b Atto di convegno in volume
conference: 16th Annual IEEE Conference on Computational Complexity (Chicago, IL, USA)
book: 16th Annual IEEE Conference on Computational Complexity - ()
11573/208761 - 2001 -
Space Complexity of Random Formulae in Resolution Ben Sasson, E.; Galesi, Nicola - 04b Atto di convegno in volume
conference: 16th Annual IEEE Conference on Computational Complexity (Chicago Il USA)
book: 16th Annual IEEE Conference on Computational Complexity - ()
11573/133659 - 2001 -
Optimality of size-width tradeoffs for resolution Maria Luisa, Bonet; Galesi, Nicola - 01a Articolo in rivista
paper: COMPUTATIONAL COMPLEXITY (Birkhaeuser Verlag AG:Viaduktstrasse 42-44, CH 4051 Basel Switzerland:011 41 61 2050707, EMAIL: subscriptions@birkhauser.ch, INTERNET: http://www.birkhauser.ch, Fax: 011 41 61 2050792) pp. 261-276 - issn: 1016-3328 - wos: WOS:000182873900001 (40) - scopus: 2-s2.0-0038036843 (58)
11573/133661 - 2001 -
A predicative and decidable characterization of the polynomial classes of languages S., Caporaso; M., Zito; Galesi, Nicola - 01a Articolo in rivista
paper: THEORETICAL COMPUTER SCIENCE (Elsevier BV:PO Box 211, 1000 AE Amsterdam Netherlands:011 31 20 4853757, 011 31 20 4853642, 011 31 20 4853641, EMAIL: nlinfo-f@elsevier.nl, INTERNET: http://www.elsevier.nl, Fax: 011 31 20 4853598) pp. 83-99 - issn: 0304-3975 - wos: WOS:000165324800007 (2) - scopus: 2-s2.0-0347983272 (3)
11573/162897 - 2000 -
Monotone Proofs of the Pigeon Hole Principle Atserias, A.; Galesi, Nicola; Gavalda, R. - 04b Atto di convegno in volume
conference: ICALP (Lecture Notes in Computer Science. Geneva, Switzerland, July 9-15.)
book: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000 - (9783540677154)
11573/133662 - 2000 -
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systemsv Bont, M. L.; Esteban, J. L.; Galesi, Nicola; Johannsen, J. - 01a Articolo in rivista
paper: SIAM JOURNAL ON COMPUTING (Society for Industrial and Applied Mathematics:3600 University City Science Center:Philadelphia, PA 19104:(800)447-7426, (215)382-9800, EMAIL: service@siam.org, INTERNET: http://www.siam.org, Fax: (215)386-7999) pp. 1462-1484 - issn: 0097-5397 - wos: WOS:000167679200005 (56) - scopus: 2-s2.0-0035178618 (73)
11573/208762 - 1999 -
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus Bonet, M. L.; Galesi, Nicola - 04b Atto di convegno in volume
conference: 40th Annual Symposium on Foundations of Computer Science, FOCS '99 (New York City, NY)
book: 40th Annual Symposium on Foundations of Computer Science, FOCS '99 - ()
11573/205918 - 1998 -
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems Bonet M., L; Esteban, J. L.; Galesi, Nicola; Johannsen, J. - 04b Atto di convegno in volume
conference: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, (Palo Alto, California, USA.)
book: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, - ()
11573/133663 - 1997 -
A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists. Galesi, Nicola - 01a Articolo in rivista
paper: RAIRO. INFORMATIQUE THEORIQUE ET APPLICATIONS (Attuale :
EDP Sciences
17, avenue du Hoggar - Parc d'Activités de Courtaboeuf - BP 112 - F-91944 Les Ulis Cedex A - France
precedenti:
-Paris: Elsevier 1997-1998
-Dunod Gauthier Villars:15 rue Gossin, 92543 Montrouge France:011 33 1 40926527, 011 33 1 46565266, Fax: 011 33 1 40926597) pp. 149-158 - issn: 0988-3754 - wos: (0) - scopus: (0)