Giorgio Ausiello - Academia.edu (original) (raw)

Uploads

Papers by Giorgio Ausiello

Research paper thumbnail of An overview of the Italian National Project on "Algorithms, Computation Models, and Information Structures

ABSTRACT This document presents the results achieved in the framework of the Italian research pro... more ABSTRACT This document presents the results achieved in the framework of the Italian research project "Algorithms, Computation Models and Information Structures," supported by the Italian Ministry of University and of Scientific and Technologic Research (MURST) in the three years 1991--1993. Fifteen partners from thirteen Italian universities participated with the project. UNIVERSITY DEPARTMENT PRINCIPAL INVESTIGATOR L'Aquila Pure and Applied Mathematics Umberto Nanni Milano Computer Science Giancarlo Mauri Milano-Politecnico Electronics and Information Francesco Maffioli Padova Electronics and Computer Science Gianfranco Bilardi Palermo Mathematics and Applications Antonio Restivo Perugia Mathematics Ferruccio Barsi Pisa Computer Science Fabrizio Luccio Roma "La Sapienza" Computer and System Sciences Giorgio Ausiello Roma "La Sapienza" Computer Science Daniel Pierre Bovet Roma "La Sapienza" Mathematics Aldo de Luca Roma "Tor Vergata" Mathematics Marco Protasi Salerno Computer Science and Applications Alfredo De Santis Siena Mathematics Elena Lodi Torino Computer Science Silvano Martello Trieste Electrical, Electronic and Computer Sciences Paolo Sipala The Project is coordinated by Giorgio Ausiello. Seven research areas have been investigated. Area 1 Foundations and complexity Area 2 Discrete optimization Area 3 Combinatorics on words, traces and codes Area 4 Parallel and distributed models of computing Area 5 Data structures Area 6 Computational learning and data compression Area 7 Cryptography In the rest of this document the results obtained by the project partners, within each single area, are briefly presented.

Research paper thumbnail of Data types and control structures for the treatment of algebraic expressions

Research paper thumbnail of Selected Papers in honour of Maurice Nivat - Editorial

Research paper thumbnail of Selected papers presented at the first international conference on database theory, Rome, September 1986

Research paper thumbnail of Una introduzione alla manipolazione algebrica

Calcolo, 1971

... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei po... more ... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei polinomi in esame e di eseguire anche passi di ... quella delle cosiddette espressioni razionali esponenziali del primo ordine; essa h definita assumendo come costanti i humeri razionali e Punit~ immaginaria, le ...

Research paper thumbnail of Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius

Research paper thumbnail of Teorie della Complessita di Calcolo

Calcolo, 1970

SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo de... more SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo della Complessit~ di Calcolo, svelte essenzialmente negli U. S. A. La rassegna esamina vari approeci allo studio della Complessith di Calcolo, la loro evoluzione e le loro interrelazioni. Particolare interesse ~ dedicato alla teoria assiomatica alla qualo b ltata dedicata la pih intensa attivit~ di ricerea negli anni 1967-1970.

Research paper thumbnail of Exploiting Pompei Cultural Heritage: The Plinius Project

Research paper thumbnail of Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius

Research paper thumbnail of Una introduzione alla manipolazione algebrica

Calcolo, 1971

... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei po... more ... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei polinomi in esame e di eseguire anche passi di ... quella delle cosiddette espressioni razionali esponenziali del primo ordine; essa h definita assumendo come costanti i humeri razionali e Punit~ immaginaria, le ...

Research paper thumbnail of Teorie della Complessita di Calcolo

Calcolo, 1970

SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo de... more SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo della Complessit~ di Calcolo, svelte essenzialmente negli U. S. A. La rassegna esamina vari approeci allo studio della Complessith di Calcolo, la loro evoluzione e le loro interrelazioni. Particolare interesse ~ dedicato alla teoria assiomatica alla qualo b ltata dedicata la pih intensa attivit~ di ricerea negli anni 1967-1970.

Research paper thumbnail of Limiting Polynomial Approximation of Complexity Classes

Ijfcs, 1990

