Marco Protasi

36 papers A* 2B 7Journal 17Unranked 8
YearRankTypeTitle / Venue / Authors
2001 J jnl
Reactive Local Search for the Maximum Clique Problem.
Algorithmica
Roberto Battiti, Marco Protasi
1999 — book
Complexity and approximation: combinatorial optimization problems and their approximability properties.
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Pierluigi Crescenzi, Giorgio Gambosi, Marco Protasi, Viggo Kann
1999 J jnl
Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP).
Discret. Appl. Math.
Roberto Battiti, Marco Protasi
1997 J jnl
Preserving Approximation in the Min-Weighted Set Cover Problem.
Discret. Appl. Math.
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
1997 — conf
Reactive Local Search for Maximum Clique.
WAE
Roberto Battiti, Marco Protasi
1997 J jnl
Reactive Search, a History-Sensitive Heuristic for MAX-SAT.
ACM J. Exp. Algorithmics
Roberto Battiti, Marco Protasi
1997 — conf
Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent.
ICONIP (1)
Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi
1997 — conf
Suspiciousness of loading problems.
ICNN
Paolo Frasconi, Marco Gori, Stefano Fanelli, Marco Protasi
1996 J jnl
Exploring and comparing the best "direct methods" for the efficient training of MLP-networks.
IEEE Trans. Neural Networks
M. Di Martino, Stefano Fanelli, Marco Protasi
1996 — conf
Solving MAX-SAT with non-oblivious functions and history-based heuristics.
Satisfiability Problem: Theory and Applications
Roberto Battiti, Marco Protasi
1995 J jnl
Approximate Solution of NP Optimization Problems.
Theor. Comput. Sci.
Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi
1995 J jnl
Local Search, Reducibility and Approximability of NP-Optimization Problems.
Inf. Process. Lett.
Giorgio Ausiello, Marco Protasi
1994 J jnl
On Learning Monotone DNF Formulae under Uniform Distributions
Inf. Comput.
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
1993 J jnl
An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets.
BIT
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
1993 — conf
An efficient algorithm for the binary classification of patterns using MLP-networks.
ICNN
S. Fanelli, M. Di Martino, Marco Protasi
1993 J jnl
Limiting Characterizations of Low Level Space Complexity Classes.
RAIRO Theor. Informatics Appl.
Michele Angelaccio, Marco Protasi
1990 J jnl
Limiting Polynomial Approximation of Complexity Classes.
Int. J. Found. Comput. Sci.
Giorgio Ausiello, Marco Protasi
1989 — conf
An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests.
FSTTCS
Giorgio Gambosi, Marco Protasi, Maurizio Talamo
1989 B conf
Learning Under Uniform Distribution.
FCT
Alberto Marchetti-Spaccamela, Marco Protasi
1989 J jnl
On the Number of Arithmetical Operations for Finding Fibonacci Numbers.
Theor. Comput. Sci.
Marco Protasi, Maurizio Talamo
1988 A* conf
On the Learnability of DNF Formulae.
ICALP
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
1986 J jnl
A Parametric Analysis of the Largest Induced Tree Problem in Random Graphs.
RAIRO Theor. Informatics Appl.
Marco Protasi, Maurizio Talamo
1986 B conf
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
MFCS
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo
1985 — conf
On the Maximum Size of Random Trees.
TAPSOFT, Vol.1
Marco Protasi, Maurizio Talamo
1983 B conf
A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems.
FCT
Marco Protasi, Maurizio Talamo
1983 — ed.
CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings
CAAP
Giorgio Ausiello, Marco Protasi
1983 B conf
Probabilistic Models for Database Schemes and Random Hypergraphs.
WG
Giorgio Ausiello, Marco Protasi, Maurizio Talamo
1983 J jnl
The Largest Tree in a Random Graph.
Theor. Comput. Sci.
Alberto Marchetti-Spaccamela, Marco Protasi
1981 — conf
Full Approximatibility of a Class of Problems over Power Sets.
CAAP
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
1981 J jnl
Lattice theoretic ordering properties for NP-complete optimization problems.
Fundam. Informaticae
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
1981 B conf
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.
FCT
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
1980 J jnl
Structure Preserving Reductions among Convex Optimization Problems.
J. Comput. Syst. Sci.
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
1980 J jnl
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems.
Theor. Comput. Sci.
Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
1977 B conf
Classes of Structurally Isomorphic {NP}-Optimization Problems.
MFCS
Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi
1977 A* conf
On the Structure of Combinatorial Problems and Structure Preserving Reductions.
ICALP
Giorgio Ausiello, Alessandro D'Atri, Marco Protasi
1975 B conf
On the Comparison of Notions of Approximation.
MFCS
Giorgio Ausiello, Marco Protasi