( en | de | ru )

 

Disambiguation of "Marchetti-Spaccamela, Alberto"

Author of the publication

copydeleteadd this publication to your clipboard
Learning DNF Formulae Under Classes of Probability Distributions.

, , and . COLT, page 85-92. ACM, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Oliver Marchetti

Kurt Marchetti

Ilaria Marchetti

Lara Marchetti

Franck Marchetti

 

Other publications of authors with the same name

Graph-Based Analysis of the Metabolic Exchanges between Two Co-Resident Intracellular Symbionts, Baumannia cicadellinicola and Sulcia muelleri, with Their Insect Host, Homalodisca coagulata, , , , , , and . PLoS Comput Biol, 6 (9): e1000904+ (Sep 2, 2010)Learning Under Uniform Distribution., and . FCT, volume 380 of Lecture Notes in Computer Science, page 327-338. Springer, (1989)Probabilistic Analysis of Graph Colouring Algorithms., and . CAAP, volume 159 of Lecture Notes in Computer Science, page 332-340. Springer, (1983)Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract)., and . ICALP, volume 267 of Lecture Notes in Computer Science, page 445-456. Springer, (1987)Mixed-Criticality Scheduling of Sporadic Task Systems., , , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 555-566. Springer, (2011)Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks., , , , and . ESA, volume 6942 of Lecture Notes in Computer Science, page 723-735. Springer, (2011)Incremental Algorithms for the Single-Source Shortest Path Problem., , and . FSTTCS, volume 880 of Lecture Notes in Computer Science, page 113-124. Springer, (1994)Minimizing Flow Time in the Wireless Gathering Problem., , , and . STACS, volume 1 of LIPIcs, page 109-120. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)A Universal Error Measure for Input Predictions Applied to Online Graph Problems., , , , , and . NeurIPS, (2022)Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity., , , , , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 231-242. PMLR, (2021)