1. Ingeniería

Emanuele Guido Fusco
Curriculum Vitae
Contact information
Born on March 22, 1977 in Milan (Italy). Italian citizen.
Post-doc at the Department of Computer, Control, and Management Engineering, Sapienza,
University of Rome.
E-mail:
Home page:
Office address:
Phone:
[email protected]
http://www.diag.uniroma1.it/~fusco/
Via Ariosto 25, 00185 — Rome, Italy
+39 06 7727 4045
Research interests
•
•
•
•
•
Algorithm design and analysis
Network communication algorithms
Parallel and distributed computing
Fault tolerant computing
Graph theory
Positions held
• Post-doc at the Department of Computer Science, Sapienza, University of Rome.
From January 2009 to June 2014.
• Invited researcher at the “Département d’informatique et d’ingénierie, Université du Québec
en Outaouais”, Gatineau, Québec, Canada, under the supervision of prof. Andrzej Pelc.
Periods:
- February 1 to March 15, 2012;
- September 6 to October 16, 2010;
- October 1 to November 30, 2009;
- October 1, 2007 to February 21, 2008.
Education
• PhD in Computer Science.
Sapienza, University of Rome, February 23, 2009
Thesis title:
Advisor:
Thesis committee:
External reviewers:
Algorithmic Problems in Network Communication
Prof. Tiziana Calamoneri
Prof. Rossella Petreschi
Prof. Luigi Vincenzo Mancini
Prof. Pierre Fraigniaud
Prof. Leszek Antoni Gąsieniec.
• Attended the “7th Max-Planck Advanced Course on the Foundations of Computer Science
(ADFOCS 2006)”, Saarbrüken, Germany. August 21 — 25, 2006.
• M.Sc. in Computer Science, Sapienza University of Rome, September 27, 2005
Thesis title:
L(1, 1)-colorazione di ipercubi
Supervisor:
Prof. Rossella Petreschi
Assistant supervisor: Prof. Irene Finocchi.
Page 1 of 7
Teaching
I carried out the following teaching at the Computer Science Department, Sapienza University
of Rome:
• Seminars: Big Data Computing (master degree course on big-data algorithms and programming). Academic year 2013/2014.
• Seminars: Algoritmi Avanzati (master degree course on parallel and distributed computing). Academic years 2008/2009, 2010/2011, and 2011/2012.
• Teaching assistant: Introduzione agli Algoritmi (1st year course on algorithms and data
structures). Academic year 2011/2012 and 2013/2014.
• Teaching assistant: Fondamenti di Programmazione (1st year course on computer programming). Academic year 2008/2009.
• Tutor: Laboratorio di Programmazione (1st year laboratory on computer programming).
Academic year 2007/2008.
Scientific activities
Program Committees
• 21st European Symposium on Algorithms (ESA), track A. Sophia Antipolis, France,
September 2013.
Participation in research projects
2010 — 2012
2007 — 2009
2006 — 2007
AlgoDEEP: Algorithmic Challenges for Data-intensive Processing on Emerging Computing Platforms. Funded by MIUR Progetti di Ricerca Scientifica
di Rilevante Interesse Nazionale.
MAINSTREAM: Algorithms for Massive Information Structures and Data
Streams. Funded by Ministero dell’Istruzione, Università e Ricerca Scientifica.
ALGO-NEXT: Algorithms for the Next Generation Internet and Web:
Methodologies, Design and Experiments. Funded by MIUR Progetti di
Ricerca Scientifica di Rilevante Interesse Nazionale.
Invited speaker
May 28, 2009
International Workshop on Mobility, Algorithms, Graph Theory in Dynamic
Networks (IMAGINE 2009), Piran, Slovenia. Title of the talk: “Information
Availability and Broadcast Efficiency In Distributed Environments”.
Reviewing activity:
•
•
•
•
•
•
•
•
ACM Journal of Experimental Algorithmics;
Algorithmica - Springer;
Discrete Mathematics - Elsevier;
IEEE Transactions on Parallel and Distributed Systems;
IEEE Transactions on Wireless Communications;
Networks - Wiley;
Journal of Discrete Algorithms - Elsevier;
International Conference on Algorithms and Complexity (CIAC);
Page 2 of 7
•
•
•
•
•
•
•
International Symposium on Distributed Computing (DISC);
European Symposium on Algorithms (ESA);
International Colloquium on Automata, Languages and Programming (ICALP);
IEEE International Parallel and Distributed Processing Symposium (IPDPS);
International Symposium on Mathematical Foundations of Computer Science (MFCS);
International Conference on Principles of Distributed Systems (OPODIS);
International Colloquium on Structural Information and Communication Complexity
(SIROCCO);
• Sensor Networks and Sistems for Pervasive Computing (PerSeNS);
• Symposium on Theoretical Aspects of Computer Science (STACS).
Organizing activity
2010
Organizing committee member of the “7th International Conference on Algorithms and Complexity” (CIAC 2010). http://ciac.di.uniroma1.it.
Seminars and talks at international conferences:
Oct. 15, 2013
July 11, 2013
Sept. 11, 2012
Dec. 13, 2011
Sept. 14, 2010
June 9, 2010
April 16, 2010
Sept. 29, 2009
March 7, 2009
Dec. 17, 2008
Nov. 24, 2008
Sept. 24, 2008
Use knowledge to learn faster: Topology recognition with advice.
DISC 2013, Jerusalem, Israel.
Learning a ring cheaply and fast.
ICALP 2013, Riga, Latvia.
Knowledge, Level of Symmetry, and Time of Leader Election.
ESA 2012, Ljubljana, Slovenia.
Communication complexity of consensus in anonymous message passing systems.
OPODIS 2011, Toulouse, France.
Video: http://conf.laas.fr/OPODIS2011/videos/13.mov.
How much memory is needed for leader election.
DISC 2010, Boston, USA.
Distributed tree comparison with nodes of limited memory.
SIROCCO 2010, Şirince, Turkey.
Resilient Dynamic Programming.
Kickoff meeting AlgoDEEP project, Bertinoro, Italy.
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information.
ICTCS 2009, Cremona, Italy.
Trade-offs between the Size of Advice and Broadcasting Time in Trees.
Final meeting MAINSTREAM project. Department of Computer and System Sciences, Sapienza, University of Rome.
Impact of Information on the Complexity of Asynchronous Radio Broadcasting.
OPODIS 2008, Luxor, Egypt.
Algorithmic Problems in Network Communication
Sm@rt seminars, Department of Computer Science, Sapienza, University of
Rome.
Broadcasting in UDG Radio Networks with Missing and Innacurate Information.
DISC 2008, Arcachon, France.
Page 3 of 7
June 14, 2008
Dec. 19, 2007
July 26, 2007
June 7, 2007
July 4, 2006
June 5, 2006
Trade-offs Between the Size of Advice and Broadcasting Time in Trees.
SPAA 2008, Munich, Germany.
Spanning Trees with Many Leaves in Regular Bipartite Graphs.
ISAAC 2007, Sendai, Japan.
Algorithmic Solutions for Problems on Wireless Networks
Sm@rt seminars, Department of Computer Science, Sapienza, University of
Rome.
Proxy Assignments for Filling Gaps in Wireless Ad-hoc Lattice Computers
SIROCCO 2007, Castiglioncello, Italy.
L(h, 1, 1)-Labeling of Outerplanar Graphs
SIROCCO 2006, Chester, UK.
Graph Coloring with Distance Constraints - Outerplanar Graphs
Sm@rt seminars, Department of Computer Science, Sapienza, University of
Rome.
List of publications
Journals:
1. Emanuele G. Fusco and Andrzej Pelc. Knowledge, level of symmetry, and time of leader
election Distributed Computing. December 2014. DOI 10.1007/s00446-014-0237-0.
2. Emanuele G. Fusco and Andrzej Pelc. Communication complexity of consensus in anonymous message passing systems. Accepted to Fundamenta Informaticæ, to appear.
3. Emanuele G. Fusco and Andrzej Pelc. Distributed tree comparison with nodes of limited
memory. Networks, 2012. doi: 10.1002/net.21463.
4. Emanuele G. Fusco and Andrzej Pelc. How much memory is needed for leader election.
Distributed Computing, volume 24(2), pages 65-78, October 2011. DOI: 10.1007/s00446011-0131-y.
5. Emanuele G. Fusco and Andrzej Pelc. Trade-offs between the size of advice and broadcasting time in trees. Algorithmica, volume 60(4), pages 719–734, August 2011. DOI
10.1007/s00453-009-9361-9.
6. Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, and Riccardo Silvestri.
Maximizing the number of broadcast operations in static random geometric ad-hoc networks. IEEE Transactions on Parallel and Distributed Systems, volume 22(2), pages
208–216, 2011. DOI 10.1109/TPDS.2010.77.
7. Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, and Simone
Silvestri. Push & Pull: autonomous deployment of mobile sensors for a complete coverage.
Wireless Networks, volume 16(3), pages: 607– 625, April 2010. ISSN:1022-0038, DOI
10.1007/s11276-008-0157-7.
8. Emanuele G. Fusco and Andrzej Pelc. Broadcasting in UDG radio networks with missing
and inaccurate information. Distributed Computing, volume 22(3), pages 167–183, March
2010. DOI 10.1007/s00446-010-0093-5.
9. Saverio Caminiti, Emanuele G. Fusco, and Rossella Petreschi. Bijective linear time coding
and decoding for k-trees. Theory of Computing Systems, volume 46(2), pages: 284–300,
February 2010. ISSN:1432-4350, DOI 10.1007/s00224-008-9131-0.
Page 4 of 7
10. Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, and Paola Vocca. L(h,1,1)labeling of outerplanar graphs. Mathematical Methods of Operations Research, volume 69,
pages 307–321, 2009.
11. Emanuele G. Fusco and Andrzej Pelc. Acknowledged broadcasting in ad hoc radio
networks. Information Processing Letters, volume 109(2), pages 136–141, 2008. DOI
10.1016/j.ipl.2008.09.011.
12. Saverio Caminiti and Emanuele G. Fusco. On the number of labeled k-arch graphs.
Journal of Integer Sequences, 10(7), Article 07.7.5, 2007.
Conferences:
1. Emanuele G. Fusco, Andrzej Pelc, and Rossella Petreschi. Use knowledge to learn faster:
Topology recognition with advice. In proc. of 27th International Symposium on Distributed
Computing (DISC 2013), Volume 8205 of Lecture Notes in Computer Science, pages 31–45.
Springer, 2013.
2. Emanuele G. Fusco, Andrzej Pelc, and Rossella Petreschi. Learning a ring cheaply and
fast. In proc. of 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), Volume 7966 of Lecture Notes in Computer Science, pages 557–568.
Springer, 2013.
3. Emanuele G. Fusco and Andrzej Pelc. Knowledge, Level of Symmetry, and Time of Leader
Election. In proc. of 20th Annual European Symposium on Algorithms (ESA 2012), volume
7501 of Lecture Notes in Computer Science, pages 479–490. Springer, 2012.
4. Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, and Francesco Silvestri. Dynamic
programming in faulty memory hierarchies (cache-obliviously). In proc. of Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS
2011), volume 13 of LIPIcs, pages 433–444, 2011.
5. Emanuele G. Fusco and Andrzej Pelc. Communication complexity of consensus in anonymous message passing systems. In proc. of 15th International Conference On Principles Of
Distributed Systems (OPODIS 2011), volume 7109 of Lecture Notes in Computer Science,
pages 191–206. Springer, 2011.
6. Saverio Caminiti, Irene Finocchi, and Emanuele G. Fusco. Local dependency dynamic
programming in the presence of memory faults. In proc. of 28th International Symposium
on Theoretical Aspects of Computer Science (STACS 2011), pages 45–56. 2011.
7. Emanuele G. Fusco and Andrzej Pelc. Distributed tree comparison with nodes of limited memory. In proc. of 17th International Colloquium on Structural Information and
Communication Complexity (SIROCCO 2010), volume 6058 of Lecture Notes in Computer
Science, pages 142–156, Springer, 2010.
8. Emanuele G. Fusco and Andrzej Pelc. How much memory is needed for leader election.
In proc. of 24th International Symposium on Distributed Computing (DISC 2010), volume
6343 of Lecture Notes in Computer Science, pages 251–266. Springer, 2010.
9. Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, and Simone
Silvestri. Snap and spread: A self-deployment algorithm for mobile sensor networks. In
proc. of International Conference on Distributed Computing in Sensor Systems (DCOSS
2008), volume 5067 of Lecture Notes in Computer Science, pages 451–456. Springer, 2008.
Page 5 of 7
10. Novella Bartolini, Tiziana Calamoneri, Emanuele G. Fusco, Annalisa Massini, and Simone
Silvestri. Autonomous deployment of self-organizing mobile sensors for a complete coverage. In proc. of third International Workshop on Self-Organizing Systems (IWSOS 2008),
volume 5343 of Lecture Notes in Computer Science, pages 194–205, Springer, 2008.
11. Tiziana Calamoneri, Emanuele G. Fusco, and Andrzej Pelc. Impact of information on the
complexity of asynchronous radio broadcasting. In proc. of 12th International Conference
On Principles Of Distributed Systems (OPODIS 2008), volume 5401 of Lecture Notes in
Computer Science, pages 311–330. Springer, 2008.
12. Irene Finocchi, Emanuele G. Fusco, and Rossella Petreschi. A note on algebraic hypercube
colorings. In proc. of 5th International Conference on Information Technology : New
Generations (ITNG 2008), pages 869–874. IEEE Computer Society, 2008.
13. Emanuele G. Fusco and Andrzej Pelc. Broadcasting in UDG radio networks with missing
and inaccurate information. In proc. of 22nd International Symposium on Distributed
Computing (DISC 2008), volume 5218 of Lecture Notes in Computer Science, pages 257–
273. Springer, 2008.
14. Emanuele G. Fusco and Andrzej Pelc. Trade-offs between the size of advice and broadcasting time in trees. In proc. of 20th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2008), pages 77–84. ACM, 2008.
15. Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, and Riccardo Silvestri.
Maximizing the number of broadcast operations in static random geometric ad-hoc networks. In proc. of 11th International Conference On Principles Of Distributed Systems
(OPODIS 2007), volume 4878 of Lecture Notes in Computer Science, pages 247–259.
Springer, 2007.
16. Tiziana Calamoneri, Emanuele G. Fusco, Anil M. Shende, and Sunil M. Shende. Proxy
assignments for filling gaps in wireless ad-hoc lattice computers. In proc. of 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO
2007), volume 4474 of Lecture Notes in Computer Science, pages 208–221. Springer, 2007.
17. Saverio Caminiti, Emanuele G. Fusco, and Rossella Petreschi. A bijective code for k-trees
with linear time encoding and decoding. In proc. of International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007), volume
4614 of Lecture Notes in Computer Science, pages 408–420, Springer, 2007.
18. Emanuele G. Fusco and Angelo Monti. Spanning trees with many leaves in regular bipartite graphs. In proc. of The 18th International Symposium on Algorithms and Computation (ISAAC 2007), volume 4835 of Lecture Notes in Computer Science, pages 904–914.
Springer, 2007.
19. Tiziana Calamoneri, Emanuele G. Fusco, Richard B. Tan, and Paola Vocca. L(h, 1, 1)labeling of outerplanar graphs. In proc. of 13th International Colloquium on Structural
Information and Communication Complexity (SIROCCO 2006), volume 4056 of Lecture
Notes in Computer Science, pages 268–279. Springer, 2006.
PhD Thesis:
• Emanuele G. Fusco. Algorithmic Problems in Network Communication. 2008.
Page 6 of 7
Manuscripts:
• Irene Finocchi, Marco Finocchi, and Emanuele G. Fusco. Clique counting in MapReduce:
theory and experiments. http://arxiv.org/abs/1403.0734 – 2014.
Last updated: January 30, 2015
Page 7 of 7