ABSTRACT The concept of limiting approximation, formerly introduced by Gold for recursive functio... more ABSTRACT The concept of limiting approximation, formerly introduced by Gold for recursive functions, is applied to the polynomial level of complexity in order to determine meaningful characterizations of classes of functions and sets which are not (or which are not known to be) polynomially computable. In particular, characterizations of NP, PSPACE and other classes of elementary functions are provided in terms of limiting polynomial approximation. In addition trade-offs between the space required by the approximating functions and the rate of convergence of the approximation are shown.

Research paper thumbnail of Complexity and approarirnation; combinatorial optimization problems and their approxirnability prope

Research paper thumbnail of Magic in Science

Research paper thumbnail of Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings

Research paper thumbnail of Algorithmic research for the 21st century

Page 1. Economic Globalization & The Choice of Asia: Shanghai Forum 2005 Algorithmic research... more Page 1. Economic Globalization & The Choice of Asia: Shanghai Forum 2005 Algorithmic research for the 21st century Giorgio Ausiello and Luigi Laura University of Rome 'La Sapienza', Rome, Italy Introduction If we look retrospectively ...

Research paper thumbnail of Minimal Coverings of Acyclic Database Schemata

Adbt, 1982

ABSTRACT In this chapter classes of acyclic hypergraphs associated with classes of relational dat... more ABSTRACT In this chapter classes of acyclic hypergraphs associated with classes of relational database schemata are investigated. Various concepts of minimal coverings over a given set of nodes are considered, their interpretation in terms of the relational model is given and their properties studied with respect to the acyclicity degree of the hypergraphs. Several results concerning the computational complexity of determining minimal coverings are provided.

Research paper thumbnail of Toward a unifed approach for the classification of np-complete optimization problems

Quaderni Di Matematica, May 9, 1979

Research paper thumbnail of Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes

Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, Jun 15, 1980

In this paper the graph formalism for the representation of relational data base schemes is prese... more In this paper the graph formalism for the representation of relational data base schemes is presented.

Research paper thumbnail of Minimal representations of directed hypergraphs and their application to database design

Research paper thumbnail of An overview of the Italian National Project on "Algorithms, Computation Models, and Information Structures

ABSTRACT This document presents the results achieved in the framework of the Italian research pro... more ABSTRACT This document presents the results achieved in the framework of the Italian research project "Algorithms, Computation Models and Information Structures," supported by the Italian Ministry of University and of Scientific and Technologic Research (MURST) in the three years 1991--1993. Fifteen partners from thirteen Italian universities participated with the project. UNIVERSITY DEPARTMENT PRINCIPAL INVESTIGATOR L'Aquila Pure and Applied Mathematics Umberto Nanni Milano Computer Science Giancarlo Mauri Milano-Politecnico Electronics and Information Francesco Maffioli Padova Electronics and Computer Science Gianfranco Bilardi Palermo Mathematics and Applications Antonio Restivo Perugia Mathematics Ferruccio Barsi Pisa Computer Science Fabrizio Luccio Roma "La Sapienza" Computer and System Sciences Giorgio Ausiello Roma "La Sapienza" Computer Science Daniel Pierre Bovet Roma "La Sapienza" Mathematics Aldo de Luca Roma "Tor Vergata" Mathematics Marco Protasi Salerno Computer Science and Applications Alfredo De Santis Siena Mathematics Elena Lodi Torino Computer Science Silvano Martello Trieste Electrical, Electronic and Computer Sciences Paolo Sipala The Project is coordinated by Giorgio Ausiello. Seven research areas have been investigated. Area 1 Foundations and complexity Area 2 Discrete optimization Area 3 Combinatorics on words, traces and codes Area 4 Parallel and distributed models of computing Area 5 Data structures Area 6 Computational learning and data compression Area 7 Cryptography In the rest of this document the results obtained by the project partners, within each single area, are briefly presented.

Research paper thumbnail of Data types and control structures for the treatment of algebraic expressions

Research paper thumbnail of Selected Papers in honour of Maurice Nivat - Editorial

Research paper thumbnail of Selected papers presented at the first international conference on database theory, Rome, September 1986

Research paper thumbnail of Una introduzione alla manipolazione algebrica

