Giuseppe Antonio Di Luna

Orcid: 0000-0002-7150-0972

According to our database1, Giuseppe Antonio Di Luna authored at least 66 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks.
CoRR, 2024

Black Hole Search by a Set of Scattered Agents in Dynamic Rings.
CoRR, 2024

Efficient Computation in Congested Anonymous Dynamic Networks.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023
BinBench: a benchmark for x64 portable operating system interface binary function representations.
PeerJ Comput. Sci., 2023

Adversarial Attacks against Binary Similarity Systems.
CoRR, 2023

Optimal Computation in Leaderless and Multi-Leader Disconnected Anonymous Dynamic Networks.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Black Hole Search in Dynamic Rings: The Scattered Case.
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

Where Did My Variable Go? Poking Holes in Incomplete Debug Information.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022
Function Representations for Binary Similarity.
IEEE Trans. Dependable Secur. Comput., 2022

Special issue on Algorithmic Theory of Dynamic Networks and Its Applications - Preface.
J. Comput. Syst. Sci., 2022

TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications.
Distributed Comput., 2022

BinBert: Binary Code Understanding with a Fine-tunable and Execution-aware Transformer.
CoRR, 2022

Leaderless and Multi-Leader Computation in Disconnected Anonymous Dynamic Networks.
CoRR, 2022

Debugging Debug Information With Neural Networks.
IEEE Access, 2022

Computing in Anonymous Dynamic Networks Is Linear.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Compacting oblivious agents on dynamic rings.
PeerJ Comput. Sci., 2021

Black Hole Search in Dynamic Rings.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Who's debugging the debuggers? exposing debug information bugs in optimized binaries.
Proceedings of the ASPLOS '21: 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2021

2020
Gathering in dynamic rings.
Theor. Comput. Sci., 2020

Meeting in a polygon by anonymous oblivious robots.
Distributed Comput., 2020

Shape formation by programmable particles.
Distributed Comput., 2020

Fault-tolerant simulation of population protocols.
Distributed Comput., 2020

Distributed exploration of dynamic rings.
Distributed Comput., 2020

Who is Debugging the Debuggers? Exposing Debug Information Bugs in Optimized Binaries.
CoRR, 2020

Tight Bounds for Black Hole Search in Dynamic Rings.
CoRR, 2020

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Byzantine Generalized Lattice Agreement.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

Synchronous Byzantine Lattice Agreement in O(log(f) Rounds.
Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

Mobile RAM and Shape Formation by Programmable Particles.
Proceedings of the Euro-Par 2020: Parallel Processing, 2020

2019
Robots with Lights.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Mobile Agents on Dynamic Graphs.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Population protocols with faulty interactions: The impact of a leader.
Theor. Comput. Sci., 2019

Function Naming in Stripped Binaries Using Neural Networks.
CoRR, 2019

Compacting and Grouping Mobile Agents on Dynamic Rings.
Proceedings of the Theory and Applications of Models of Computation, 2019

Patrolling on Dynamic Ring Networks.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Oblivious Permutations on the Plane.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

SAFE: Self-Attentive Function Embeddings for Binary Similarity.
Proceedings of the Detection of Intrusions and Malware, and Vulnerability Assessment, 2019

2018
Unsupervised Features Extraction for Binary Similarity Using Graph Embedding Neural Networks.
CoRR, 2018

Line Recovery by Programmable Particles.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
On deterministic counting in anonymous dynamic networks.
PhD thesis, 2017

Mutual visibility by luminous robots without collisions.
Inf. Comput., 2017

Self-Stabilizing Meeting in a Polygon by Anonymous Oblivious Robots.
CoRR, 2017

Brief Announcement: Shape Formation by Programmable Particles.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Mediated Population Protocols: Leader Election and Applications.
Proceedings of the Theory and Applications of Models of Computation, 2017

On the Power of Weaker Pairwise Interaction: Fault-Tolerant Simulation of Population Protocols.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
Live Exploration of Dynamic Rings.
Proceedings of the 36th IEEE International Conference on Distributed Computing Systems, 2016

A Rupestrian Algorithm.
Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015
Investigating the Cost of Anonymity on Dynamic Networks.
CoRR, 2015

Brief Announcement: Investigating the Cost of Anonymity on Dynamic Networks.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Non Trivial Computations in Anonymous Dynamic Networks.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

2014
Fault-tolerant oblivious assignment with m slots in synchronous systems.
J. Parallel Distributed Comput., 2014

An event-based platform for collaborative threats detection and monitoring.
Inf. Syst., 2014

Robots with Lights: Overcoming Obstructed Visibility Without Colliding.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Counting in Anonymous Dynamic Networks under Worst-Case Adversary.
Proceedings of the IEEE 34th International Conference on Distributed Computing Systems, 2014

Conscious and Unconscious Counting on Anonymous Dynamic Networks.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

The overlay scan attack: inferring topologies of distributed pub/sub systems through broker saturation.
Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems, 2014

The Mutual Visibility Problem for Oblivious Robots.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Counting the Number of Homonyms in Dynamic Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Collaborative Detection of Coordinated Port Scans.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Understanding (Mis)Information Spreading for Improving Corporate Network Trustworthiness.
Proceedings of the Dependable Computing - 14th European Workshop, 2013

Counting in Anonymous Dynamic Networks: An Experimental Perspective.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Oblivious Assignment with m Slots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

Collaborative Inter-domain Stealthy Port Scan Detection Using Esper Complex Event Processing.
Proceedings of the Collaborative Financial Infrastructure Protection, 2012

2011
A Collaborative Event Processing System for Protection of Critical Infrastructures from Cyber Attacks.
Proceedings of the Computer Safety, Reliability, and Security, 2011

A Model for Continuous Query Latencies in Data Streams.
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing 2011, 2011


  Loading...