Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiorgio Ausiello
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j47]Giorgio Ausiello:
EATCS Golden Jubilee: How EATCS was born 50 years ago and why it is still alive and well. Bull. EATCS 137 (2022)- [i6]Giorgio Ausiello, Lorenzo Balzotti, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs. CoRR abs/2204.10568 (2022) - 2021
- [j46]Giorgio Ausiello
, Giorgio Gambosi:
Theoretical Computer Science in Italy: The Early Years. IEEE Ann. Hist. Comput. 43(3): 44-56 (2021) - [c51]Ronald Fagin, Georg Gottlob, Christos H. Papadimitriou, Moshe Y. Vardi, Giorgio Ausiello, Maurizio Lenzerini, Domenico Saccà, Luigi Palopoli, Francesco Scarcello:
Panel on "Past and Future of Computer Science Theory" (Discussion Paper). SEBD 2021: 531-542 - 2020
- [j45]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 807: 1-2 (2020) - [c50]Giorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura:
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. ICTCS 2020: 190-201 - [i5]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max-flow vitality in undirected unweighted planar graphs. CoRR abs/2011.02375 (2020)
2010 – 2019
- 2019
- [j44]Giorgio Ausiello:
The Making of a New Science A Personal Journey Through the Early Years of Theoretical Computer Science. Bull. EATCS 127 (2019) - [j43]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and st-planar graphs. Networks 74(1): 70-78 (2019) - [j42]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella, Paul G. Spirakis, Pierre-Louis Curien:
Preface. Theor. Comput. Sci. 777: 1-2 (2019) - 2018
- [b2]Giorgio Ausiello:
The Making of a New Science - A Personal Journey Through the Early Years of Theoretical Computer Science. Springer 2018, ISBN 978-3-319-62679-6, pp. 1-290 - [p4]Giorgio Ausiello, Vangelis Th. Paschos:
Reductions That Preserve Approximability. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 243-258 - [p3]Giorgio Ausiello, Vangelis Th. Paschos:
Differential Ratio Approximation. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 259-274 - [p2]Giorgio Ausiello, Vincenzo Bonifaci, Stefano Leonardi, Alberto Marchetti-Spaccamela:
Prize Collecting Traveling Salesman and Related Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 611-628 - 2017
- [j41]Giorgio Ausiello, Luigi Laura:
Directed hypergraphs: Introduction and fundamental algorithms - A survey. Theor. Comput. Sci. 658: 293-306 (2017) - [i4]Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and planar graphs. CoRR abs/1710.01965 (2017) - 2016
- [j40]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Resilient Graph Spanners. Algorithmica 74(4): 1363-1385 (2016) - [j39]Giorgio Ausiello, Rossella Petreschi:
Presentation of the book: The Power of Algorithms Inspiration and Examples in Everyday Life. Bull. EATCS 118 (2016) - 2015
- [j38]Giorgio Ausiello, Lila Kari, Grzegorz Rozenberg, Donald Sannella:
TCS in the 21st century. Theor. Comput. Sci. 591: 3-4 (2015) - 2013
- [c49]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, Andrea Ribichini:
On Resilient Graph Spanners. ESA 2013: 85-96 - [c48]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
The (betweenness) centrality of critical nodes and network cores. IWCMC 2013: 90-95 - [p1]Giorgio Ausiello:
Algorithms, An Historical Perspective. The Power of Algorithms 2013: 3-26 - [e6]Giorgio Ausiello, Rossella Petreschi:
The Power of Algorithms - Inspiration and Examples in Everyday Life. Springer 2013, ISBN 978-3-642-39651-9 [contents] - [i3]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
On Robust Graph Spanners. CoRR abs/1303.1559 (2013) - 2012
- [j37]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online maximum k-coverage. Discret. Appl. Math. 160(13-14): 1901-1913 (2012) - [j36]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components. Networks 59(3): 275-288 (2012) - [j35]Giorgio Ausiello, Hendrik Jan Hoogeboom, Juhani Karhumäki, Ion Petre, Arto Salomaa:
Preface. Theor. Comput. Sci. 429: 1-20 (2012) - [c47]Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco:
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. ISCO 2012: 1-14 - [c46]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
Real-time analysis of critical nodes in network cores. IWCMC 2012: 42-46 - [c45]Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani:
k-Calling context profiling. OOPSLA 2012: 867-878 - [i2]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
Real-Time Monitoring of Undirected Networks: Articulation Points, Bridges, and Connected and Biconnected Components. CoRR abs/1202.0319 (2012) - [i1]Giorgio Ausiello, Francesco Cristiano, Luigi Laura:
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c44]Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. FCT 2011: 181-192 - [c43]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network. IWCMC 2011: 1575-1579 - 2010
- [j34]Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. Discret. Math. Algorithms Appl. 2(4): 591-606 (2010) - [c42]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. COCOON 2010: 160-172
2000 – 2009
- 2009
- [j33]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55(2): 346-374 (2009) - [j32]Giorgio Ausiello, Nicolas Bourgeois, Telis Giannakos, Vangelis Th. Paschos:
Greedy Algorithms For On-Line Set-Covering. Algorithmic Oper. Res. 4(1): 36-48 (2009) - [j31]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of minimum and maximum traveling salesman's tours. J. Discrete Algorithms 7(4): 453-463 (2009) - [j30]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small stretch (alpha, beta)-spanners in the streaming model. Theor. Comput. Sci. 410(36): 3406-3413 (2009) - [c41]Giorgio Ausiello, Donatella Firmani, Luigi Laura:
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components. ICTCS 2009: 26-29 - 2008
- [j29]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
The online Prize-Collecting Traveling Salesman Problem. Inf. Process. Lett. 107(6): 199-204 (2008) - [j28]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
The on-line asymmetric traveling salesman problem. J. Discrete Algorithms 6(2): 290-298 (2008) - [j27]Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
On the power of lookahead in on-line server routing problems. Theor. Comput. Sci. 408(2-3): 116-128 (2008) - [e5]Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong:
Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy. IFIP 273, Springer 2008, ISBN 978-0-387-09679-7 [contents] - 2007
- [c40]Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini:
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ESA 2007: 605-617 - [c39]Giorgio Ausiello:
Clairvoyance and Laziness for on Line Travelling Agents. ICTCS 2007: 3 - [r3]Giorgio Ausiello, Vangelis Th. Paschos:
Reductions That Preserve Approximability. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r2]Giorgio Ausiello, Vangelis Th. Paschos:
Differential Ratio Approximation. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Alberto Marchetti-Spaccamela, Vincenzo Bonifaci, Stefano Leonardi, Giorgio Ausiello:
Prize-Collecting Traveling Salesman and Related Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j26]Giorgio Ausiello, Vangelis Th. Paschos:
Reductions, completeness and the hardness of approximability. Eur. J. Oper. Res. 172(3): 719-739 (2006) - [j25]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small Stretch Spanners on Dynamic Graphs. J. Graph Algorithms Appl. 10(2): 365-385 (2006) - [c38]Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos:
Greedy algorithms for on-line set-covering and related problems. CATS 2006: 145-151 - [c37]Giorgio Ausiello, Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
Reoptimization of Minimum and Maximum Traveling Salesman's Tours. SWAT 2006: 196-207 - [c36]Giorgio Ausiello, Luca Allulli, Vincenzo Bonifaci, Luigi Laura:
On-Line Algorithms, Real Time, the Virtue of Laziness, and the Power of Clairvoyance. TAMC 2006: 1-20 - 2005
- [j24]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in differential approximation classes. Int. J. Found. Comput. Sci. 16(6): 1267-1295 (2005) - [j23]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Partially dynamic maintenance of minimum weight hyperpaths. J. Discrete Algorithms 3(1): 27-46 (2005) - [c35]Luca Allulli, Giorgio Ausiello, Luigi Laura:
On the Power of Lookahead in On-Line Vehicle Routing Problems. COCOON 2005: 728-736 - [c34]Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano:
Small Stretch Spanners on Dynamic Graphs. ESA 2005: 532-543 - [c33]Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
The On-line Asymmetric Traveling Salesman Problem. WADS 2005: 306-317 - 2004
- [j22]Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem. Inf. Process. Lett. 92(2): 89-94 (2004) - [c32]Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
Algorithms for the On-Line Quota Traveling Salesman Problem. COCOON 2004: 290-299 - 2003
- [c31]Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos:
Completeness in Differential Approximation Classes. MFCS 2003: 179-188 - 2002
- [j21]Giorgio Ausiello:
Selected Papers in honour of Maurice Nivat - Editorial. Theor. Comput. Sci. 281(1-2): 1 (2002) - 2001
- [j20]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Algorithms for the On-Line Travelling Salesman. Algorithmica 29(4): 560-581 (2001) - [j19]Giorgio Ausiello, Donald Sannella, Michael W. Mislove:
25 Years. Theor. Comput. Sci. 250(1-2) (2001) - [c30]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. ICTCS 2001: 312-327 - 2000
- [c29]Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela:
On Salesmen, Repairmen, Spiders, and Other Traveling Agents. CIAC 2000: 1-16 - [c28]Giorgio Ausiello:
Algorithm Design Challenges. IFIP TCS 2000: 602-603 - [c27]Angela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini:
Sistemi multimediali per la valorizzazione del patrimonio culturale: il progetto Plinius. SEBD 2000: 415-427
1990 – 1999
- 1999
- [b1]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann:
Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer 1999, ISBN 3540654313, pp. I-XIX, 1-524 - [c26]Angela Antonicelli, Giovanni Sciscio, Renato Rosicarelli, Giorgio Ausiello, Tiziana Catarci, Massimo Ferrarini:
Exploiting Pompei Cultural Heritage: The Plinius Project. Eurographics (Short Presentations) 1999 - 1998
- [c25]Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni:
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS 1998: 1-16 - 1997
- [j18]Giorgio Ausiello, Roberto Giaccio:
On-Line Algorithms for Satisfiability Problems with Uncertainty. Theor. Comput. Sci. 171(1-2): 3-24 (1997) - [c24]Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae. ISAAC 1997: 122-131 - 1995
- [j17]Giorgio Ausiello, Marco Protasi:
Local Search, Reducibility and Approximability of NP-Optimization Problems. Inf. Process. Lett. 54(2): 73-79 (1995) - [j16]Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi:
Approximate Solution of NP Optimization Problems. Theor. Comput. Sci. 150(1): 1-55 (1995) - [c23]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Competitive Algorithms for the On-line Traveling Salesman. WADS 1995: 206-217 - 1994
- [c22]Giorgio Ausiello, Esteban Feuerstein, Stefano Leonardi, Leen Stougie, Maurizio Talamo:
Serving Requests with On-line Routing. SWAT 1994: 37-48 - 1992
- [j15]Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
On-Line Computation of Minimal and Maximal Length Paths. Theor. Comput. Sci. 95(2): 245-261 (1992) - 1991
- [j14]Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths. J. Algorithms 12(4): 615-638 (1991) - [j13]Giorgio Ausiello, Giuseppe F. Italiano:
On-Line Algorithms for Polynomially Solvable Satisfiability Problems. J. Log. Program. 10(1): 69-90 (1991) - 1990
- [j12]Giorgio Ausiello, Marco Protasi:
Limiting Polynomial Approximation of Complexity Classes. Int. J. Found. Comput. Sci. 1(2): 111-122 (1990) - [j11]Giorgio Ausiello, Umberto Nanni:
Dynamic Maintenance of Directed Hypergraphs. Theor. Comput. Sci. 72(2&3): 97-117 (1990) - [c21]Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni:
Incremental Algorithms for Minimal Length Paths. SODA 1990: 12-21
1980 – 1989
- 1989
- [e4]Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca:
Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings. Lecture Notes in Computer Science 372, Springer 1989, ISBN 3-540-51371-X [contents] - 1988
- [j10]Giorgio Ausiello:
Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword. Theor. Comput. Sci. 62(1-2): 1 (1988) - [c20]Giorgio Ausiello:
Directed Hypergraphs: Data Structures and Applications. CAAP 1988: 295-303 - [c19]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Umberto Nanni:
Dynamic Maintenance of Paths and Path Expressions on Graphs. ISSAC 1988: 1-12 - 1986
- [j9]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. J. Comput. Syst. Sci. 33(2): 179-202 (1986) - [j8]Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
Minimal Representation of Directed Hypergraphs. SIAM J. Comput. 15(2): 418-431 (1986) - [e3]Giorgio Ausiello, Paolo Atzeni:
ICDT'86, International Conference on Database Theory, Rome, Italy, September 8-10, 1986, Proceedings. Lecture Notes in Computer Science 243, Springer 1986, ISBN 3-540-17187-8 [contents] - 1985
- [j7]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
On the Existence of Acyclic Views in a Database Scheme. Theor. Comput. Sci. 35: 165-177 (1985) - [c18]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models. PODS 1985: 164-170 - 1983
- [j6]Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
Graph Algorithms for Functional Dependency Manipulation. J. ACM 30(4): 752-766 (1983) - [c17]Giorgio Ausiello, Marco Protasi, Maurizio Talamo:
Probabilistic Models for Database Schemes and Random Hypergraphs. WG 1983: 5-16 - [e2]Giorgio Ausiello, Marco Protasi:
CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings. Lecture Notes in Computer Science 159, Springer 1983, ISBN 3-540-12727-5 [contents] - 1982
- [j5]Paolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini:
Inclusion and Equivalence between Relational Database Schemata. Theor. Comput. Sci. 19: 267-285 (1982) - [c16]Giorgio Ausiello, Alessandro D'Atri, Marina Moscarini:
Minimal Coverings of Acyclic Database Schemata. Advances in Data Base Theory 1982: 27-51 - 1981
- [j4]Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
Lattice theoretic ordering properties for NP-complete optimization problems. Fundam. Informaticae 4(1): 83-94 (1981) - [c15]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Full Approximatibility of a Class of Problems over Power Sets. CAAP 1981: 76-87 - [c14]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. FCT 1981: 24-33 - 1980
- [j3]Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
Structure Preserving Reductions among Convex Optimization Problems. J. Comput. Syst. Sci. 21(1): 136-153 (1980) - [j2]Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi:
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. Theor. Comput. Sci. 12: 83-96 (1980) - [c13]Walter Dosch, Martin Wirsing, Giorgio Ausiello, Gianfranco Mascari:
Polynomials - The Specification, Analysis and Development of an Abstract Data Type. GI Jahrestagung 1980: 306-320 - [c12]Giorgio Ausiello, Carlo Batini, Marina Moscarini:
On the Equivalence among Data Base Schemata. ICOD 1980: 34-46 - [c11]Giorgio Ausiello, Carlo Batini, Marina Moscarini:
Conceptual Relations between Databases Transformed under Join and Projection. MFCS 1980: 123-136 - [c10]Giorgio Ausiello, Alessandro D'Atri:
Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes. WG 1980: 212-233
1970 – 1979
- 1979
- [c9]Giorgio Ausiello, Giovanni Mascari:
Design of algebraic data structures with the approach of abstract data types. EUROSAM 1979: 514-530 - 1978
- [e1]Giorgio Ausiello, Corrado Böhm:
Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings. Lecture Notes in Computer Science 62, Springer 1978, ISBN 3-540-08860-1 [contents] - 1977
- [c8]Giorgio Ausiello, Alessandro D'Atri, Marco Protasi:
On the Structure of Combinatorial Problems and Structure Preserving Reductions. ICALP 1977: 45-60 - [c7]Giorgio Ausiello:
On the Structure and Properties of NP-Complete Problems and Their Associated Optimization Problems. MFCS 1977: 1-16 - [c6]Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi:
Classes of Structurally Isomorphic {NP}-Optimization Problems. MFCS 1977: 222-230 - 1976
- [c5]Giorgio Ausiello, Marina Moscarini:
On the Complexity of Decision Problems for Classes of Simple Programs on Strings. GI Jahrestagung 1976: 148-163 - 1975
- [c4]Giorgio Ausiello:
On the description of time varying systems in lambda - calculus. Lambda-Calculus and Computer Science Theory 1975: 177-191 - [c3]Giorgio Ausiello, Marco Protasi:
On the Comparison of Notions of Approximation. MFCS 1975: 172-178 - 1974
- [c2]Giorgio Ausiello:
Relations between Semantics and Complexity of Recursive Programs. ICALP 1974: 129-140 - 1971
- [j1]Giorgio Ausiello:
Abstract Computational Complexity and Cycling Computations. J. Comput. Syst. Sci. 5(2): 118-128 (1971) - 1970
- [c1]Giorgio Ausiello:
On Bounds on the Number of Steps to Compute Functions. STOC 1970: 41-47