Giovanna Melideo

Orcid: 0000-0002-3208-8938

Affiliations:
  • University of L'Aquila, Italy


According to our database1, Giovanna Melideo authored at least 30 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Learning Iteration for Grades 2-3: Puzzles vs. UMC in Code.org.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

2022
On Pareto optimality in social distance games.
Artif. Intell., 2022

2020
Selfish colorful bin packing games.
J. Comb. Optim., 2020

Supporting the Construction of Learning Paths in a Competency-Based Informatics Curriculum.
Proceedings of the Methodologies and Intelligent Systems for Technology Enhanced Learning, 2020

2019
On Non-Cooperativeness in Social Distance Games.
J. Artif. Intell. Res., 2019

2018
On Colorful Bin Packing Games.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Network Movement Games.
Theor. Comput. Sci., 2017

Nash Stability in Social Distance Games.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2012
Mobile Network Creation Games.
Proceedings of the Structural Information and Communication Complexity, 2012

2011
Experimental Evaluations of Algorithms for IP Table Minimization.
J. Interconnect. Networks, 2011

2010
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions.
Theory Comput. Syst., 2010

2008
On Nash equilibria for multicast transmissions in ad-hoc wireless networks.
Wirel. Networks, 2008

2006
Sharing the cost of multicast transmissions in wireless networks.
Theor. Comput. Sci., 2006

Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2004
Sharing the cost of multicast transmissions in wireless networks.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Truthful Mechanisms for Generalized Utilitarian Problems.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

An Improved Approximation Algorithm for the Minimum Energy Consumption Broadcast Subgraph.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003
Efficient Causality-Tracking Timestamping.
IEEE Trans. Knowl. Data Eng., 2003

k-Dependency Vectors: A Scalable Causality-Tracking Protocol.
Proceedings of the 11th Euromicro Workshop on Parallel, 2003

Quality of Service in Wireless Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
On the minimal information to encode timestamps in distributed computations.
Inf. Process. Lett., 2002

A Reference Architecture for the Certification of E-Services in a Digital Government Infrastructure.
Distributed Parallel Databases, 2002

Experiences and issues in the realization of e-government services.
Proceedings of the 12th International Workshop on Research Issues in Data Engineering: Engineering E-Commerce/E-Business Systems, 2002

A Context-Aware Approach to Infer Trust in Public Key Infrastructures.
Proceedings of the Certification and Security in E-Services, From E-Govenment to E-Business, IFIP 17<sup>th</sup> World Computer Congress, 2002

2001
Keeping coherence among web sources.
Proceedings of the 3rd International Workshop on Web Information and Data Management (WIDM 2001), 2001

2000
Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Tracking causality in distributed systems: a suite of efficient protocols.
Proceedings of the SIROCCO 7, 2000

Timestamping Algorithms: A Characterization and a Few Properties.
Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999
Linear Automata, Rational Series and a Theorem of Fine and Wilf.
Proceedings of the Jewels are Forever, 1999

1998
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.
Proceedings of the Algorithmic Learning Theory, 9th International Conference, 1998


  Loading...