Calcolo, 1971

... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei po... more ... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei polinomi in esame e di eseguire anche passi di ... quella delle cosiddette espressioni razionali esponenziali del primo ordine; essa h definita assumendo come costanti i humeri razionali e Punit~ immaginaria, le ...

Research paper thumbnail of Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius

Research paper thumbnail of Teorie della Complessita di Calcolo

Calcolo, 1970

SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo de... more SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo della Complessit~ di Calcolo, svelte essenzialmente negli U. S. A. La rassegna esamina vari approeci allo studio della Complessith di Calcolo, la loro evoluzione e le loro interrelazioni. Particolare interesse ~ dedicato alla teoria assiomatica alla qualo b ltata dedicata la pih intensa attivit~ di ricerea negli anni 1967-1970.

Research paper thumbnail of Exploiting Pompei Cultural Heritage: The Plinius Project

Research paper thumbnail of Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius

Research paper thumbnail of Una introduzione alla manipolazione algebrica

Calcolo, 1971

... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei po... more ... e dalPaltro la capacit'~ di gestire l'elevatissimo numero di termini dei polinomi in esame e di eseguire anche passi di ... quella delle cosiddette espressioni razionali esponenziali del primo ordine; essa h definita assumendo come costanti i humeri razionali e Punit~ immaginaria, le ...

Research paper thumbnail of Teorie della Complessita di Calcolo

Calcolo, 1970

SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo de... more SOMMARIO : Quanto segue b una rassogna volta a puntualizzare lo state dells ricerehe nel oampo della Complessit~ di Calcolo, svelte essenzialmente negli U. S. A. La rassegna esamina vari approeci allo studio della Complessith di Calcolo, la loro evoluzione e le loro interrelazioni. Particolare interesse ~ dedicato alla teoria assiomatica alla qualo b ltata dedicata la pih intensa attivit~ di ricerea negli anni 1967-1970.

Research paper thumbnail of Limiting Polynomial Approximation of Complexity Classes

Ijfcs, 1990

ABSTRACT The concept of limiting approximation, formerly introduced by Gold for recursive functio... more ABSTRACT The concept of limiting approximation, formerly introduced by Gold for recursive functions, is applied to the polynomial level of complexity in order to determine meaningful characterizations of classes of functions and sets which are not (or which are not known to be) polynomially computable. In particular, characterizations of NP, PSPACE and other classes of elementary functions are provided in terms of limiting polynomial approximation. In addition trade-offs between the space required by the approximating functions and the rate of convergence of the approximation are shown.

Research paper thumbnail of Complexity and approarirnation; combinatorial optimization problems and their approxirnability prope

Research paper thumbnail of Magic in Science

Research paper thumbnail of Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings

Research paper thumbnail of Algorithmic research for the 21st century

Page 1. Economic Globalization & The Choice of Asia: Shanghai Forum 2005 Algorithmic research... more Page 1. Economic Globalization & The Choice of Asia: Shanghai Forum 2005 Algorithmic research for the 21st century Giorgio Ausiello and Luigi Laura University of Rome 'La Sapienza', Rome, Italy Introduction If we look retrospectively ...

Research paper thumbnail of Minimal Coverings of Acyclic Database Schemata

Adbt, 1982

ABSTRACT In this chapter classes of acyclic hypergraphs associated with classes of relational dat... more ABSTRACT In this chapter classes of acyclic hypergraphs associated with classes of relational database schemata are investigated. Various concepts of minimal coverings over a given set of nodes are considered, their interpretation in terms of the relational model is given and their properties studied with respect to the acyclicity degree of the hypergraphs. Several results concerning the computational complexity of determining minimal coverings are provided.

Research paper thumbnail of Toward a unifed approach for the classification of np-complete optimization problems

Quaderni Di Matematica, May 9, 1979

Research paper thumbnail of Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes

Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science, Jun 15, 1980

In this paper the graph formalism for the representation of relational data base schemes is prese... more In this paper the graph formalism for the representation of relational data base schemes is presented.

Research paper thumbnail of Minimal representations of directed hypergraphs and their application to database design