Marco Protasi

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

VLDB 2026 Research / reviewers in the wild / expert

dblp:32/4289 · DBLP profile ↗

← Back

23ranked-venue papers

2as first author

0since 2021 · last 2001

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 21 · 2 first-authorArtificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science 3 papers		Computational complexity · 100%
Artificial intelligence 1 paper		Learning theory · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Computational complexity learning theory	2	1994	On Learning Monotone DNF Formulae under Uniform Distributions · Inf. Comput. 1994 On the Learnability of DNF Formulae · ICALP 1988
Computational complexity › learning theory › boolean function learning DNF learning	1	1988	On the Learnability of DNF Formulae · ICALP 1988
Machine learning › Learning theory › computational learning theory boolean function learning	1	1988	On the Learnability of DNF Formulae · ICALP 1988
Computational complexity reduction	1	1977	On the Structure of Combinatorial Problems and Structure Preserving Reductions · ICALP 1977

Methods — techniques the papers use, named apart from their topics

computational learning theory · 0.0

Year	Publication	Venue	Position
2001	Reactive Local Search for the Maximum Clique Problem Roberto Battiti, Marco Protasi	Algorithmica	2
1999	Reactive Local Search Techniques for the Maximum k-conjunctive Constraint Satisfaction Problem (MAX-k-CCSP) Roberto Battiti, Marco Protasi	Discret. Appl. Math.	2
1997	Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent Monica Bianchini, Stefano Fanelli, Marco Gori, Marco Protasi	ICONIP (1)	4
1997	Preserving Approximation in the Min-Weighted Set Cover Problem Giorgio Gambosi, Marco Protasi, Maurizio Talamo	Discret. Appl. Math.	2
1996	Exploring and comparing the best "direct methods" for the efficient training of MLP-networks abstract It is well known that the main difficulties of the algorithms based on backpropagation are the susceptibility to local minima and the slow adaptivity to the patterns during the training. In this paper, we present a class of algorithms, which overcome the above difficulties by utilizing some "direct" numerical methods for the computation of the matrices of weights. In particular, we investigate the performances of the FBFBK-LSB (least-squares backpropagation) algorithms and iterative conjugate gradient singular-value decomposition (ICGSVD), respectively, introduced by Barmann and Biegler-Konig (1993) and by the authors. Numerical results on several benchmark problems show a major reliability and/or efficiency of our algorithm ICGSVD. M. Di Martino, Stefano Fanelli, Marco Protasi	IEEE Trans. Neural Networks	3
1995	Local Search, Reducibility and Approximability of NP-Optimization Problems Giorgio Ausiello, Marco Protasi	Inf. Process. Lett.	2
1995	Approximate Solution of NP Optimization Problems Giorgio Ausiello, Pierluigi Crescenzi, Marco Protasi	Theor. Comput. Sci.	3
1994	On Learning Monotone DNF Formulae under Uniform Distributions Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi	Inf. Comput.	3
1989	Learning Under Uniform Distribution Alberto Marchetti-Spaccamela, Marco Protasi	FCT	2
1989	An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests Giorgio Gambosi, Marco Protasi, Maurizio Talamo	FSTTCS	2
1989	On the Number of Arithmetical Operations for Finding Fibonacci Numbers Marco Protasi, Maurizio Talamo	Theor. Comput. Sci.	1
1988	On the Learnability of DNF Formulae Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi	ICALP	3
1986	Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo	MFCS	3
1983	A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph Problems Marco Protasi, Maurizio Talamo	FCT	1
1983	Probabilistic Models for Database Schemes and Random Hypergraphs Giorgio Ausiello, Marco Protasi, Maurizio Talamo	WG	2
1983	The Largest Tree in a Random Graph Alberto Marchetti-Spaccamela, Marco Protasi	Theor. Comput. Sci.	2
1981	Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi	FCT	3
1981	Lattice theoretic ordering properties for NP-complete optimization problems Giorgio Ausiello, Alessandro D'Atri, Marco Protasi	Fundam. Informaticae	3
1980	Structure Preserving Reductions among Convex Optimization Problems Giorgio Ausiello, Alessandro D'Atri, Marco Protasi	J. Comput. Syst. Sci.	3
1980	Toward a Unified Approach for the Classification of NP-Complete Optimization Problems Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi	Theor. Comput. Sci.	3
1977	On the Structure of Combinatorial Problems and Structure Preserving Reductions Giorgio Ausiello, Alessandro D'Atri, Marco Protasi	ICALP	3
1977	Classes of Structurally Isomorphic {NP}-Optimization Problems Giorgio Ausiello, Alessandro D'Atri, Marco Gaudiano, Marco Protasi	MFCS	4
1975	On the Comparison of Notions of Approximation Giorgio Ausiello, Marco Protasi	MFCS	2