Travelled to:1 × Finland
1 × Germany
1 × Hungary
1 × United Kingdom
3 × USA
Collaborated with:S.Leonardi C.Vercellis A.V.Goldberg L.Kucera M.Protasi A.Pelaggi D.Saccà R.M.Karp M.Luby C.Rutten S.v.d.Ster A.Wiese L.S.Buriol G.Frahling C.Sohler
Talks about:problem (3) knapsack (2) analysi (2) line (2) multidimension (1) probabilist (1) implement (1) algorithm (1) parallel (1) learnabl (1)
Person: Alberto Marchetti-Spaccamela
DBLP: Marchetti-Spaccamela:Alberto
Facilitated 3 volumes:
EdEdEdContributed to:
2012
20061995198819871987
1984Wrote 8 papers:
- ICALP-v1-2012-Marchetti-SpaccamelaRSW #parallel
- Assigning Sporadic Tasks to Unrelated Parallel Machines (AMS, CR, SvdS, AW), pp. 665–676.
- PODS-2006-BuriolFLMS #data type
- Counting triangles in data streams (LSB, GF, SL, AMS, CS), pp. 253–262.
- ICALP-1995-LeonardiM #online #resource management #scheduling
- On-line Resource Management with Applications to Routing and Scheduling (SL, AMS), pp. 303–314.
- ICALP-1988-KuceraMP #on the
- On the Learnability of DNF Formulae (LK, AMS, MP), pp. 347–361.
- ICALP-1987-Marchetti-SpaccamelaV #algorithm #online #performance #problem
- Efficient On-Line Algorithms for the Knapsack Problem (AMS, CV), pp. 445–456.
- PODS-1987-Marchetti-SpaccamelaPS #analysis #complexity #implementation #logic #query #worst-case
- Worst-case Complexity Analysis of Methods for Logic Query Implementation (AMS, AP, DS), pp. 294–301.
- STOC-1984-GoldbergM #on the #problem
- On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.
- STOC-1984-KarpLM #analysis #multi #probability #problem
- A Probabilistic Analysis of Multidimensional Bin Packing Problems (RMK, ML, AMS), pp. 289–298.